Detection Techniques for MIMO Multiplexing: A Comparative Review

Multiple-input multiple-output (MIMO) multiplexing is an attractive technology that increases the channel capacity without requiring additional spectral resources. The design of low complexity and high performance detection algorithms capable of accurately demultiplexing the transmitted signals is challenging. In this technical survey, we introduce the state-of-the-art MIMO detection techniques. These techniques are divided into three categories, viz. linear detection (LD), decision-feedback detection (DFD), and tree-search detection (TSD). Also, we introduce the lattice basis reduction techniques that obtain a more orthogonal channel matrix over which the detection is done. Detailed discussions on the advantages and drawbacks of each detection algorithm are also introduced. Furthermore, several recent author contributions related to MIMO detection are revisited throughout this survey.

[1]  Björn E. Ottersten,et al.  On the complexity of sphere decoding in digital communications , 2005, IEEE Transactions on Signal Processing.

[2]  M. Seysen,et al.  Simultaneous reduction of a lattice basis and its reciprocal basis , 1993, Comb..

[3]  Gerald Matz,et al.  Worst- and average-case complexity of LLL lattice reduction in MIMO wireless systems , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

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

[5]  Brigitte Vallée,et al.  An Upper Bound on the Average Number of Iterations of the LLL Algorithm , 1994, Theor. Comput. Sci..

[6]  Tharmalingam Ratnarajah,et al.  A comparison of complex lattice reduction algorithms for MIMO detection , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[7]  W. van Etten,et al.  Maximum Likelihood Receiver for Multiple Channel Transmission Systems , 1976, IEEE Trans. Commun..

[8]  Zhongding Lei,et al.  An improved square-root algorithm for BLAST , 2004, IEEE Signal Processing Letters.

[9]  A. Kaye,et al.  Transmission of Multiplexed PAM Signals Over Multiple Channel and Diversity Systems , 1970 .

[10]  KyungHi Chang,et al.  On the achievable improvement by the linear minimum mean square error detector , 2009, 2009 9th International Symposium on Communications and Information Technology.

[11]  John S. Thompson,et al.  Performance Analysis of a Fixed-Complexity Sphere Decoder in High-Dimensional Mimo Systems , 2006, 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings.

[12]  Emre Telatar,et al.  Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..

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

[14]  Reinaldo A. Valenzuela,et al.  V-BLAST: an architecture for realizing very high data rates over the rich-scattering wireless channel , 1998, 1998 URSI International Symposium on Signals, Systems, and Electronics. Conference Proceedings (Cat. No.98EX167).

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

[16]  László Lovász,et al.  Algorithmic theory of numbers, graphs and convexity , 1986, CBMS-NSF regional conference series in applied mathematics.

[17]  Wai Ho Mow,et al.  Universal lattice decoding: principle and recent advances , 2003, Wirel. Commun. Mob. Comput..

[18]  D. Wubben,et al.  On the Performance of Lattice Reduction Schemes for MIMO Data Detection , 2007, 2007 Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers.

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

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

[21]  A. Edelman.  Eigenvalues and condition numbers of random matrices , 1988 .

[22]  S. Haykin,et al.  Modern Wireless Communications , 1939, Nature.

[23]  A. Robert Calderbank,et al.  Space-Time block codes from orthogonal designs , 1999, IEEE Trans. Inf. Theory.

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

[25]  W. van Etten.  An Optimum Linear Receiver for Multiple Channel Digital Transmission Systems , 1975, IEEE Trans. Commun..

[26]  Zhongding Lei,et al.  A Comparative Study of QRD-M Detection and Sphere Decoding for MIMO-OFDM Systems , 2005, 2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications.

[27]  Babak Daneshrad,et al.  A comparative study of MIMO detection algorithms for wideband spatial multiplexing systems , 2005, IEEE Wireless Communications and Networking Conference, 2005.

[28]  Jiang Yue,et al.  A QRD-M/Kalman filter-based detection and channel estimation algorithm for MIMO-OFDM systems , 2005, IEEE Transactions on Wireless Communications.

[29]  Babak Hassibi,et al.  An efficient square-root algorithm for BLAST , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[30]  Bong-Soo Sohn,et al.  Topology Preserving Tetrahedral Decomposition Applied To Trilinear Interval Volume Tetrahedrization , 2009, KSII Trans. Internet Inf. Syst..

[31]  Hiroyuki Kawai,et al.  Adaptive control of surviving symbol replica candidates in QRM-MLD for OFDM MIMO multiplexing , 2006, IEEE Journal on Selected Areas in Communications.

[32]  K.-D. Kammeyer,et al.  MMSE extension of V-BLAST based on sorted QR decomposition , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).