Improved tangential sphere bound on the ML decoding error probability of linear binary block codes in AWGN and block fading channels

IEE Proceedings: Communications

Volumn 153, Issue 6, 2006, Pages 885-893

  Mehrabian, A ^a   Yousefi, S ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; DECODING; ERROR ANALYSIS; GRAPH THEORY; OPTIMIZATION;

BLOCK FADING CHANNELS; DECODING ERROR PROBABILITY; GALLAGER FIRST BOUNDING TECHNIQUE (GFBT); LINEAR BINARY BLOCK CODES;

BLOCK CODES;

EID: 33751393312     PISSN: 13502425     EISSN: None     Source Type: Journal    
DOI: 10.1049/ip-com:20050493     Document Type: Article

References (17)

1. Gallager, R.G.: ' Low density parity check codes ', (MIT Press, Cambridge, MA, 1963)
2. Berrou, C., Glavieux, A., and Thitimajshima, P.: ' Near Shannon limit error correcting coding and decoding: turbo codes ', Proc. 1993 IEEE Int. Conf. on Communications, Geneva, Switzerland, 1993, p. 1064-1070
3. Sason, I., and Shamai, S.: ' Improved upper bounds on the decoding error probability of parralel and serial concatenated turbo codes via their ensamble distance spectrum ', IEEE Trans. Inf. Theory, 2000, 46, (1), p. 1-23 0018-9448
4. Galambos, J., and Simonelli, I.: ' Bonferroni-type inequalities with applications ', (Springer, New York, NY, 1996)
5. Poltyrev, G.: ' Bounds on the decoding error probability of binary linear codes via their spectra ', IEEE Trans. Inf. Theory, 1994, 40, (4), p. 1284-1292 10.1109/18.335935 0018-9448
6. Yousefi, S., and Khandani, A.: ' A new upper bound on the ML decoding error probability of linear binary block codes in AWGN interference ', IEEE Trans. Inf. Theory, 2004, 50, (12), p. 3026-3036 10.1109/TIT.2004.838091 0018-9448
7. Forney, G.D.: ' Geometrically uniform codes ', IEEE Trans. Inf. Theory, 1991, 37, (5), p. 1241-1260 10.1109/18.133243 0018-9448
8. ' A simple tight bound on error probability of block codes with application to turbo codes ', TMO Progress Report, Pasadena, CA, USA, 1999, JPL
9. Berlekamp, E.R.: ' The technology of error-correcting codes ', Proc. IEEE, 1980, 68, p. 564-593 0018-9219
10. Herzberg, H., and Poltyrev, G.: ' Techniques of bounding the probability of decoding error for block-coded modulation structures ', IEEE Trans. Inf. Theory, 1994, 40, (3), p. 903-911 10.1109/18.335901 0018-9448
11. Sason, I., and Shamai(Shitz), S.: ' Improved upper bounds on the decoding error probability of parallel and serial concatenated Turbo codes via their ensemble distance spectrum ', IEEE Trans. Inf. Theory, 2002, 46, (1), p. 1-23 0018-9448
12. Yousefi, S., and Khandani, A.: ' Generalized tangential sphere bound on the ML decoding error probability of linear binary block codes in AWGN interference ', IEEE Trans. Inf. Theory, 2004, 50, (11), p. 2810-2815 10.1109/TIT.2004.836666 0018-9448
13. Hunter, D.: ' An upper bound for the probability of a union ', J. Appl. Probab., 1976, 13, p. 597-603 0021-9002
14. Kruskal, J.B.: ' On the shortest spanning tree of a graph and the traveling salesman problem ', Proc. Am. Math. Soc., 1956, p. 48-50
15. Prim, R.C.: ' Shortest connection networks and some generalizations ', Bell Syst. Tech. J., 1957, 36, p. 1389-1401 0005-8580
16. Sason, I., and Shamai(Shitz), S.: ' Improved upper bounds on the ensemble performance of ML decoded low-density parity-check codes ', IEEE Commun. Lett., 2000, 4, (3), p. 89-91 10.1109/4234.831034 1089-7798
17. Séguin, G.E.: ' A lower bound on the error probability for signals in white Gaussian noise ', IEEE Trans. Inf. Theory, 1998, 44, (7), p. 3168-3175 0018-9448