Efficiency Improvement of the Fixed-Complexity Sphere Decoder

In this paper, we propose two schemes to reduce the complexity of fixed-complexity sphere decoder (FSD) algorithm in the ordering and tree-search stages, respectively, while achieving quasi-ML performance. In the ordering stage, we propose a QR-decomposition-based FSD signal ordering based on the zero-forcing criterion (FSD-ZF-SQRD) that requires only a few number of additional complex flops compared to the unsorted QRD. Also, the proposed ordering algorithm is extended using the minimum mean square error (MMSE) criterion to achieve better performance. In the tree-search stage, we introduce a threshold-based complexity reduction approach for the FSD depending on the reliability of the signal with the largest noise amplification. Numerical results show that in 8 ? 8 MIMO system, the proposed FSD-ZF-SQRD and FSD-MMSE-SQRD only require 19.5% and 26.3% of the computational efforts required by Hassibi’s scheme, respectively. Moreover, a third threshold vector is outlined which can be used for high order modulation schemes. In 4 ? 4 MIMO system using 16-QAM and 64-QAM, simulation results show that when the proposed threshold-based approach is employed, FSD requires only 62.86% and 53.67% of its full complexity, respectively.

[1]  Moon-Ryul Jung,et al.  An Active Contour Approach to Extract Feature Regions from Triangular Meshes , 2011, KSII Trans. Internet Inf. Syst..

[2]  Min Chen,et al.  Hybrid No-Reference Video Quality Assessment Focusing on Codec Effects , 2011, KSII Trans. Internet Inf. Syst..

[3]  Mei Yu,et al.  A Perception-based Color Correction Method for Multi-view Images , 2011, KSII Trans. Internet Inf. Syst..

[4]  KyungHi Chang,et al.  On Improving the Efficiency of the Fixed-Complexity Sphere Decoder , 2009, 2009 IEEE 70th Vehicular Technology Conference Fall.

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

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

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

[8]  Björn E. Ottersten,et al.  Full Diversity Detection in MIMO Systems with a Fixed-Complexity Sphere Decoder , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

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

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

[11]  Martin Haardt,et al.  An introduction to the multi-user MIMO downlink , 2004, IEEE Communications Magazine.

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

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

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

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

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

[17]  E. Telatar,et al.  On the capacity of multi-antenna Gaussian channels , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

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

[19]  Joseph M. Kahn,et al.  Layered space-time codes for wireless communications using multiple transmit antennas , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

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

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

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