Conference
Regular and Irregular Progressive Edge-Growth Tanner Graphs
Abstract
We propose a general method for constructing Tanner graphs having a large girth by establishing edges or connections between symbol and check nodes in an edge-by-edge manner, called progressive edge-growth (PEG) algorithm. Lower bounds on the girth of PEG Tanner graphs and on the minimum distance of the resulting low-density parity-check (LDPC) codes are derived in terms of parameters of the graphs. Simple variations of the PEG algorithm can …
Authors
Hu X-Y; Eleftheriou E; Arnold DM
Volume
51
Pagination
pp. 386-398
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Publication Date
January 1, 2005
DOI
10.1109/tit.2004.839541
Conference proceedings
IEEE Transactions on Information Theory
Issue
1
ISSN
0018-9448