Enhanced low-complexity layer-ordering for MIMO sphere detectors

In this paper, optimum soft-output (SO) multiple-input multiple-output (MIMO) sphere detectors (SDs) are studied. Noting that ordering the channel matrix columns plays an important role in reducing the tree-search complexity of a SD, we propose an optimized layer-ordering scheme based on the minimum cumulative residual criterion. The proposed scheme is studied in the context of a 4 × 4 MIMO system, and a low-complexity dataflow architecture is proposed. The implementation employs a permutation-robust QR decomposition (PR-QRD) scheme, based on the modified Gram-Schmidt orthogonalization procedure. Simulations demonstrate that using the proposed scheme, the node count of a SO MIMO SD is reduced by one order of magnitude, while the QRD overhead is reduced by more than 25% in computations and 36% in time, without incurring any performance degradation.

[1]  B. Hochwald,et al.  Silicon complexity for maximum likelihood MIMO detection using spherical decoding , 2004, IEEE Journal of Solid-State Circuits.

[2]  Louay M. A. Jalloul,et al.  Reduced Complexity Soft-Output MIMO Sphere Detectors—Part II: Architectural Optimizations , 2014, IEEE Transactions on Signal Processing.

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

[4]  László Babai,et al.  On Lovász’ lattice reduction and the nearest lattice point problem , 1986, Comb..

[5]  Chih-Hung Lin,et al.  Iterative QR Decomposition Architecture Using the Modified Gram-Schmidt Algorithm for MIMO Systems , 2010, IEEE Trans. Circuits Syst. I Regul. Pap..

[6]  Ian J. Wassell,et al.  A new ordering for efficient sphere decoding , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[7]  Wai Ho Mow,et al.  A VLSI architecture of a K-best lattice decoding algorithm for MIMO channels , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

[8]  Louay M. A. Jalloul,et al.  Reduced Complexity Soft-Output MIMO Sphere Detectors—Part I: Algorithmic Optimizations , 2014, IEEE Transactions on Signal Processing.

[9]  Rohit U. Nabar,et al.  Introduction to Space-Time Wireless Communications , 2003 .

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

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

[12]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[13]  Chih-Hung Lin,et al.  Iterative $QR$ Decomposition Architecture Using the Modified Gram–Schmidt Algorithm for MIMO Systems , 2009, IEEE Transactions on Circuits and Systems I: Regular Papers.

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

[15]  Ahmed M. Eltawil,et al.  A Best-First Soft/Hard Decision Tree Searching MIMO Decoder for a 4 $\times$ 4 64-QAM System , 2012, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[16]  Babak Hassibi,et al.  On the sphere-decoding algorithm II. Generalizations, second-order statistics, and applications to communications , 2005, IEEE Transactions on Signal Processing.

[17]  Helmut Bölcskei,et al.  Soft–Input Soft–Output Single Tree-Search Sphere Decoding , 2009, IEEE Transactions on Information Theory.

[18]  Zhiyuan Yan,et al.  Memory-Constrained Tree Search Detection and New Ordering Schemes , 2009, IEEE Journal of Selected Topics in Signal Processing.

[19]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[20]  John R. Barry,et al.  The Chase Family of Detection Algorithms for Multiple-Input Multiple-Output Channels , 2008, IEEE Transactions on Signal Processing.

[21]  Mário Marques da Silva,et al.  MIMO Processing for 4G and Beyond: Fundamentals and Evolution , 2014 .

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