Searching in the Delta Lattice: An Efficient MIMO Detection for Iterative Receivers

This paper introduces a new framework of the multiple-input multiple-output (MIMO) detection in iterative receivers. Unlike the conventional methods processing with symbol lattice, we consider the delta symbol lattice, i.e., the difference between two arbitrary points in the symbol lattice. The inherent flexible, symmetric, and sparse properties of the delta lattice enhance the detection in both complexity and performance aspects. Consequently, we propose a delta-list MIMO (DL-MIMO) detection which separately exploits the channel information and the a priori information so that a soft-input soft-output sphere decoder is dispensable. Simulation results demonstrate this hardware-friendly DL-MIMO detection delivers nearly-optimal performance at affordable cost in a practical scenario.

[1]  Loïc Brunel,et al.  Soft-input soft-output lattice sphere decoder for linear channels , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[2]  Stephan ten Brink,et al.  Achieving near-capacity on a multiple-antenna channel , 2003, IEEE Trans. Commun..

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

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

[5]  Gerd Ascheid,et al.  Tight Approximation of the Bit Error Rate for BICM(-ID) Assuming Imperfect CSI , 2008, IEEE Transactions on Wireless Communications.

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

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