A new upper bound on the ML decoding error probability of linear binary block codes in AWGN interference

IEEE Transactions on Information Theory

Volumn 50, Issue 12, 2004, Pages 3026-3036

  Yousefi, Shahram ^a,b   Khandani, Amir K ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b QUEEN S UNIVERSITY   (Canada)

Author keywords

Additive white Gaussian noise (AWGN) channel; Block codes; Bounds; Decoding error probability; Distance spectrum; Gallager bounds; Linear binary block codes; Maximum likelihood (ML) decoding; Probability of error; Union bound; Upper bounds

Indexed keywords

BINARY CODES; BLOCK CODES; COMPUTATIONAL COMPLEXITY; DECODING; ERROR ANALYSIS; MAXIMUM LIKELIHOOD ESTIMATION; OPTIMIZATION; PHASE SHIFT KEYING; PROBABILITY; SIGNAL INTERFERENCE; SIGNAL TO NOISE RATIO; WHITE NOISE;

ADDITIVE WHITE GAUSSIAN NOISE (AWGN) CHANNEL; DECODING ERROR PROBABILITY; DISTANCE SPECTRUM; GALLAGER BOUNDS; LINEAR BINARY BLOCK CODES; MAXIMUM LIKELIHOOD DECODING; UNION BOUND; UPPER BOUNDS;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 10644237202     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.838091     Document Type: Article

References (42)

