A new random construction for low-density parity-check codes

Author

Huang Zhonghu ; Lianfeng, Shen ; Zhihui, Ye

Author_Institution

Inst. of communication engineering, Univ. of Sci. & Technol., Nanjing, China

Volume

1

fYear

2005

Firstpage

139

Abstract

This paper gives a new random construction for LDPC codes, which uses an iterative algorithm to avoid short cycles in the Tanner graph. The construction method has low complexity and great flexible choice in LDPC code parameters including code length, code rate, least girth of the graph, and the weight of column and row in the parity-check matrix. The method can be applied to the irregular LDPC codes and strict regular LDPC codes. Simulations show that the method performs well with iterative decoding.

Keywords

graph theory; iterative decoding; matrix algebra; parity check codes; random codes; Tanner graph; code length; code rate; column row weight; complexity; irregular LDPC codes; iterative decoding; least girth; low-density parity-check codes; parity-check matrix; random construction; strict regular LDPC codes; Error analysis; Iterative algorithms; Iterative decoding; Iterative methods; Mobile communication; Paper technology; Parity check codes; Programmable logic arrays; Reed-Solomon codes; Sum product algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, Circuits and Systems, 2005. Proceedings. 2005 International Conference on

Print_ISBN

0-7803-9015-6

Type

conf

DOI

10.1109/ICCCAS.2005.1493379

Filename

1493379