Implementation of a low complexity, low power, integer-based Turbo decoder

Conference Record / IEEE Global Telecommunications Conference

Volumn 2, Issue , 2001, Pages 946-951

  Wu, Peter H Y ^a   Pisuk, Stephen M ^a  

^a MIT LINCOLN LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIT ERROR RATE; COMMUNICATION CHANNELS (INFORMATION THEORY); DIGITAL ARITHMETIC; FIELD PROGRAMMABLE GATE ARRAYS; THROUGHPUT; TURBO CODES;

TURBO DECODERS;

DECODING;

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

References (17)

1. Near shannon limit error-correcting coding and decoding: Turbo codes
2. A comparison of optimal and suboptimal MAP decoding algorithms operating in the Log domain
3. Linearly approximated Log-MAP algorithms for Turbo decoding
4. Ponderation des symboles decodes par l'algorithm de Viterbi
5. A Viterbi algorithm with soft-decision outputs and its applications
6. On the equivalence between SOVA and Max-Log-MAP decodings
7. On the complexity of Turbo decoding algorithms
8. Design of fixed-point iterative decoders for concatenated codes with interleavers
9. Turbo-decoder quantization for UMTS
10. MAP-algorithm with fixed-point representation for software radios
11. An implementation method of a Turbo-code decoder using a block-wise MAP algorithm
12. Improving the Max-Log-MAP turbo decoder
13. An intuitive justification and a simplified implementation of the MAP decoder for convolutional codes
14. Optimal quantization for soft-decision Turbo decoder
15. Viterbi decoding for satellite and space communications
16. Turbo-decoding without SNR estimation