1. C. E. Shannon, "Probability of error for optimal codes in Gaussian channel," Bell Syst. Tech. J., vol. 38, pp. 611-656, 1959.
2. J. Galambos and I. Simonelli, Bonferroni-Type Inequalities With Applications. New York: Springer-Vefiag, 1996.
3. H. Kuai, F. Alajaji, and G. Takahara, "Tight error bounds for nonuniform signaling over AWGN channels," IEEE Trans. Inform. Theory vol. 46, pp. 2712-2718, Nov. 2000.
4. A. Cohen and N. Merhav, "Lower bounds on the error probability of block codes based on improvements on de Caen's inequlaity," IEEE Trans. Inform. Theory, vol. 50, pp. 290-310, Feb. 2004.
5. I. Sason, "Upper bounds on maximum-likelihood decoding error probability for block codes and turbo-like codes," Ph.D. dissertation, Dept. Elec. Eng., Technion-Israel Inst. Technol., Haifa, Israel, 2001.
6. S. Yousefi, "Bounds on the performance of maximum-likelihood decoded binary block codes in AWGN interference," Ph.D. dissertation, Dept. Elec. Comput. Eng., Univ. Waterloo, Waterloo, ON, Canada, 2002.
7. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error correcting coding and decoding: Turbo codes," in Proc. 1993 IEEE Int. Conf. Communications, Geneva, Switzerland, 1993, pp. 1064-1070.
8. D. Divsalar, H. Jin, and R. J. McEliece, "Coding theorems for 'Turbolike' codes," in Proc. 1998 Allerton Conf., Monticello, IL, Sept. 23-25, 1998.
9. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963:
10. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," Electron. Lett., vol. 32, pp. 1645-1646, Aug. 1996.
11. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
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 and M. Salehi, "Performance bounds for turbo-coded modulation systems," IEEE Trans. Commun., vol. 47, pp. 511-521, Apr. 1999.
14. T. M. Duman and M. Salehi, "The union bound for Turbo-coded modulation systems over fading channels," IEEE Trans. Commun., vol. 47, pp. 1495-1502, Oct. 1999.
15. I. Sason and S. Shamai (Shitz), "Improved upper bounds on the decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum," IEEE Trans. Inform. Theory, vol. 46, pp. 1-23, Jan. 2000.
16. I. Sason and S. Shamai (Shitz), "Improved upper bounds on the ensemble performance of ML decoded low density parallel check codes," IEEE Commun. Lett., vol. 4, pp. 89-91, Mar. 2000.
17. I. Sason and S. Shamai (Shitz), "On improved 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, Nov. 2001.
18. E. C. Posner, "Properties of error-correcting codes at low signal-to-noise ratios," SIAM J. Appl. Math., vol. 15, pp. 775-798, July 1967.
19. C.-C. Chao, R. J. McEliece, L. Swanson, and E. R. Rodemich, "Performance of binary block codes at low signal-to-noise ratios," IEEE Trans. Inform. Theory, vol. 38, pp. 1677-1687, Nov. 1992.
20. B. Hughes, "On the error probability of signals in additive white Gaussian noise," IEEE Trans. Inform. Theory, vol. 37, pp. 151-155, Jan. 1991.
21. D. Slepian, "A class of binary signaling alphabets," Bell Syst. Tech. J., vol. 35, pp. 203-234, Jan. 1956.
22. D. Slepian, "Group codes for the Gaussian channel," Bell Syst. Tech. J., vol. 47, no. 4, pp. 572-602, Apr. 1968.
23. G. D. Forney, Jr., "Geometrically uniform codes," IEEE Trans. Inform. Theory, vol. 37, pp. 1241-1260, Sept. 1991.
24. H. Herzberg and G. Poltyrev, "Techniques of bounding the probability of decoding error for block-coded modulation structures," IEEE Trans. Inform. Theory, vol. 40, pp. 903-911, May 1994.
25. H. Herzberg and G. Poltyrev, "The error probability of M-ary PSK block-coded modulation schemes," IEEE Trans. Commun., vol. 44, pp. 427-433, Apr. 1996.
26. G. Poltyrev, "Bounds on the decoding error probability of binary linear codes via their spectra," IEEE Trans. Inform. Theory, vol. 40, pp. 1284-1292, July 1994.
27. D. Divsalar, "A simple tight bound on error probability of block codes with application to turbo codes," NASA, JPL, Pasadena, CA, TMO Progr. Rep. 42-139, 1999.
28. E. R. Berlekamp, "The technology of error-correcting codes," Proc. IEEE, vol. 68, pp. 564-593, May 1980.
29. I. Sason and S. Shamai (Shitz), "Variations on the Gallager bounds, connections and applications," IEEE Trans. Inform. Theory, vol. 48, pp. 3029-3051, Dec. 2002.
30. S. Yousefi and A. K. Khandani, "Generalized tangential sphere bound on the ML decoding error probability of linear binary block codes in AWGN interference," IEEE Trans. Inform. Theory, vol. 50, pp. 2810-2815, Nov. 2004.
31. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups. New York: Springer-Verlag, 1988.
32. N. L. Johnson, S. Kotz, and N. Balakrishnan, Continuous Univariate Distributions. New York: Wiley, 1994, vol. 1.
33. D. Hunter, "An upper bound for the probability of a union," J. Appl. Probab., vol. 13, pp. 597-603, 1976.
34. R. Diestel, Graph Theory. New York: Springer-Verlag, 1997.
35. J. B. Kruskal, "On the shortest spanning tree of a graph and the traveling salesman problem," Proc. Amer. Math. Soc., no. 7, pp. 48-50, 1956.
36. R. C. Prim, "Shortest connection networks and some generalizations," Bell Syst. Tech. J., no. 36, pp. 1389-1401, 1957.
37. R. L. Graham and P. Hell, "On the history of the minimum spanning tree problem," Ann. History of Comput., vol. 7, no. 1, pp. 43-57, 1985.
38. K. H. Rosen, Discrete Mathematics and its Applications. New York: McGraw-Hill, 1995.
39. G. E. Séguin, "A lower bound on the error probability for signals in white Gaussian noise," IEEE Trans. Inform. Theory, vol. 44, pp. 3168-3175, Nov. 1998.
40. P. McMullen and G. C. Shephard, Convex Polytopes and the Upper Bound Conjecture. Cambridge, U.K.: Cambridge Univ. Press, 1971.
41. P. F. Swaszek, "A lower bound on the error probability for signals in white Gaussian noise," IEEE Trans. Inform. Theory, vol. 41, pp. 837-841, May 1995.
42. 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, 1998.