On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes

IEEE Transactions on Information Theory

Volumn 47, Issue 6, 2001, Pages 2275-2299

  Sason, Igal ^a,b   Shamai, Shlomo ^a,b  

^a IEEE   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Block codes; Bounds; Decoding error probability; Distance spectrum; Fading channels; Input output weight distribution; Maximum likelihood (ML) decoding; Thresholds; Turbo like codes

Indexed keywords

ADDITIVE WHITE GAUSSIAN NOISE; INPUT OUTPUT WEIGHT DISTRIBUTION; INTERLEAVED FADING CHANNELS; LOW DENSITY PARITY CHECK CODES; MAXIMUM LIKELIHOOD DECODING; RICIAN FADING; TURBO LIKE CODES;

ALGORITHMS; BOUNDARY CONDITIONS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; DECODING; DIVERSITY RECEPTION; ERRORS; FADING (RADIO); GAUSSIAN NOISE (ELECTRONIC); MAXIMUM LIKELIHOOD ESTIMATION; PROBABILITY; TURBO CODES;

BLOCK CODES;

EID: 0035442510     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.945248     Document Type: Article

References (31)

1. Transfer function bounds on turbo codes performance in the Rician fading channel
2. Unveiling turbo codes: Some results of parallel concatenated coding schemes
3. Near Shannon limit error-correcting coding and decoding
4. Fading channels: Information-theoretic and communications aspects
5. A new, simple and exact result for calculating error probability for two-dimensional signal constellation
6. Coding theorems for 'turbolike' codes
7. A simple tight bound on error probability of block codes with application to turbo codes
8. Upper bounds to error probabilities od coded systems over AWGN and fading channels
9. New performance bounds for turbo codes
10. The union bound for turbo coded modulation systems over fading channels
11. Turbo codes and turbo coded modulation systems: Analysis and performance bounds
12. Tighter bounds on the error probability of fixed convolutional codes
13. A simple derivation of the coding theorem and some applications
14. Design and analysis of turbo codes on Rayleigh fading channels
15. Techniques for bounding the probability of decoding error for block coded modulations structures
16. RA codes achieve AWGN channel capacity
17. Fading channels: How perfect need 'perfect side information' be?
18. Near Shannon limit performance of low density parity check codes
19. How to compute weight enumerators for convolutional codes
20. A distance spectrum interpretation of turbo codes
21. Bounds on the decoding error probability of binary linear codes via their spectra
22. Improved upper bounds on the decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum
23. Improved upper bounds on the ensemble performance of ML decoded low density parity check codes
24. Improved upper bounds on the ML performance of turbo codes for interleaved Rician fading channels, with comparison to iterative decoding
25. On Gallager-type bounds for the mismatched decoding regime with applications to turbo codes
26. On simple and tight upper bounds on the ML decoding error probability for block codes operating over interleaved fading channels
27. Variations on the Gallager bounds, connections and applications
28. On Gallager's bounding technique: Performance bounds for turbo codes in Gaussian and fading channels
29. Some new twists to problems involving the Gaussian probability integral
30. Upper bounds on the maximum likelihood decoding error probability for block codes and turbo-like codes