DocumentCode :
987310
Title :
Several properties of short LDPC codes
Author :
Wei, Lei
Author_Institution :
Sch. of Electr. Eng. & Comput. Sci., Univ. of Central Florida, Orlando, FL, USA
Volume :
52
Issue :
5
fYear :
2004
fDate :
5/1/2004 12:00:00 AM
Firstpage :
721
Lastpage :
727
Abstract :
In this paper, we present several properties on minimum distance(dmin) and girth(Gmin) in Tanner graphs for low-density parity-check (LDPC) codes with small left degrees. We show that the distance growth of (2, 4) LDPC codes is too slow to achieve the desired performance. We further give a tight upper bound on the maximum possible girth. The numerical results show that codes with large Gmin could outperform the average performance of regular ensembles of the LDPC codes over binary symmetric channels. The same codes perform about 1.5 dB away from the sphere-packing bound on additive white Gaussian noise channels.
Keywords :
AWGN channels; channel coding; concatenated codes; graph theory; iterative decoding; parity check codes; turbo codes; LDPC codes; Tanner graphs; additive white Gaussian noise channels; binary symmetric channels; concatenated systems; final length analysis; girth; low density parity check codes; minimum distance; turbo decoding; Additive white noise; Block codes; Communications Society; Computer science; Convolutional codes; Iterative decoding; NASA; Parity check codes; Turbo codes; Upper bound; Concatenated systems; LDPC; codes; final length analysis; iterative decoding; short low-density parity-check; turbo decoding;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/TCOMM.2004.826242
Filename :
1299062
Link To Document :
بازگشت