Reduced-complexity decoding of LDPC codes

IEEE Transactions on Communications

Volumn 53, Issue 8, 2005, Pages 1288-1299

  Chen, Jinghu ^a,b   Dholakia, Ajay ^c   Eleftheriou, Evangelos ^c   Fossorier, Marc P C ^a   Hu, Xiao Yu ^c  

^a University of Hawaii at Manoa   (United States)

^b QUALCOMM INC   (United States)

^c IBM RESEARCH ZURICH   (Switzerland)

Author keywords

Belief propagation (BP) decoding; Density evolution (DE); Iterative decoding; Low density parity check (LDPC) codes; Reduced complexity decoding

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DECODING; ITERATIVE METHODS;

BELIEF PROPAGATION (BP) DECODING; DENSITY EVOLUTION; LOW DENSITY PARITY CHECK (LDPC) CODES; REDUCED COMPLEXITY DECODING;

CODES (SYMBOLS);

EID: 24644490730     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2005.852852     Document Type: Article

References (29)

1. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
2. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, no. 3, pp. 399-431, Mar. 1999.
3. M. P. C. Fossorier, M. Mihaljevic, and H. Imai, "Reduced complexity iterative decoding of low density parity check codes based on belief propagation," IEEE Trans. Commun., vol. 47, no. 5, pp. 673-680, May 1999.
4. N. Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Linköping Univ., Linköping, Sweden, 1996.
5. E. Eleftheriou, T. Mittelholzer, and A. Dholakia, "Reduced-complexity decoding algorithm for low-density parity-check codes," IEE Electron. Lett., vol. 37, pp. 102-104, Jan. 2001.
6. J. Chen and M. P. C. Fossorier, "Decoding low-density parity-check codes with normalized APP-based algorithm," in Proc. IEEE Globecom, San Antonio, TX, Nov. 2001, pp. 1026-1030.
7. X.-Y. Hu, E. Eleftheriou, D.-M. Arnold, and A. Dholakia, "Efficient implementation of the sum-product algorithm for decoding LDPC codes," in Proc. IEEE Globecom, San Antonio, TX, Nov. 2001, pp. 1036-1036E.
8. J. Chen and M. P. C. Fossorier, "Near-optimum universal belief-propagation-based decoding of low-density parity-check codes," IEEE Trans. Commun., vol. 50, no. 3, pp. 406-414, Mar. 2002.
9. J. Chen and M. P. C. Fossorier, "Density evolution for two improved BP-based decoding algorithms of LDPC codes," IEEE Commun. Lett., vol. 6, no, 5, pp. 208-210, May 2002.
10. P. Li and W. K. Leung, "Decoding low-density parity-check codes with finite quantization bits," IEEE Commun. Lett., vol. 4, no. 2, pp. 62-64, Feb. 2000.
11. J. Chen and M. P. C. Fossorier, "Density evolution for BP-based decoding algorithms of LDPC codes and their quantized versions," in Proc. IEEE Globecom, Taipei, Taiwan, R.O.C., Nov. 2002, pp. 1026-1030.
12. T. J. Richardson and R. L. Urbanke, "The capacity of low-density paritycheck codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
13. S. Chung, "On the construction of some capacity-approaching coding schemes," Ph.D. dissertation, MIT, Cambridge, MA, Sep. 2000.
14. X. Wei and A. N. Akansu, "Density evolution for low-density paritycheck codes under Max-Log-MAP decoding," IEE Electron. Lett., vol. 37, pp. 1125-1126, Aug. 2001.
15. A. Anastasopoulos, "A comparison between the sum-product and the min-sum iterative detection algorithms based on density evolution," in Proc. IEEE Globecom, San Antonio, TX, Nov. 2001, pp. 1021-1025.
16. A. H. Banihashemi, J. Zhao, and F. Zarkeshvari, "On implementation of min-sum algorithm and its modifications for decoding LDPC codes," IEEE Trans. Commun., to be published.
17. R. Lucas, M. Fossorier, Y. Kou, and S. Lin, "Iterative decoding of one-step majority logic decodable codes based on belief propagation," IEEE Trans. Commun., vol. 48, no. 6, pp. 931-937, Jun. 2000.
18. Y. Kou, S. Lin, and M. Fossorier, "Low-density parity-check codes based on finite geometries: A rediscovery and more," IEEE Trans. Inf. Theory, vol. 47, no. 11, pp. 2711-2736, Nov. 2001.
19. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 9, pp. 533-548, Sep. 1981.
20. J. Hagenauer, E. Offer, and L. Papke, "Iterative decoding of binary block and convolutional codes," IEEE Trans. Inf. Theory, vol. 42, no. 3, pp. 429-445, Mar. 1996.
21. A. J. Blanksby and C. J. Howland, "A 690-mW 1-Gb/s 1024-b, rate-1/2 low-density parity-check code decoder," IEEE J. Solid-State Circuits, vol. 37, no. 3, pp. 404-412, Mar. 2002.
22. J. Erfanian, S. Pasupathy, and G. Gulak, "Reduced-complexity symbol detectors with parallel structures for ISI channels," IEEE Trans. Commun., vol. 42, no. 2-4, pp. 1661-1671, Feb.-Apr. 1994.
23. M. R. Yazdani, S. Hemati, and A. H. Banihashemi, "Improving belief propagation on graphs with cycles," IEEE Commun. Lett., vol. 8, no. 1, pp. 57-59, Jan. 2004.
24. K. Karplus and H. Krit, "A semi-systolic decoder for the PDSC-73 error-correcting code," in Discrete Applied Mathematics 33. Amsterdam, The Netherlands: North-Holland, 1991, pp. 109-128.
25. T. Zhang, Z. Wang, and K. K. Parhi, "On finite precesion implementation of low density parity check codes decoder," in Proc. IEEE Int. Symp. Circuits Syst., vol. 4, Sydney, Australia, May 2001, pp. 202-205.
26. Y.-C. He, H.-P. Li, S.-H. Sun, and L. Li, "Threshold-based design of quantized decoder for LDPC codes," in Proc. IEEE Int. Symp. Inf. Theory, Yokohama, Japan, Jun.-Jul. 2003, p. 149.
27. J. Chen, "Reduced-complexity decoding algorithms for low-density parity-check codes and turbo codes," Ph.D. dissertation, Univ. Hawaii, Honolulu, HI, Dec. 2003.
28. D. Declercq and F. Verdier, "A general framework for parallel implementation of LDPC codes," IEEE Trans. Inf. Theory, submitted for publication.
29. J. Thorpe. Low-complexity approximations to belief propagation for LDPC codes. [Online]. Available: http:www.ee.caltech.edu/jeremy/research/ papers/research.html