TY - GEN
T1 - Density evolution method and threshold decision for irregular LDPC codes
AU - Lin, Wang
AU - Juan, Xiao
AU - Chen, Guanrong
PY - 2004
Y1 - 2004
N2 - Density evolution is a new method for analyzing the asymptotic performance of network capability approaching error-correcting codes. For irregular LDPC codes with Message-Passing decoding, the density evolution method can track the messages to find out the threshold, enabling optimization of the degree distribution. In this paper, the principle of density evolution combined with the decoding process is firstly explored. Then, two algorithms for programming the evolution proceeding will be discussed: the discretized density evolution and the Gaussian approximation, as well as their application conditions. Finally, simulation results are presented.
AB - Density evolution is a new method for analyzing the asymptotic performance of network capability approaching error-correcting codes. For irregular LDPC codes with Message-Passing decoding, the density evolution method can track the messages to find out the threshold, enabling optimization of the degree distribution. In this paper, the principle of density evolution combined with the decoding process is firstly explored. Then, two algorithms for programming the evolution proceeding will be discussed: the discretized density evolution and the Gaussian approximation, as well as their application conditions. Finally, simulation results are presented.
KW - Density evolution
KW - Gaussian approximation
KW - Irregular LDPC codes
KW - Threshold
UR - https://www.scopus.com/pages/publications/11244291061
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-11244291061&origin=recordpage
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 0780386477
SN - 9780780386471
VL - 1
SP - 25
EP - 28
BT - 2004 International Conference on Communications, Circuits and Systems
T2 - 2004 International Conference on Communications, Circuits and Systems
Y2 - 27 June 2004 through 29 June 2004
ER -