A Stable Expected Complexity Sphere Detection with IRA Enhancement

A new detection method based on sphere decoding (SD) is proposed in this paper to approach near-maximum likelihood (ML) performance for multi-input multi- output (MIMO) detection. The feature of the proposed method is that the complexity which means the electric power consumption in detection processing is stable for a wide range of signal-to-noise ratios (SNRs) and a number of antennas. We hold the complexity by a tree pruning mechanism which obtains detection radius through the close-form expression for the SD expected complexity R.Gowaikar and B.Hassibi, 2007. And the Increasing Radii Algorithm (IRA) mechanism is used in the method to reduce the SER at the stable expected complexity. The simulation results show that the method gets a low stable expected complexity without sacrificing much in terms of performance.

[1]  Gerard J. Foschini,et al.  Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas , 1996, Bell Labs Technical Journal.

[2]  Jeffrey C. Lagarias,et al.  Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice , 1990, Comb..

[3]  Babak Hassibi,et al.  Efficient statistical pruning for maximum likelihood decoding , 2003, 2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03)..

[4]  Babak Hassibi,et al.  Statistical Pruning for Near-Maximum Likelihood Decoding , 2007, IEEE Transactions on Signal Processing.

[5]  Claus-Peter Schnorr,et al.  Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems , 1991, FCT.

[6]  Mohamed Oussama Damen,et al.  Lattice code decoder for space-time codes , 2000, IEEE Communications Letters.

[7]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[8]  W. Marsden.  I and J , 2012 .

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

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

[11]  Il-Min Kim,et al.  BER analysis for hard MMSE detection in MIMO systems , 2011, ICUIMC '11.

[12]  Amir K. Khandani,et al.  On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis , 1998, IEEE Trans. Inf. Theory.

[13]  Robert F. H. Fischer,et al.  Lattice-reduction-aided broadcast precoding , 2004, IEEE Transactions on Communications.

[14]  Il-Min Kim,et al.  Exact and Closed-Form Error Performance Analysis for Hard MMSE Detection in MIMO Systems , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

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

[16]  Reinaldo A. Valenzuela,et al.  Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture , 1999 .

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

[18]  Jing Wang,et al.  Joint ML channel estimation and data detection for STBC via novel sphere decoding algorithms , 2005, 2005 IEEE 61st Vehicular Technology Conference.

[19]  Georgios B. Giannakis,et al.  Sphere decoding algorithms with improved radius search , 2005, IEEE Trans. Commun..

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

[21]  Babak Hassibi,et al.  Efficient near-ml decoding via statistical pruning , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..