Back to Search
Start Over
Improved Bounds on the Word Error Probability of RA(2) Codes With Linear-Programming-Based Decoding.
- Source :
-
IEEE Transactions on Information Theory . Jan2005, Vol. 51 Issue 1, p265-280. 16p. - Publication Year :
- 2005
-
Abstract
- This paper deals with the linear-programming-based decoding algorithm of Feldman and Karger for repeat-accumulate "turbo-like" codes. We present a new structural characterization that captures the event that decoding fails. Based on this structural characterization, we develop polynomial algorithms that, given an RA (2) code, compute upper and lower bounds on the word error probability Pw for the binary-symmetric and the additive white Gaussian noise (AWGN) channels. Our experiments with an implementation of these algorithms for bounding Pw demonstrate in many interesting cases an improvement in the upper bound on the word error probability by a factor of over 1000 compared to the bounds by Feldman et al.. The experiments also indicate that the improvement in upper bound increases as the codeword length increase and the channel noise decrease. The computed lower bounds on the word error probability in our experiments are roughly ten times smaller than the upper bound. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 51
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 15748702
- Full Text :
- https://doi.org/10.1109/TIT.2004.839509