ML Symbol Detection Based on the Shortest Path Algorithm for MIMO Systems

This paper presents a new maximum likelihood (ML) symbol detection algorithm for multiple-input multiple-output (MIMO) systems. To achieve the ML performance with low complexity, we search the integer points corresponding to symbol vectors in increasing order of the distance from the unconstrained least-squares solution. For each integer point, we test if it is the ML solution, and continue the integer point search until one of searched points is determined to be the ML solution. We present an efficient iterative search strategy, which is based on the shortest path algorithm for a graph. The simulation results show that the proposed algorithm has the lower complexity compared to the sphere decoding for channel matrices having low condition numbers. For further complexity reduction, we propose to use scaling, lattice-reduction, and regularization techniques. By applying these techniques, the computational complexity of proposed algorithm is reduced significantly when the channel matrix has a high condition number.

[1]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

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

[3]  M. O. Damen,et al.  A unified framework for tree search decoding: rediscovering the sequential decoder , 2005, SPAWC 2005.

[4]  Holger Grothe,et al.  Calculation of Minkowski-reduced lattice bases , 2005, Computing.

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

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

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

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

[9]  A. Lee Swindlehurst,et al.  A vector-perturbation technique for near-capacity multiantenna multiuser communication-part II: perturbation , 2005, IEEE Transactions on Communications.

[10]  L. Hanzo,et al.  Interference cancellation assisted lattice-reduction aided detection for MIMO systems , 2006, 2006 IEEE Ninth International Symposium on Spread Spectrum Techniques and Applications.

[11]  Krishna R. Pattipati,et al.  An improved complex sphere decoder for V-BLAST systems , 2004, IEEE Signal Processing Letters.

[12]  Tomohiko Uyematsu,et al.  Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder , 2004, ArXiv.

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

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

[15]  Gene H. Golub,et al.  Matrix computations , 1983 .

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

[17]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

[18]  Dirk Wübben,et al.  Near-maximum-likelihood detection of MIMO systems using MMSE-based lattice reduction , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

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

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