A Flexible Tree Searching Scheme for MIMO Detection

Detection is one of the key technologies in multiple-input multiple-output system. In this paper we propose a new tree searching scheme which is flexible in the tradeoff between performance and complexity. Sorted QR decomposition based on minimum mean square error (MMSE) criteria is applied as a preprocessing to make the channel easier for tree searching and Fano bias, which is adjustable to achieve a good tradeoff between performance and complexity, is applied in the radius setting for different layer to more efficiently prune the leaves. Much smaller complexity is needed by the proposed scheme with negligible performance degradation compared with that of sphere decoding scheme, especially in the scenarios of larger number of transmitter antennas and high order modulation. Simulations accommodate our conclusions.

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

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

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

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

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

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

[7]  Wolfgang Rave,et al.  On the Complexity of Sphere Decoding , 2004 .

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

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

[10]  Helmut Bölcskei,et al.  Advanced receiver algorithms for MIMO wireless communications , 2006, Proceedings of the Design Automation & Test in Europe Conference.

[11]  Michael E. Pohst,et al.  On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications , 1981, SIGS.

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

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

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