Complexity versus performance of capacity-achieving irregular repeat-accumulate codes on the binary erasure channel

IEEE Transactions on Information Theory

Volumn 50, Issue 6, 2004, Pages 1247-1256

  Sason, Igal ^a   Urbanke, Rüdiger ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b EPFL   (Switzerland)

Author keywords

Channel capacity; Complexity; Density evolution; Erasure channel; Irregular repeat accumulate (IRA) codes; Low density parity check (LDPC) codes; Message passing iterative (MPI) decoding

Indexed keywords

BINARY CODES; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; DECODING; SIGNAL ENCODING;

BINARY ERASURE CHANNEL; LOW DENSITY PARITY CHECK CODES; MESSAGE PASSING ITERATIVE DECODING; REPEAT ACCUMULATE CODE;

CHANNEL CAPACITY;

EID: 2942692033     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.828101     Document Type: Letter

References (9)

1. D. Divsalar, H. Jin, and R. J. McEliece, "Coding theorems for turbo-like codes," in Proc. 36th Allerton Conf. Communications, Control and Computing, Allerton, IL, Sept. 1998, pp. 201-210.
2. H. Jin, A. Khandekar, and R. J. McEliece "Irregular repeat-accumulate codes," in Proc. 2nd Int. Symp. Turbo Codes and Related Topics, Brest, France, Sept. 2000, pp. 1-8.
3. A. Khandekar and R. J. McEliece, "On the complexity of reliable communication on the erasure channel," in Proc. 2001 IEEE Int. Symp. Information Theory (ISIT2001), Washington, DC, June 2001, p. 1.
4. A. Khandekar, "Graph-based codes and iterative decoding," Ph.D. dissertation, Calif. Inst. Technol., Pasadena, 2002.
5. R. J. McEliece, "Achieving the Shannon limit: A progress report," in Proc. 38th Annu. Allerton Conf. Communication, Control and Computing, Allerton, IL, Oct. 5, 2000.
6. P. Oswald and A. Shokrollahi, "Capacity achieving sequences for the erasure channel," IEEE Trans. Inform. Theory, vol. 48, pp. 3017-3028, Dec. 2002.
7. I. Sason and R. Urbanke, "Parity-check density versus performance of binary linear block codes over memoryless symmetric channels," IEEE Trans. Inform. Theory, vol. 49, pp. 1611-1635, July 2003.
8. A. Shokrollahi, "New sequences of time erasure codes approaching channel capacity," in Proc. 13th Int. Symp. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1999, vol. 1719, pp. 65-76.
9. H. Pfister, I. Sason, and R. Urbanke, "Capacity-achieving ensembles for the binary erasure channel with bounded complexity," in Proc. 2004 IEEE Int. Symp. Information Theory, Chicago, IL, June/July 2004, to be published.