Bounds on the performance of sphere decoding of linear block codes

A sphere decoder searches for the closest lattice point within a certain search radius. The search radius provides a tradeoff between performance and complexity. We derive tight upper bounds on the performance of sphere decoding of linear block codes. The performance of soft-decision sphere decoding on AWGN channels as well as that of hard-decision sphere decoding on binary symmetric channels is analyzed.

[1]  Babak Hassibi,et al.  Statistical approach to ML decoding of linear block codes on symmetric channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[2]  Emanuele Viterbo,et al.  A universal lattice code decoder for fading channels , 1999, IEEE Trans. Inf. Theory.

[3]  Branka Vucetic,et al.  Soft decision decoding of Reed-Solomon codes , 2002, IEEE Trans. Commun..

[4]  Babak Hassibi,et al.  On joint detection and decoding of linear block codes on Gaussian vector channels , 2006, IEEE Transactions on Signal Processing.

[5]  Elwyn R. Berlekamp,et al.  On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[6]  D. Divsalar.  A Simple Tight Bound on Error Probability of Block Codes with Application to Turbo Codes , 1999 .

[7]  Alexander Vardy,et al.  Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.

[8]  C. Shannon.  Probability of error for optimal codes in a Gaussian channel , 1959 .

[9]  Andrei V. Kelarev,et al.  The Theory of Information and Coding , 2005 .

[10]  Shlomo Shamai,et al.  Variations on the Gallager bounds, connections, and applications , 2002, IEEE Trans. Inf. Theory.

[11]  Claus-Peter Schnorr,et al.  Lattice basis reduction: Improved practical algorithms and solving subset sum problems , 1991, FCT.

[12]  R. McEliece,et al.  Bounds on the Average Binary Minimum Distance and the Maximum Likelihood Performance of Reed , 2005 .

[13]  J.E. Mazo,et al.  Digital communications , 1985, Proceedings of the IEEE.

[14]  Robert J. McEliece,et al.  The Theory of Information and Coding , 1979 .

[15]  Gregory Poltyrev,et al.  Bounds on the decoding error probability of binary linear codes via their spectra , 1994, IEEE Trans. Inf. Theory.

[16]  U. Fincke,et al.  Improved methods for calculating vectors of short length in a lattice , 1985 .