The application of lattice-reduction to the K-Best algorithm for near-optimal MIMO detection

An efficient lattice-reduction (LR) aided implementation of the K-best algorithm is proposed for the general infinite lattice detection problem, which is realized with about 80% less complexity than currently reported architectures. The saving in complexity is achieved by the introduction of an on-demand candidate generation scheme along with a distributed sorting scheme. The proposed scheme does not require any a priori knowledge of the candidate displacement as it expands the candidates using the Schnorr-Euchner method. It is scalable in terms of the number of transmit antennas and its complexity grows sub-linearly with the constellation order. The parallelism intrinsic to the algorithm makes it suitable for the pipelined VLSI implementation.

[1]  Keith Holt,et al.  A Lattice-Reduction-Aided Soft Demapper for High-Rate Coded MIMO-OFDM Systems , 2007, IEEE Signal Processing Letters.

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

[3]  Gregory W. Wornell,et al.  Lattice-reduction-aided detectors for MIMO communication systems , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[4]  Wai Ho Mow,et al.  A VLSI architecture of a K-best lattice decoding algorithm for MIMO channels , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

[5]  Xiaodong Wang,et al.  Lattice-reduction-aided receivers for MIMO-OFDM in spatial multiplexing systems , 2004, 2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754).

[6]  Stanley J. Simmons,et al.  Sorting-based VLSI architectures for the M-algorithm and T-algorithm trellis decoders , 1995, IEEE Trans. Commun..

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