대한전자공학회:학술대회논문집 (Proceedings of the IEEK Conference)
- 대한전자공학회 2002년도 하계종합학술대회 논문집(1)
- /
- Pages.323-326
- /
- 2002
Improved Upper Bounds on Low Density Parity Check Codes Performance for the Input Binary AWGN Channel
- Yu Yi (Institute of Information and Communications, Chonbuk National University) ;
- Lee, Moon-Ho (Institute of Information and Communications, Chonbuk National University)
- 발행 : 2002.06.01
초록
In this paper, we study the improved bounds on the performance of low-density parity-check (LDPC) codes over binary-input additive white Gaussian noise (AWGN) channels with belief propagation (BP) decoding in log domain. We define an extended Gallager ensemble based on a new method of constructing parity check matrix and make use of this way to improve upper bound of LDPC codes. At the same time, many simulation results are presented in this paper. These results indicate the extended Gallager ensembles based on Hamming codes have typical minimum distance ratio, which is very close to the asymptotic Gilbert Varshamov bound and the superior performance which is better than the original Gallager ensembles.
키워드