On the complexity of turbo decoding algorithms

IEEE Vehicular Technology Conference

Volumn 2, Issue 53ND, 2001, Pages 1439-1443

  Wu, P H Y ^a  

^a MIT LINCOLN LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECODING; TURBO CODES;

SOFT OUTPUT VITERBI ALGORITHM; TURBO DECODING;

DIGITAL COMMUNICATION SYSTEMS;

EID: 0035183031     PISSN: 07400551     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. Near Shannon limit error-correcting coding and decoding: Turbo codes
2. A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain
3. Optimal decoding of linear codes for minimizing symbol error rate
4. Ponderation des symboles decodes par l'agorithem de Viterbi
5. A Viterbi algorithm with soft-decision outputs and its application
6. On the equivalence between SOVA and Max-log-MAP decodings
7. An intuitive justification and a simplified implementation of the MAP decoder for convolutional codes
8. A soft-input soft-output maximum a posteriori (MAP) module to decode parallel and serial concatenated codes
9. Iterative decoding of binary block and convolutional codes