Capacity achieving LDPC codes through puncturing

IEEE Transactions on Information Theory

Volumn 54, Issue 10, 2008, Pages 4698-4706

  Hsu, Chun Hao ^a   Anastasopoulos, Achilleas ^b  

^a QUALCOMM INC   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Asymptotic growth rate; Average weight distribution; Capacity achieving codes; Low density parity check (LDPC) codes; Maximum likelihood (ML) decoding; Punctured codes; Rate adaptable codes

Indexed keywords

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

References (23)

1. R. G. Gallager, Low-Density Parity-Check Codes.. Cambridge, MA: MIT Press, 1963.
2. M. A. Shokrollahi, "New sequences of linear time erasure codes approaching channel capacity," in Proc. IIEEE nt. Symp. Information Theory and its Applications, Honolulu, HI, Nov. 1999, pp. 65-76.
3. A. Shokrollahi, "Capacity-achieving sequences," in Codes, Systems, and Graphical Models, ser. Ser. IMA Volumes in Mathematics and its Applications, B. Marcus and J. Rosenthal, Eds. New York: Springer-Verlag, 2000, vol. 123, pp. 153-166.
4. 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.
5. 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.
6. H. D. Pfister, I. Sason, and R. Urbanke, "Capacity-achieving ensembles for the binary erasure channel with bounded complexity," IEEE Trans. Inf. Theory, vol. 51, no. 7, pp. 2352-2379, Jul. 2005.
7. G. D. Forney Jr., Concatenated Codes. Cambridge, MA: MIT Press, 1966.
8. A. Barg and G. Zémor, "Error exponents of expander codes," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1725-1729, Jun. 2002.
9. C.-H. Hsu and A. Anastasopoulos, "Asymptotic weight distributions of irregular repeat-accumulate codes," in Proc. Globecom Conf., St. Louis, MO, Nov. 2005, pp. 1147-1151.
10. J. Ha, J. Kim, and S. W. McLaughlin, "Rate-compatible puncturing of low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 50, no. 11, pp. 2824-2836, Nov. 2004.
11. S.-Y. Chung, T. J. Richardson, and R. L. Urbanke, "Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 657-670, Feb. 2001.
12. H. Pishro-Nik and F. Fekri, "Results on punctured LDPC codes and improved iterative decoding," IEEE Trans. Inf. Theory, vol. 53, no. 2, pp. 599-614, Feb. 2007.
13. T. J. Richardson and R. L. 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. G. Miller and D. Burshtein, "Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2696-2710, Nov. 2001.
15. R. Liu, P. Spasojević, and E. Soljanin, "Reliable channel regions for good binary codes transmitted over parallel channels," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1405-1424, Apr. 2006.
16. I. Sason and G. Wiechman, "On achievable rates and complexity of LDPC codes over parallel channels: Bounds and applications," IEEE Trans. Information Theory, vol. 53, no. 2, pp. 580-598, Feb. 2007.
17. I. Sason and I. Goldenberg, "Coding for parallel channels: Gallager bounds and applications to turbo-like codes," IEEE Trans. Inf. Theory, vol. 53, no. 7, pp. 2394-2428, Jul. 2007.
18. I. Sason and S. Shamai (Shitz), Performance Analysis of Linear Codes Under Maximum-Likelihood Decoding: A Tutorial. Boston, MA: Now Publishers, 2006.
19. S. Litsyn and V. Shevelev, "On ensembles of low-density parity-check codes: Asymptotic distance distributions," IEEE Trans. Inf. Theory vol. 48, no. 4, pp. 887-908, Apr. 2002.
20. O. Pretzel, Error-Correcting Codes and Finite Fields. New York: Oxford Univ. Press, 1992.
21. G. Poltyrev, "Bounds on the decoding error probability of binary linear codes via their spectra," IEEE Trans. Inf. Theory, vol. 40, no. 4, pp. 1284-1292, Jul. 1994.
22. N. Shulman and M. Feder, "Random coding techniques for nonrandom codes," IEEE Trans. Inf. Theory, vol. 45, no. 6, pp. 2101-2104, Sep. 1999.
23. D. Divsalar, A Simple Tight Bound on Error Probability of Block Codes with Application to Turbo Codes Jet Propulsion Lab., Pasadena, CA, Tech. Rep. TMO Progr. Rep. 42-139, Nov. 1999.