Design of fixed-point iterative decoders for concatenated codes with interleavers

IEEE Journal on Selected Areas in Communications

Volumn 19, Issue 5, 2001, Pages 871-882

  Montorsi, G ^a,b   Benedetto, S ^a,b  

^a IEEE   (Italy)

^b POLITECNICO DI TORINO   (Italy)

Author keywords

Iterative decoders; Quantization; Turbo codes

Indexed keywords

INTERLEAVERS; PARALLEL CONCATENATED CONVOLUTIONAL CODES (PCCC);

ALGORITHMS; BINARY CODES; BIT ERROR RATE; CODE CONVERTERS; ITERATIVE METHODS; TURBO CODES; VECTOR QUANTIZATION;

DECODING;

EID: 0035332876     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.924871     Document Type: Article

References (16)

1. Near shannon limit error-correcting coding and decoding: Turbo-codes
2. Soft-input soft-output modules for the construction and distributed iterative decoding of code networks
3. A survey on trellis termination alternatives for turbo codes
4. Interleaver theory and applications to the trellis complexity analysis of turbo codes
5. Serial concatenation of interleaved codes: Performance analysis, design and iterative decoding
6. Unveiling turbo-codes: Some results on parallel concatenated coding schemes
7. A search for good convolutional codes to be used in the construction of turbo codes
8. Design of parallel concatenated convolutional codes
9. The influence of quantization and fixed point arithmetic upon the bet performance of turbo codes
10. VLSI architectures for turbo codes
11. On finite-precision implementation of a decoder for turbo-codes
12. Performance of turbo codes with quantized channel measurements
13. Optimal decoding of linear codes for minimizing symbol error rate
14. An intuitive justification and a simplified implementation of the MAP decoder for convolutional codes
15. An alternative to metric rescaling in Viterbi decoders
16. VLSI architectures for metric normalization in the Viterbi algorithm