Capacity-achieving ensembles for the binary erasure channel with bounded complexity

IEEE Transactions on Information Theory

Volumn 51, Issue 7, 2005, Pages 2352-2379

  Pfister, Henry D ^a,b   Sason, Igal ^c   Urbanke, Rüdiger ^b  

^a QUALCOMM INC   (United States)

^b EPFL   (Switzerland)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Binary erasure channel (BEC); Codes on graphs; Degree distribution (d.d.); Density evolution (DE); Irregular repeat accumulate (IRA) codes; Low density parity check (LDPC) codes; Memoryless binary input output symmetric (MBIOS) channel; Message passing iterative (MPI) decoding; Punctured bits; State nodes; Tanner graph

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; DECODING; ENCODING (SYMBOLS); GRAPH THEORY; INFORMATION THEORY; ITERATIVE METHODS;

BINARY ERASURE CHANNEL (BEC); CODES ON GRAPHS; DEGREE DISTRIBUTION; DENSITY EVOLUTION (DE); IRREGULAR REPEAT-ACCUMULATE (IRA) CODES; LOW DENSITY PARITY CHECK (LDPC) CODES; MEMORYLESS BINARY INPUT OUTPUT SYMMETRIC (MBIOS) CHANNEL; MESSAGE PASSING ITERATIVE (MPI) DECODING; PUNCTURED BITS; TANNER GRAPH;

CHANNEL CAPACITY;

EID: 23744478375     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2005.850079     Document Type: Article

References (19)

1. N. G. De Bruijn, Asymptotic Methods in Analysis. New York: Dover, 1981.
2. D. Burshtein, M. Krivelevich, S. Litsyn, and G. Miller, "Upper bounds on the rate of LDPC codes," IEEE Trans. Inf. Theory, vol. 48, no. 9, pp. 2437-2449, Sep. 2002.
3. P. Flajolet and A. Odlyzko, "Singularity analysis of generating functions," SIAM J. Discr. Math., vol. 3, no. 2, pp. 216-240, 1990.
4. H. Jin, A. Khandekar, and R. J. McEliece, "Irregular repeat-accumulate codes," in Proc. 2nd Int. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 2000, pp. 1-8.
5. A. Khandekar and R. J. McEliece, "On the complexity of reliable communication on the erasure channel," in Proc. IEEE Int. Symp. Information Theory (ISIT2001), Washington, DC, Jun. 2001, p. 1.
6. A. Khandekar, "Graph-based codes and iterative decoding," Ph.D. dissertation, Calif. Inst. Technol., Pasadena, CA, 2002.
7. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Practical loss-resilient codes," in Proc. 29th Annu. Symp. Theory of Computing, El Paso, TX, May 1997, pp. 150-159.
8. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001.
9. P. Oswald and A. Shokrollahi, "Capacity-achieving sequences for the erasure channel," IEEE Trans. Inf. Theory, vol. 48, no. 12, pp. 3017-3028, Dec. 2002.
10. H. D. Pfister, "On the capacity of finite state channels and the analysis of convolutional accumulate-m codes," Ph.D. dissertation, Univ. Calif., San Diego, La Jolla, 2003.
11. H. D. Pfister and P. H. Siegel, "Joint iterative decoding of LDPC codes and channels with memory," in Proc. 3rd Int. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 2003, pp. 15-18.
12. H. D. Pfister and I. Sason, "Accumulate-repeat-accumulate codes: Systematic codes achieving the binary erasure channel capacity with bounded complexity," to be presented at the 43rd Annual Allerton Conference on Communication, Control and Computing, Monticello, IL, Sep. 2005.
13. T. J. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
14. T. Richardson and R. Urbanke. Multi-Edge Type LDPC Codes. [Online]. Available: http://lthcwww.epfl.ch/papers/multiedge.ps
15. I. Sason and R. Urbanke, "Parity-check density versus performance of binary linear block codes over memoryless symmetric channels," IEEE Trans. Inf. Theory, vol. 49, no. 7, pp. 1611-1635, Jul. 2003.
16. I. Sason and R. Urbanke, "Complexity versus performance of capacity-achieving irregular repeat-accumulate codes on the binary erasure channel," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1247-1256, Jun. 2004.
17. A. Shokrollahi, "New sequences of time erasure codes approaching channel capacity," in Proc. 13th Int. Symp. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Lectures Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1999, vol. 1719, pp. 65-76.
18. A. Shokrollahi, "Raptor codes," in Proc. IEEE Int. Symp. Information Theory (ISIT2004), Chicago, IL, Jun./Jul. 2004, p. 36.
19. S. ten Brink and G. Kramer, "Design of repeat-accumulate codes for iterative decoding and detection," IEEE Trans. Signal Process., vol. 51, no. 11, pp. 2764-2772, Nov. 2003.