Title :
Irregular progressive edge-growth (PEG) Tanner graphs
Author :
Hu, Xiao-Yu ; Eleftheriou, Evangelos ; Arnold, Dieter-Michael
Author_Institution :
IBM Zurich Res. Lab., Ruschlikon, Switzerland
Abstract :
A general method for constructing Tanner graphs having a large girth by progressively establishing edges between symbol and check nodes in an edge-by-edge manner, called progressive edge-growth (PEG) construction, is proposed. Such an approach is powerful for generating good regular and irregular LDPC codes of short and moderate block lengths.
Keywords :
graph theory; linear codes; parity check codes; sparse matrices; LDPC codes; Tanner graphs; check nodes; irregular codes; linear code; moderate block lengths; progressive edge-growth; regular codes; short block lengths; sparse parity check matrix; symbol nodes; Bipartite graph; Histograms; Laboratories; Linear code; Parity check codes; Power generation; Sparse matrices; Tree graphs;
Conference_Titel :
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN :
0-7803-7501-7
DOI :
10.1109/ISIT.2002.1023752
