Paper Info
Title
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 also be applied to generate linear-time encodeable LDPC codes. Regular and irregular LDPC codes using PEG Tanner graphs and allowing symbol nodes to take values over GF(q) (q>2) are investigated. Simulation results show that the PEG algorithm is a powerful algorithm to generate good short-block-length LDPC codes.
Year
DOI
Venue
2005
10.1109/TIT.2004.839541
IEEE Transactions on Information Theory
Keywords
DocType
Volume
Galois fields,block codes,graph theory,iterative decoding,linear codes,parity check codes,GF(q),Galois field,PEG algorithm,Tanner graph construction,linear-time code,low-density parity-check code,progressive edge-growth,regular-irregular LDPC code,short-block-length code,symbol-check node,Girth,LDPC codes over,PEG Tanner graphs,low-density parity-check (LDPC) codes,progressive edge growth (PEG)
Journal
51
Issue
ISSN
Citations 
1
0018-9448
581
PageRank 
References 
Authors
27.04
36
3
Search Limit
100581
Name
Order
Citations
PageRank
Xiao Yu Hu1119760.14
Evangelos Eleftheriou21590118.20
D. M. Arnold361731.68