Augmented belief propagation decoding of low-density parity check codes

IEEE Transactions on Communications

Volumn 55, Issue 7, 2007, Pages 1308-1317

  Varnica, Nedeljko ^a,b   Fossorier, Marc P C ^c   Kavčić, Aleksandar ^a,c  

^a HARVARD UNIVERSITY   (United States)

^b MARVELL SEMICONDUCTOR INC   (United States)

^c University of Hawaii at Manoa   (United States)

Author keywords

Belief propagation (BP) decoding; Error floors; Low density parity check (LDPC) codes; Pseudocodewords

Indexed keywords

CHANNEL STATE INFORMATION; HEURISTIC ALGORITHMS; INTERSYMBOL INTERFERENCE;

BELIEF PROPAGATION DECODER; LOW-DENSITY PARITY CHECK CODES; MARGULIS CODE; PSEUDOCODEWORDS; SYMBOL SELECTION;

ITERATIVE DECODING;

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

References (30)

1. R. G. Gallager, Low-Density Parity Check Codes. Cambridge, MA: MIT Press, 1962.
2. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-codes," in Proc. IEEE Int. Conf. Commun., May 1993, pp. 1064-1070.
3. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low-density parity-check codes," Electron. Lett., vol. 32, pp. 1645-1646, 1996.
4. T. Etzion, A. Trachtenberg, and A. Vardy, "Which codes have cycle-free Tanner graphs?," IEEE Trans. Inf. Theory, vol. 45, no. 6, pp. 2173-2180, Sep. 1999.
5. M. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. Spielman, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 585-598, Feb. 2001.
6. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
7. S.-Y. Chung, G. D. Forney, Jr., T. J. Richardson, and R. Urbanke, "On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit," IEEE Commun. Lett., vol. 5, no. 2, pp. 58-60, Feb. 2001.
8. N. Varnica and A. Kavčiá, "Optimized low-density parity-check codes for partial response channels," IEEE Commun. Lett., vol. 7, no. 4, pp. 168-170, Apr. 2003.
9. R. M. Tanner, D. Sridhara, and T. Fuja, "A class of group-structured LDPC codes," in presented at the ICSTA 2001, Ambleside, U.K.
10. Y. Kou, S. Lin, and M. P. C. Fossorier, "Low density parity check codes based on finite geometries: A rediscovery and new results," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001.
11. J. Rosenthal and P. O. Vontobel, "Constructions of LDPC codes using Ramanujan graphs and ideas from Margulis," in Proc. Allerton Conf. Commun. Control, 2000, pp. 248-257.
12. A. Prabhakar and K. Narayanan, "Pseudo-random construction of low density parity check codes using linear congruential sequences," IEEE Trans. Commun., vol. 50, no. 9, pp. 1389-1396, Sep. 2002.
13. X.-Y. Hu, E. Eleftheriou, and D. M. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 386-398, Jan. 2005.
14. H. Xiao and A. H. Banihashemi, "Improved progressive-edge-growth (PEG) construction of irregular LDPC codes," IEEE Commun. Lett., vol. 8, no. 12, pp. 715-717, Dec. 2004.
15. T. Richardson, "Error floors of LDPC codes," presented at the Allerton Conf. Commun. Control, Monticello, IL, 2003.
16. H. Pishro-Nik and F. Fekri, "Improved decoding algorithms for low-density parity-check codes," presented at the 3rd Int. Conf. Turbo Codes Relat. Top., Brest, France, Aug. 2003.
17. D. J. MacKay and M. S. Postol,"Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes," Electron. Notes Theor. Comput. Sci., vol. 74, pp. 1-8, 2003.
18. J. Chen, A. Dholakia, E. Eleftheriou, M. P. C. Fossorier, and X.-Y. Hu, "Reduced complexity decoding of LDPC codes," IEEE Trans. Commun. vol. 53, no. 8, pp. 1288-1299, Aug. 2005.
19. J. Zhao, F. Zarkeshvari, and A. H. Banihashemi, "On implementation of min-sum algorithm and its modifications for decoding LDPC codes," IEEE Trans. Commun., vol. 53, no. 4, pp. 549-554, Apr. 2005.
20. 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.
21. N. Wiberg, "Codes and decoding on general graphs" Ph.D. dissertation, Linkoping Univ, Linkoping, Sweden, 1996.
22. R. Koetter and P. O. Vontobel, "Graph-covers and iterative decoding of finite length codes," presented at the 3rd Int. Symp. Turbo Codes Relat. Top., Brest, France, 2003.
23. R. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
24. A. Kavčić, X. Ma, and M. Mitzenmacher, "Binary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds," IEEE Trans. Inf. Theory, vol. 49, no. 7, pp. 1636-1652, Jul. 2003.
25. J. Hagenauer, E. Offer, and L. Papke, "Iterative decoding of binary block and convolutional codes," IEEE Trans. Inf. Theory, vol. 42, no. 2, pp. 429-445, Mar. 1996.
26. R. Shao, L. Shu, and M. P. C. Fossorier, "Two simple stopping criteria for turbo decoding," IEEE Trans. Commun., vol. 47, no. 8, pp. 1117-1120, Aug. 1999.
27. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
28. M. Isaka, M. P. C. Fossorier, and H. Imai, "On the suboptimality of iterative decoding for finite length codes," presented at the IEEE Int. Symp. Inf. Theory, Lausanne, Switzerland, Jul. 2002.
29. M. P. C. Fossorier, "Iterative reliability-based decoding of low-density parity check codes," IEEE J. Sel. Areas Commun., vol. 19, no. 5, pp. 908-917, May 2001.
30. D. Declercq and F. Verdier, "A general framework for parallel implementation of LDPC codes.," IEEE Trans. Inf., to be published.