Title :
Tailbiting MAP decoders
Author :
Anderson, John B. ; Hladik, Stephen M.
Author_Institution :
Dept. of Electr. Comput. & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA
fDate :
2/1/1998 12:00:00 AM
Abstract :
We extend the MAP decoding algorithm of Bahl et al. (1974) to the case of tail-biting trellis codes. An algorithm is given that is based on finding an eigenvector, and another that avoids this. Several examples are given. The algorithm has application to turbo decoding and source-controlled channel decoding
Keywords :
channel coding; eigenvalues and eigenfunctions; maximum likelihood decoding; trellis codes; eigenvector; source-controlled channel decoding; tail-biting MAP decoders; tail-biting trellis codes; turbo decoding; Convolutional codes; Degradation; Error probability; Helium; Information theory; Iterative algorithms; Iterative decoding; Research and development; Systems engineering and theory; Viterbi algorithm;
Journal_Title :
Selected Areas in Communications, IEEE Journal on
