Regular and irregular progressive edge-growth tanner graphs

by: Xiao-Yu Hu, E Eleftheriou, DM Arnold

Information Theory, IEEE Transactions on, Vol. 51, No. 1. (2005), pp. 386-398.

View FullText article

IEEE Explore

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

marcosmuller

Find related articles with these CiteULike tags

no-tag

摘要

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.

@article{citeulike:474703, 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.}, author = {Hu, Xiao-Yu and Eleftheriou, E. and Arnold, D. M. }, citeulike-article-id = {474703}, journal = {Information Theory, IEEE Transactions on}, number = {1}, pages = {386--398}, posted-at = {2006-01-21 23:58:33}, priority = {2}, title = {Regular and irregular progressive edge-growth tanner graphs}, url = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=1377521}, volume = {51}, year = {2005} }

RIS record

TY - JOUR ID - citeulike:474703 L3 - citeulike-article-id:474703 TI - Regular and irregular progressive edge-growth tanner graphs JF - Information Theory, IEEE Transactions on VL - 51 IS - 1 SP - 386 EP - 398 N2 - 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. AU - Hu, Xiao-Yu AU - Eleftheriou, E AU - Arnold, DM PY - 2005/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1377521 ER -

RIS BibTeX