Performance of sphere decoding of block codes

IEEE Transactions on Communications

Volumn 57, Issue 10, 2009, Pages 2940-2950

  El Khamy, Mostafa ^a   Vikalo, Haris ^b   Hassibi, Babak ^c   McEliece, Robert J ^c  

^a Alexandria University The Faculty Of Engineering   (Egypt)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^c California Institute of Technology   (United States)

Author keywords

Block codes; Decoding; Maximum likelihood decoding; Performance bounds; Radius; Reed Solomon codes; Sphere decoding; symmetric channels

Indexed keywords

MAXIMUM LIKELIHOOD DECODING; PERFORMANCE BOUNDS; RADIUS; SPHERE DECODING; SYMMETRIC CHANNELS;

BINARY CODES; BLOCK CODES; CHANNEL CAPACITY; COMMUNICATION CHANNELS (INFORMATION THEORY); MAXIMUM LIKELIHOOD ESTIMATION; REED-SOLOMON CODES; SPHERES;

DECODING;

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

References (30)

1. Berlekamp, R. McEliece, and H. van Tilborg, "On the inherent intractability of certain coding problems," IEEE Trans. Inform. Theory, vol. 24, pp. 384-386, May 1978.
2. G. Poltyrev, "Bounds on the decoding error probability of binary linear codes via their spectra," IEEE Trans. Inform. Theory, vol. 40, no. 4, pp. 1284-1292, July 1994.
3. E. Berlekamp, "The technology of error-correcting codes," in Proc. IEEE, vol. 68, no. 8, pp. 564-593, May 1980.
4. S. Aji, H. Jin, A. Khandekar, D. J. Mackay, and R. J. McEliece, "BSC thresholds for code ensembles based on "typical pairs" decoding," in Proc. IMA Workshop Codes Graphs, Aug. 1999, pp. 195-210.
5. D. Divsalar and E. Biglieri, "Upper bounds to error probabilities of coded systems over AWGN and fading channels," in Proc. 2000 IEEE Global Telecommun. Conf. (GLOBECOM'00), San Francisco, CA, Nov. 2000, pp. 1605-1610.
6. I. Sason, S. Shamai, and D. Divsalar, "Tight exponential upper bounds on the ML decoding error probability of block codes over fully interleaved fading channels," IEEE Trans. Commun., vol. 51, no. 8, pp. 1296-1305, Aug. 2003.
7. I. Sason and S. Shamai, "Performance analysis of linear codes under maximum-likelihood decoding: A tutorial," Foundations Trends Commun. Inform. Theory, vol. 3, July 2006.
8. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Mathematics Computation, vol. 44, pp. 463-471, 1985.
9. C. Schnorr and M. Euchner, "Lattice basis reduction: Improved practical algorithms and solving subset sum problems," Math. Programming, vol. 66, pp. 181-191, 1994.
10. E. Agrell, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Trans. Inform. Theory, vol. 48, no. 8, pp. 2201-2214, Aug. 2002.
11. E. Viterbo and J. Boutros, "A universal lattice decoder for fading channels," IEEE Trans. Inform. Theory, vol. 45, p. 1639.
12. M. O. Damen, A. Chkeif, and J. Belfiore, "Lattice code decoder for space-time codes," IEEE Commun. Lett., pp. 161-163, May 2000.
13. M. O. Damen, H. E. Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," IEEE Trans. Inform. Theory, vol. 49, no. 10, pp. 2389-2402, 2003.
14. H. Vikalo and B. Hassibi, "On joint detection and decoding of linear block codes on Gaussian vector channels," IEEE Trans. Signal Processing, Sept. 2006.
15. H. Vikalo and B. Hassibi, "Statistical approach to ML decoding of linear block codes on symmetric channels," in Proc. IEEE International Symp. Inform. Theory (ISIT), 2004.
16. V. Guruswami and M. Sudan, "Improved decoding of Reed-Solomon codes and algebraic geometry codes," IEEE Trans. Inform. Theory, vol. 45, no. 6, pp. 1757-1767, Sept. 1999.
17. H. Vikalo, B. Hassibi, and U. Mitra, "Sphere-constrained ML detection for frequency-selective channels," IEEE Trans. Commun., no. 7, pp. 1179-1183, 2006.
18. J. G. Proakis, Digital Communications, 4th ed. New York: McGraw-Hill, 2001.
19. Hochwald and S. ten Brink, "Achieving near-capacity on a multipleantenna channel," IEEE Trans. Commun., vol. 53, pp. 389-399, Mar. 2003.
20. G. D. Forney, "Geometrically uniform codes," IEEE Trans. Inform. Theory, vol. 37, no. 5, pp. 1241-1260, Sept. 1991.
21. E. W. Weisstein, Mathworld - A Wolfram Web Resource. [Online]. Available: http://mathworld.wolfram.com.
22. C. E. Shannon, "Probability of error for optimal codes in a Gaussian channel," Bell Syst. Tech. J., vol. 38, pp. 611-656, 1959.
23. H. Herzberg and G. Poltyrev, "The error probability of M-ary PSK block coded modulation schemes," IEEE Trans. Commun., vol. 44, no. 4, pp. 427-433, Apr. 1996.
24. C. Retter, "The average binary weight enumerator for a class of generalized Reed-Solomon codes," IEEE Trans. Inform. Theory, vol. 37, no. 2, pp. 346-349, Mar. 1991.
25. M. El-Khamy and R. J. McEliece, "Bounds on the average binary minimum distance and the maximum-likelihood performance of Reed Solomon codes," in 42nd Allerton Conf. Commun., Control Computing, 2004.
26. B. Hughes, "On the error probability of signals in additive white Gaussian noise," IEEE Trans. Inform. Theory, pp. 151-155, Jan. 1991.
27. H. Herzberg and G. Poltyrev, "Techniques of bounding the probability of decoding error for block coded modulation structures," IEEE Trans. Inform. Theory, pp. 903-911, May 1994.
28. D. Divsalar, "A simple tight bound on error probability of block codes with application to turbo codes," TMO Progress Report, NASA, JPL, Tech. Rep. 42-139, 1999.
29. R. J. McEliece and L. Swanson, "On the decoder error probability of Reed-Solomon codes," IEEE Trans. Inform. Theory, vol. 32, no. 5, pp. 701-703, Sept. 1986.
30. F. J. MacWilliams and N. J. Sloane, The Theory of Error Correcting Codes. Amsterdam: North Holland, 1977.