On the complexity of turbo decoding algorithms
- 13 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 1439-1443
- https://doi.org/10.1109/vetecs.2001.944625
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- A Viterbi algorithm with soft-decision outputs and its applicationsPublished 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
- A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domainPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the equivalence between SOVA and max-log-MAP decodingsIEEE Communications Letters, 1998
- An intuitive justification and a simplified implementation of the MAP decoder for convolutional codesIEEE Journal on Selected Areas in Communications, 1998
- Iterative decoding of binary block and convolutional codesIEEE Transactions on Information Theory, 1996
- Pondération des symboles décodés par l’algorithme de ViterbiAnnals of Telecommunications, 1987
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)IEEE Transactions on Information Theory, 1974