Title :
Recursive Design of High Girth (2,k) LDPC Codes from (k,k) LDPC Codes
Author :
Tao, Xiongfei ; Zheng, Lixin ; Liu, Weizhong ; Liu, Dongsheng
Author_Institution :
Dept. of Electron. Sci. & Technol., Huazhong Univ. of Sci. & Technol., Wuhan, China
fDate :
1/1/2011 12:00:00 AM
Abstract :
An approach to construct column-weight-2 LDPC codes with high girth is presented. The approach derives a column-weight-2 LDPC code from the Tanner graph of a (k,k) QC-LDPC code. By the construction, the new LDPC codes double in girth. To construct the (k,k) QC-LDPC codes with desired girth, a search algorithm is proposed in this paper. The approach generates an example of a (2,3) LDPC code with a girth of 36, which is larger than the column-weight-2 LDPC codes constructed by the previously methods.
Keywords :
graph theory; parity check codes; QC-LDPC code; Tanner graph; column-weight-2 LDPC code; high girth LDPC codes; recursive design; search algorithm; AWGN; Algorithm design and analysis; Bipartite graph; Bit error rate; Geometry; Parity check codes; Sparse matrices; LDPC codes; column-weight-2; high girth; recursive design;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2010.112310.101867
