Reduced complexity list sphere decoding for MIMO systems

Depth-first sphere decoding of MIMO systems has near maximum likelihood performance with reasonable computational complexity. In this paper, lower complexity depth-first sphere decoding and list sphere decoding algorithms are proposed. Several criteria for re-ordering the search dimensions are proposed. The proposed sphere decoders are shown to have a significantly reduced decoding complexity at low SNRs. To further reduce the complexity at high SNRs, the point search-space at each ordered dimension is adaptively reduced. Further reductions in the decoding complexity are achieved by inter-layer interference cancellation. It is shown that the proposed sphere decoding algorithms maintain their near-optimal performance, concurrently with a significant complexity reduction, over a wide SNR range.

[1]  M. Ajtai.  The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract) , 1998, STOC '98.

[2]  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).

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

[4]  Zhongfeng Wang,et al.  Improved k-best sphere decoding algorithms for MIMO systems , 2006, 2006 IEEE International Symposium on Circuits and Systems.

[5]  Babak Hassibi,et al.  On the sphere-decoding algorithm I. Expected complexity , 2005, IEEE Transactions on Signal Processing.

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

[7]  Hassan M. Elkamchouchi,et al.  Dimension-ordered MIMO list sphere decoding , 2012, 2012 IEEE 13th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC).

[8]  John S. Thompson,et al.  Fixing the Complexity of the Sphere Decoder for MIMO Detection , 2008, IEEE Transactions on Wireless Communications.

[9]  K. Kammeyer,et al.  Efficient algorithm for decoding layered space-time codes , 2001 .

[10]  Babak Hassibi,et al.  On the Performance of Sphere Decoding of Block Codes , 2009, 2006 IEEE International Symposium on Information Theory.

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

[12]  Babak Hassibi,et al.  A branch and bound approach to speed up the sphere decoder , 2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005..

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

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

[15]  Helmut Bölcskei,et al.  Soft-output sphere decoding: algorithms and VLSI implementation , 2008, IEEE Journal on Selected Areas in Communications.

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

[17]  Zhan Guo,et al.  Algorithm and implementation of the K-best sphere decoding for MIMO detection , 2006, IEEE Journal on Selected Areas in Communications.

[18]  T. Kailath,et al.  Iterative decoding for MIMO channels via modified sphere decoding , 2004, IEEE Transactions on Wireless Communications.

[19]  Miklós Ajtai,et al.  The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract) , 1998, STOC '98.

[20]  John S. Thompson,et al.  Extending a Fixed-Complexity Sphere Decoder to Obtain Likelihood Information for Turbo-MIMO Systems , 2008, IEEE Transactions on Vehicular Technology.