Sphere decoding algorithms with improved radius search

We start by identifying a relatively efficient version of sphere decoding algorithm (SDA) that performs exact maximum-likelihood (ML) decoding. We develop novel algorithms based on an improved increasing radius search (IIRS), which offer error performance and decoding complexity between two extremes: the ML receiver and the nulling-canceling (NC) receiver with detection ordering. With appropriate choices of parameters, our IIRS offers the flexibility to trade error performance for complexity. We provide design intuitions and guidelines, analytical parameter specifications, and a semianalytical error-performance analysis. Simulations illustrate that IIRS achieves considerable complexity reduction, while maintaining performance close to ML.

[1]  Georgios B. Giannakis,et al.  Space-time diversity systems based on linear constellation precoding , 2003, IEEE Trans. Wirel. Commun..

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

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

[4]  Georgios B. Giannakis,et al.  Approaching MIMO channel capacity with reduced-complexity soft sphere decoding , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[5]  Krishna R. Pattipati,et al.  Fast optimal and suboptimal any-time algorithms for CDMA multiuser detection based on branch and bound , 2004, IEEE Transactions on Communications.

[6]  Loïc Brunel,et al.  Lattice decoding for joint detection in direct-sequence CDMA systems , 2003, IEEE Trans. Inf. Theory.

[7]  Gerard J. Foschini,et al.  Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas , 1996, Bell Labs Technical Journal.

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

[9]  Babak Hassibi,et al.  Efficient near-ml decoding via statistical pruning , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

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

[11]  Inkyu Lee,et al.  A new reduced-complexity sphere decoder for multiple antenna systems , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[12]  B. Hassibi,et al.  On the expected complexity of sphere decoding , 2001, Conference Record of Thirty-Fifth Asilomar Conference on Signals, Systems and Computers (Cat.No.01CH37256).

[13]  John G. Proakis,et al.  Digital Communications , 1983 .

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

[15]  Georgios B. Giannakis,et al.  Reduced complexity closest point decoding algorithms for random lattices , 2006, IEEE Transactions on Wireless Communications.

[16]  P. Sen,et al.  Order statistics and inference : estimation methods , 1992 .