Tight exponential upper bounds on the ML decoding error probability of block codes over fully interleaved fading channels

IEEE Transactions on Communications

Volumn 51, Issue 8, 2003, Pages 1296-1305

  Sason, Igal ^a,b   Shamai, Shlomo ^a   Divsalar, Dariush ^c,d  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b EPFL   (Switzerland)

^c Sequoia Communications   (United States)

^d CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Block codes; Bounds; Distance spectrum; Fading channels; Maximum likelihood (ML) decoding; Uniform inter leaver

Indexed keywords

CHANNEL CAPACITY; DECODING; GAUSSIAN NOISE (ELECTRONIC); MAXIMUM LIKELIHOOD ESTIMATION; TURBO CODES;

FADING CHANNELS;

BLOCK CODES;

EID: 0042318745     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2003.815057     Document Type: Article

References (16)

1. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error - correcting coding and decoding," in Proc. IEEE Int. Conf. Commun., Geneva, Switzerland, May 1993, pp. 1064-1070.
2. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
3. D. Divsalar, H. Jin, and R. J. McEliece, "Coding theorems for 'turbo-like' codes," in Proc. 1998 Allerton Conf., Urbana-Champaign, IL, Sept. 1998, pp. 201-210.
4. R. J. McEliece, "How to compute weight enumerators for convolutional codes," in Communications and Coding, M. Darnel and B. Honary, Eds: Wiley, 1998, pp. 121-141.
5. I. Sason, E. Telatar, and R. Urbanke, "On the asymptotic input-output weight distributions and thresholds of convolutional and turbo-like encoders," IEEE Trans. Inform. Theory, vol. 48, pp. 3052-3061, Dec. 2002.
6. D. Burshtein and G. Miller, "Asymptotic enumeration methods for analyzing LDPC codes," in Proc. 40th Annual Allerton Conf. Communications, Control, Computing, Urbana-Champaign, IL, Oct. 2-4, 2002.
7. I. Sason, "Upper bounds on the maximum-likelihood decoding error probability for block codes and turbo-like codes," Ph.D. dissertation, Dept. Elec. Eng., Technion - Israel Inst. Technol., Haifa, Israel, Oct. 2001.
8. D. Divsalar and E. Biglieri, "Upper bounds to error probabilities of coded systems beyond the cutoff rate," in Proc. IEEE Int. Symp. Information Theory, June 2000, p. 288.
9. _, "Upper bounds to error probabilities of coded systems over AWGN and fading channels," in Proc. IEEE Global Telecommunications Conf. (GLOBECOM'00), San Francisco, CA, Nov. 27-Dec. 1 2000, pp. 1605-1610.
10. I. Sason and S. Shamai, "Improved upper bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes," IEEE Trans. Inform. Theory, vol. 47, pp. 2275-2299, Sept. 2001.
11. S. Shamai and I. Sason, "Variations on the Gallager bounds, connections and applications," IEEE Trans. Inform. Theory, vol. 48, pp. 3029-3051, Dec. 2002.
12. T. M. Duman and M. Salehi, "New performance bounds for turbo codes," IEEE Trans. Commun., vol. 46, pp. 717-723, June 1998.
13. T. M. Duman, "Turbo codes and turbo-coded modulation systems: Analysis and performance bounds," Ph.D. dissertation, Dept. Elec. Comput. Eng., Northeastern Univ., Boston, MA, May 1998.
14. A. M. Viterbi and A. J. Viterbi, "Improved union bound on linear codes for the binary-input AWGN channel, with application to turbo decoding," in Proc. IEEE Information Theory Workshop, San Diego, CA, Feb. 1998, p. 72.
15. F. Babich, G. Montorsi, and F. Vatta, "On the Viterbi and Viterbi's improved union bounds on turbo codes performance," in Proc. 2nd Int. Symp. Turbo Codes and Related Topics, Brest, France, Sept. 4-7, 2000, pp. 527-531.
16. H. Shin and J. H. Lee, "Improved upper bound on the bit-error probability of turbo codes for ML decoding with imperfect CSI in a Rayleigh fading channel," in Proc. IEEE 12th Int. Symp. Personal, Indoor and Mobile Radio Communications (PIMRC 2001), San Diego, CA, Sept. 2001, pp. A.169-A.173.