TY - GEN
T1 - Asymptotic analysis of LDPC codes with depth-2 connectivity distributions over BEC
AU - Jang, Min
AU - Kang, Jin Whan
AU - Kim, Jong Hwan
AU - Kim, Sang Hyo
PY - 2013
Y1 - 2013
N2 - This paper deals with the randomness of depth-2 connectivity of LDPC ensembles. We study how the randomness of LDPC graphs affect asymptotic performance over binary erasure channel (BEC). First, a new attribute, degree-spectrum distribution, is defined to specify the connectivity of more detailed ensembles than those defined by degree distribution. With this, specified ensembles become subsets of conventional ensemble, and we develop a new density evolution method. Some extreme cases of specified ensembles are given, and we prove that the random specified ensemble is better than other regularized types.
AB - This paper deals with the randomness of depth-2 connectivity of LDPC ensembles. We study how the randomness of LDPC graphs affect asymptotic performance over binary erasure channel (BEC). First, a new attribute, degree-spectrum distribution, is defined to specify the connectivity of more detailed ensembles than those defined by degree distribution. With this, specified ensembles become subsets of conventional ensemble, and we develop a new density evolution method. Some extreme cases of specified ensembles are given, and we prove that the random specified ensemble is better than other regularized types.
UR - https://www.scopus.com/pages/publications/84890344432
U2 - 10.1109/ISIT.2013.6620515
DO - 10.1109/ISIT.2013.6620515
M3 - Conference contribution
AN - SCOPUS:84890344432
SN - 9781479904464
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1690
EP - 1694
BT - 2013 IEEE International Symposium on Information Theory, ISIT 2013
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2013 IEEE International Symposium on Information Theory, ISIT 2013
Y2 - 7 July 2013 through 12 July 2013
ER -