Title :
On APP-decoding using BEAST
Author :
Bocharova, I.E. ; Johannesson, R. ; Kudryashov, B.D. ; Loncar, M.
Author_Institution :
Dept. of Inf. Syst., St. Petersburg Univ.
fDate :
June 27 2004-July 2 2004
Abstract :
Good approximations of code-symbol a-posteriori probabilities (APPs) are obtained using a list of the most likely codewords, instead of the whole code-book. This list is found by bidirectional efficient algorithm for searching code trees (BEAST), whose complexity is shown to be lower than of the known trellis-based algorithms
Keywords :
AWGN channels; channel coding; maximum likelihood decoding; probability; APP-decoding; BEAST; bidirectional efficient algorithm; code-symbol a-posteriori probabilities; searching code trees; Block codes; Councils; Density functional theory; Hamming distance; Iterative decoding; Maximum likelihood decoding;
Conference_Titel :
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Conference_Location :
Chicago, IL
Print_ISBN :
0-7803-8280-3
DOI :
10.1109/ISIT.2004.1365382
