Recursive Design of High Girth (2,k) LDPC Codes from (k,k) LDPC Codes

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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE communications letters 2011-01, Vol.15 (1), p.70-72
Hauptverfasser:	Tao, Xiongfei, Zheng, Lixin, Liu, Weizhong, Liu, Dongsheng
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm design and analysis Applied sciences AWGN Bipartite graph Bit error rate Coding, codes column-weight-2 Construction Exact sciences and technology Geometry Graphs high girth Information, signal and communications theory LDPC codes Parity check codes Recursive recursive design Search algorithms Signal and communications theory Sparse matrices Telecommunications and information theory
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	1089-7798 1558-2558
DOI:	10.1109/LCOMM.2010.112310.101867