Low-Complexity Likelihood Information Generation for Spatial-Multiplexing MIMO Signal Detection

Signal detection algorithms providing likelihood information for coded spatial-multiplexing multiple-input-multiple-output (MIMO) wireless communication systems pose a critical design challenge due to their prohibitively high computational complexity. In this paper, we present a low-complexity soft-output detection algorithm by adopting four implementation-friendly algorithm-level improvements to the fixed-complexity sphere decoder. More specifically, we introduce a reliability-dependent tree expansion approach and an on-demand list-size reduction scheme for low-cost candidate list generation. In terms of performance improvement, we apply an early bit-flipping strategy and utilize the l1-norm distance representation. The algorithm is evaluated by computer simulations performed over Rayleigh flat fading channels and computational complexity analysis. Compared with the soft-output K-Best algorithm, the proposed algorithm saves at least 60% of the computations for detecting 4 × 4 64-quadrature amplitude modulation (QAM) MIMO signal and, at the same time, provides better detection performance, making it a promising detection scheme for real-life hardware implementation.

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

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

[3]  Didier Le Ruyet,et al.  Breadth first algorithms for APP detectors over MIMO channels , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[4]  Joachim Hagenauer,et al.  The exit chart - introduction to extrinsic information transfer in iterative processing , 2004, 2004 12th European Signal Processing Conference.

[5]  Hiroyuki Kawai,et al.  Likelihood function for QRM-MLD suitable for soft-decision turbo decoding and its performance for OFCDM MIMO multiplexing in multipath fading channel , 2004, 2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754).

[6]  Hiroyuki Kawai,et al.  Likelihood Function for QRM-MLD Suitable for Soft-Decision Turbo Decoding and Its Performance for OFCDM MIMO Multiplexing in Multipath Fading Channel , 2005, IEICE Trans. Commun..

[7]  Andreas Peter Burg,et al.  K-best MIMO detection VLSI architectures achieving up to 424 Mbps , 2006, 2006 IEEE International Symposium on Circuits and Systems.

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

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

[10]  Ender Ayanoglu,et al.  Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[11]  Magnus Sandell,et al.  On Generating Soft Outputs for Lattice-Reduction-Aided MIMO Detection , 2007, 2007 IEEE International Conference on Communications.

[12]  Zhongfeng Wang,et al.  Early-Pruning K-Best Sphere Decoder for MIMO Systems , 2007, 2007 IEEE Workshop on Signal Processing Systems.

[13]  Tong Zhang,et al.  Relaxed $K$ -Best MIMO Signal Detector Design and VLSI Implementation , 2007, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[14]  Gwan S. Choi,et al.  Dynamically reconfigurable soft output MIMO detector , 2008, 2008 IEEE International Conference on Computer Design.

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

[16]  G. Matz,et al.  Capacity-based performance comparison of MIMO-BICM demodulators , 2008, 2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications.

[17]  Hsie-Chia Chang,et al.  Early-Pruned K-Best Sphere Decoding Algorithm Based on Radius Constraints , 2008, 2008 IEEE International Conference on Communications.

[18]  Liang Liu,et al.  Design of Highly-Parallel, 2.2Gbps Throughput Signal Detector for MIMO Systems , 2008, 2008 IEEE International Conference on Communications.

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

[20]  Kyungwhoon Cheun,et al.  A Low Complexity Euclidean Norm Approximation , 2008, IEEE Transactions on Signal Processing.

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

[22]  Björn E. Ottersten,et al.  The Error Probability of the Fixed-Complexity Sphere Decoder , 2009, IEEE Transactions on Signal Processing.

[23]  Ranjan K. Mallik,et al.  Asymptotic Performance of Lp-Norm MIMO Detection , 2010, 2010 IEEE 72nd Vehicular Technology Conference - Fall.

[24]  P. Glenn Gulak,et al.  VLSI implementation of a WiMAX/LTE compliant low-complexity high-throughput soft-output K-Best MIMO detector , 2010, Proceedings of 2010 IEEE International Symposium on Circuits and Systems.

[25]  Tzi-Dar Chiueh,et al.  A 74.8 mW Soft-Output Detector IC for 8 $\,\times\,$8 Spatial-Multiplexing MIMO Communications , 2010, IEEE Journal of Solid-State Circuits.

[26]  Tong Zhang,et al.  A 1.1-Gb/s 115-pJ/bit Configurable MIMO Detector Using 0.13- $\mu\hbox{m}$ CMOS Technology , 2010, IEEE Transactions on Circuits and Systems II: Express Briefs.

[27]  Holger Boche,et al.  On Predicting Convergence of Iterative MIMO Detection-Decoding With Concatenated Codes , 2010, IEEE Transactions on Vehicular Technology.

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

[29]  Bruno Clerckx,et al.  MIMO techniques in WiMAX and LTE: a feature overview , 2010, IEEE Communications Magazine.