Performance of sphere decoding of 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 focus on analyzing the performance of sphere decoding of linear block codes. We analyze the performance of soft-decision sphere decoding on AWGN channels and a variety of modulation schemes. A hard-decision sphere decoder is a bounded distance decoder with the corresponding decoding radius. We analyze the performance of hard-decision sphere decoding on binary and q-ary symmetric channels. An upper bound on the performance of maximum-likelihood decoding of linear codes defined over Fq (e.g. Reed- Solomon codes) and transmitted over q-ary symmetric channels is derived and used in the analysis.We then discuss sphere decoding of general block codes or lattices with arbitrary modulation schemes. The tradeoff between the performance and complexity of a sphere decoder is then discussed.

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

[2]  Giuseppe Caire,et al.  On maximum-likelihood detection and the search for the closest lattice point , 2003, IEEE Trans. Inf. Theory.

[3]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.

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

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

[6]  Brian L. Hughes,et al.  On the error probability of signals in additive white Gaussian noise , 1991, IEEE Trans. Inf. Theory.

[7]  G. David Forney,et al.  Geometrically uniform codes , 1991, IEEE Trans. Inf. Theory.

[8]  Charles T. Retter.  The average binary weight-enumerator for a class of generalized Reed-Solomon codes , 1991, IEEE Trans. Inf. Theory.

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

[10]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[11]  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..

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

[13]  E.R. Berlekamp,et al.  The technology of error-correcting codes , 1980, Proceedings of the IEEE.

[14]  Gregory Poltyrev,et al.  The error probability of M-ary PSK block coded modulation schemes , 1996, IEEE Trans. Commun..

[15]  Urbashi Mitra,et al.  Sphere-constrained ML detection for frequency-selective channels , 2006, IEEE Transactions on Communications.

[16]  Robert J. McEliece,et al.  On the decoder error probability for Reed-Solomon codes , 1986, IEEE Trans. Inf. Theory.

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

[18]  Claus-Peter Schnorr,et al.  Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems , 1991, FCT.

[19]  Neil J. A. Sloane,et al.  Techniques of Bounding the Probability of Decoding Error for Block Coded Modulation Structures , 1994 .

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

[21]  Shlomo Shamai,et al.  Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial , 2006, Found. Trends Commun. Inf. Theory.

[22]  Babak Hassibi,et al.  Bounds on the performance of sphere decoding of linear block codes , 2005, IEEE Information Theory Workshop, 2005..

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

[24]  Mohamed Oussama Damen,et al.  Lattice code decoder for space-time codes , 2000, IEEE Communications Letters.

[25]  Robert J. McEliece,et al.  BSC Thresholds for Code Ensembles Based on “Typical Pairs” Decoding , 2001 .

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

[27]  Dariush Divsalar,et al.  Upper bounds to error probabilities of coded systems over AWGN and fading channels , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[28]  Stephan ten Brink,et al.  Achieving near-capacity on a multiple-antenna channel , 2003, IEEE Trans. Commun..

[29]  Shlomo Shamai,et al.  Tight exponential upper bounds on the ML decoding error probability of block codes over fully interleaved fading channels , 2003, IEEE Trans. Commun..