An analysis of the block error probability performance of iterative decoding

Authors:
M. Lentmaier;D. V. Truhachev;K. Sh. Zigangirov;D. J. Costello
Affiliations:
Dept. of Electr. Eng., Notre Dame Univ., IN, USA;-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2005

Citing 0
Cited 6

A delay-reliability analysis for multihop underwater acoustic communication

Proceedings of the second workshop on Underwater networks
On the error-correcting capability of LDPC codes

Problems of Information Transmission
A locally encodable and decodable compressed data structure

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Generalized and doubly generalized LDPC codes with random component codes for the binary erasure channel

IEEE Transactions on Information Theory
Iterative decoding threshold analysis for LDPC convolutional codes

IEEE Transactions on Information Theory
Analysis and construction of full-diversity joint network-LDPC codes for cooperative communications

EURASIP Journal on Wireless Communications and Networking - Special issue on physical-layer network coding for wireless cooperative networks

Quantified Score

Hi-index	754.96

Visualization

Abstract

Asymptotic iterative decoding performance is analyzed for several classes of iteratively decodable codes when the block length of the codes N and the number of iterations I go to infinity. Three classes of codes are considered. These are Gallager's regular low-density parity-check (LDPC) codes, Tanner's generalized LDPC (GLDPC) codes, and the turbo codes due to Berrou et al. It is proved that there exist codes in these classes and iterative decoding algorithms for these codes for which not only the bit error probability Pb, but also the block (frame) error probability PB, goes to zero as N and I go to infinity.