Tailbiting MAP decoders
- 1 January 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 16 (2) , 297-302
- https://doi.org/10.1109/49.661117
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 decodingKeywords
This publication has 5 references indexed in Scilit:
- Near optimum error correcting coding and decoding: turbo-codesIEEE Transactions on Communications, 1996
- Source-controlled channel decodingIEEE Transactions on Communications, 1995
- On Tail Biting Convolutional CodesIEEE Transactions on Communications, 1986
- Replication decodingIEEE Transactions on Information Theory, 1979
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)IEEE Transactions on Information Theory, 1974