Generalized tangential sphere bound on the ML decoding error probability of linear binary block codes in AWGN interference

IEEE Transactions on Information Theory

Volumn 50, Issue 11, 2004, Pages 2810-2815

  Yousefi, Shahram ^a   Khandani, Amir K ^b  

^a QUEEN S UNIVERSITY   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK CODES; CODING ERRORS; DECODING; PROBABILITY DISTRIBUTIONS; SIGNAL INTERFERENCE; THEOREM PROVING; WHITE NOISE;

ADDITIVE WHITE GAUSSIAN NOISE; GALLAGER BOUNDS; LINEAR BINARY BLOCK CODES; MAXIMUM LIKELIHOOD (ML) DECODING; UNION BOUNDS; UPPER BOUNDS;

INFORMATION THEORY;

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

References (33)

1. J. Galambos and I. Simonelli, Bonferroni-Type Inequalities with Applications. New York: Springer-Verlag, 1996.
2. 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.
3. 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.
4. D. Divsalar, H. Jin, and R. J. McEliece, "Coding theorems for 'Turbo-like' codes," in Proc. 1998 Allerton Conf. Communication, Control, and Computing, Monticello, IL, Sept. 1998, pp. 201-210.
5. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
6. 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.
7. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
8. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups. New York: Springer-Verlag, 1988.
9. 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.
10. 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.
11. B. Hughes, "On the error probability of signals in additive white Gaussian noise," IEEE Trans. Inform. Theory, vol. 37, pp. 151-155, Jan. 1991.
12. D. Slepian, "A class of binary signaling alphabets," Bell Syst. Tech. J., vol. 35, pp. 203-234, Jan. 1956.
13. D. Slepian, "Group codes for the Gaussian channel," Bell Syst. Tech. J., vol. 47, no. 4, pp. 572-602, Apr. 1968.
14. G. D. Forney Jr., "Geometrically uniform codes," IEEE Trans. Inform. Theory, vol. 37, pp. 1241-1260, Sept. 1991.
15. 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.
16. 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.
17. 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.
18. 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.
19. E. R. Berlekamp, "The technology of error-correcting codes," Proc. IEEE, vol. 68, pp. 564-593, May 1980.
20. D. Hilbert and S. Cohn-Vossen, Geometry and the Imagination. New York: Chelsea, 1952.
21. E. W. Weisstein. Eric Weisstein's World of Mathematics. [Online]. Available: http ://mathworld.wolfram.com
22. 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.
23. I. Sason, "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.
24. I. Sason, "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.
25. H.-A. Loeliger, "Signal sets matched to groups," IEEE Trans. Inform. Theory, vol. 37, pp. 1675-1682, Nov. 1991.
26. E. Agrell, "Voronoi regions for binary linear block codes," IEEE Trans. Inform. Theory, vol. 42, pp. 310-316, Jan. 1996.
27. D. Hilbert and S. Cohn-Vossen, The Cylinder, the Cone, the Conic Sections, and their Surfaces of Revolution. New York: Chelsea, 1999.
28. P. M. Gruber and J. M. Wills, Handbook of Convex Geometry. Amsterdam, The Netherlands: North-Holland, 1993, vol. A-B.
29. N. L. Johnson, S. Kotz, and N. Balakrishnan, Continuous Univariate Distributions. New York: Wiley, 1994, vol. 1.
30. I. M. Gelfand and S. V. Fomin, Calculus of Variations. Englewood Cliffs, NJ: Prentice-Hall, 1963.
31. I. S. Gradshteyn and I. M. Ryzhik, Table of Integrals, Series, and Products. New York: Academic, 1994.
32. A. Ganti, A. Lapidoth, and I. E. Telatar, "Mismatched decoding revisited: general alphabets, channels with memory, and the wide-band limit," IEEE Trans. Inform. Theory, vol. 46, pp. 2315-2328, Nov. 2000.
33. N. Mehrav, G. Kaplan, A. Lapidoth, and S. Shamai (Shitz), "On information rates for mismatched decoders," IEEE Trans. Inform. Theory, vol. 40, pp. 1953-1967, Nov. 1994.