DocumentCode
2462660
Title
Skewness and pseudocodewords in iterative decoding
Author
Frey, Brendan J. ; Kotter, Ralf ; Vardy, Alex
Author_Institution
Beckman Inst. for Adv. Sci. & Technol., Illinois Univ., Urbana, IL, USA
fYear
1998
fDate
16-21 Aug 1998
Firstpage
148
Abstract
Impressive performances by low-density parity-check codes and turbo codes have inspired researchers to determine how their iterative decoders depart from optimal decoding. Iterative decoding can be viewed as the application of the sum-product or min-sum algorithm in a graph that describes the constraints on a system of variables. The authors discuss here how iterative decoding maximizes correlation, and skewness and pseudocodewords in the decoding tree
Keywords
correlation theory; graph theory; iterative decoding; decoding tree; factor graphs; iterative decoding; low-density parity-check codes; min-sum algorithm; optimal decoding; pseudocodewords; skewness; sum-product; turbo codes; AWGN channels; Bit error rate; Computational modeling; Integrated circuit modeling; Iterative algorithms; Iterative decoding; Parity check codes; Predictive models; Tree graphs; Viterbi algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
0-7803-5000-6
Type
conf
DOI
10.1109/ISIT.1998.708741
Filename
708741
Link To Document