A Hybrid ML Decoding Scheme for Multiple Input Multiple Output Signals on Partitioned Tree

In this paper, we propose a novel ML decoding scheme based on the combination of depth- and breadth-first search methods on a partitioned tree for multiple input multiple output (MIMO) systems. The proposed scheme first partitions the searching tree into several stages, each of which is then searched by a depth- or breadth-first search method, maximally exploiting the advantages of both the depth- and breadth-first search methods. Numerical results indicate that, when the depth- and breadth-first search algorithms are adopted appropriately, the proposed scheme exhibits substantially lower computational complexity than conventional ML decoders while maintaining the ML bit error performance.

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

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

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

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

[5]  Gabriel Valiente,et al.  Algorithms on Trees and Graphs , 2002, Springer Berlin Heidelberg.

[6]  W. Fischer,et al.  Sphere Packings, Lattices and Groups , 1990 .

[7]  Hyuncheol Park,et al.  An Efficient QRD-M Algorithm Using Partial Decision Feedback Detection , 2006, 2006 Fortieth Asilomar Conference on Signals, Systems and Computers.

[8]  Lutz H.-J. Lampe,et al.  Multiple-symbol differential sphere decoding , 2005, IEEE Transactions on Communications.

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

[10]  Zhan Guo,et al.  Reduced complexity Schnorr-Euchner decoding algorithms for MIMO systems , 2004, IEEE Communications Letters.

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

[12]  Robert Schober,et al.  Multiple-symbol differential sphere decoding , 2005, IEEE Trans. Commun..

[13]  M. J. Gans,et al.  On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas , 1998, Wirel. Pers. Commun..

[14]  Seokho Yoon,et al.  Breadth-First Signal Decoder: A Novel Maximum-Likelihood Scheme for Multi-Input–Multi-Output Systems , 2008, IEEE Transactions on Vehicular Technology.

[15]  Hiroshi Suzuki,et al.  Suboptimal Algorithm of MLD Using Gradient Signal Search in Direction of Noise Enhancement for MIMO Channels , 2007, IEICE Trans. Commun..

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

[17]  Jiawei Yang,et al.  Low-Complexity Algorithm for Near-Optimum Detection of V-BLAST Systems , 2007, IEEE Signal Processing Letters.

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

[19]  W.H. Chin,et al.  QRD based tree search data detection for MIMO communication systems , 2005, 2005 IEEE 61st Vehicular Technology Conference.

[20]  Thomas C. Hales.  Sphere packings, I , 1997, Discret. Comput. Geom..