Simplified MAP algorithm suitable for implementationof turbo decoders
- 6 August 1998
- journal article
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 34 (16) , 1577-1578
- https://doi.org/10.1049/el:19981120
Abstract
A simplification of the MAP decoder for use in turbo decoders is presented. The simplification eliminates the need for a ROM or multiplexor-tree lookup table and replaces it with a constant value. Simulations show that the performance of turbo decoders is not adversely affected by this simplification.Keywords
This publication has 4 references indexed in Scilit:
- Low-complexity parallel-structure symbol-by-symbol detection for ISI channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An intuitive justification and a simplified implementation of the MAP decoder for convolutional codesIEEE Journal on Selected Areas in Communications, 1998
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)IEEE Transactions on Information Theory, 1974