A modified PEG algorithm for construction of LDPC codes with strictly concentrated check-node degree distributions

IEEE Wireless Communications and Networking Conference, WCNC

Volumn , Issue , 2007, Pages 565-569

  Chen, Hua ^a   Cao, Zhigang ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BLOCK CODES; COMPUTATIONAL EFFICIENCY; COMPUTER SIMULATION; SIGNAL TO NOISE RATIO;

CHECK NODE DEGREE DISTRIBUTIONS; FINITE BLOCK LENGTHS; IRREGULAR CODES; PROGRESSIVE EDGE GROWTH (PEG);

SIGNAL ENCODING;

EID: 36348962908     PISSN: 15253511     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WCNC.2007.109     Document Type: Conference Paper

References (14)

1. R. G. Gallager, Low Density Parity Check Codes, MIT Press, Cambridge, Mass., 1963.
2. X. Y. Hu, E. Eleftheriou, and D. M. Arnold, "Progressive edge-growth Tanner graphs," in Proc. IEEE Global Telecommun. Conf., San Antonio, Texas, USA, pp. 995-1001, Nov. 2001.
3. X. Y. Hu, E. Eleftheriou, and D. M. Arnold, "Irregular progressive edgegrowth (PEG) Tanner graphs," in Proc. IEEE Intl. Symp. Information Theory, Lausanne, Switzerland, pp. 480, June30-July 5, 2002.
4. X. Y. Hu, E. Eleftheriou, and D. M. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inform. Theory, vol. 5.1, pp. 386-398, Jan. 2005.
5. T. Richardson, M. A. Shokrollahi and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
6. S. Y. Chung, T. Richardson, R. Urbanke, "Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation," IEEE Trans, on Inform. Theory, vol. 47, no. 2, pp. 657-670, Feb. 2001.
7. G. Richter, "Construction of completely regular LDPC codes with large girth," in Proc. ETH Zurich 2003 Winter School on Coding and Information Theory, Ascona, Switzerland, Feb. 2003. Available [Online] at http://www.isi.ee.ethz.ch/winterschool/docs/richter.pdf.
8. G. Richter, "An improvement of the PEG algorithm for LDPC codes in the waterfall region", in Proc. International Conference on "Computer as a tool" (EUROCON), Belgrade, Serbia and Montenegro, Nov. 2005.
9. Y. Mao and A. Banihashemi, "A heuristic search for good low-density parity-check codes at short block lengths," in Proc. IEEE Int. Conf. Comm., Helsinki, Finland, pp. 41-44, Jun. 2001.
10. J. Thorpe, "Design of LDPC graphs for hardware implementation," in Proc. IEEE Intl. Symp. Information Theory, Lausanne, Switzerland, pp. 483, June 30-July 5, 2002.
11. H. Xiao and A. H. Banihashemi, "Improved progressive-edge-growth (PEG) construction of irregular LDPC codes," in Proc. IEEE Global Telecommun. Conf, Dallas, Texas, USA, Nov. 29-Dec. 3, 2004, pp. 489-492.
12. D. J. C. Mackay and M. S. Postal, "Weakness of Margulis and Ramanujan-Margulis low-density parity-check codes," Electronic Notes in Theoretical Computer Science 74, http://www.elsevier.nl/locate/entcs/ volume74 .html, 2003.
13. T. Richardson, "Error floors of LDPC codes," in Proc. 41st Annual Allerton Conference on Communication, Control, and Computing, Urbana-Champaign, pp. 1426-1435, Oct. 2003.
14. L. Sassatelli, W. Henkel, D. Declercq, "Check-irregular LDPC codes for unequal error protection under iterative decoding," in Proc. 4th Int. Symp. on Turbo Codes & Related Topics, Munich, Germany, Apr. 2006.