Implementation of complex enumeration for multiuser MIMO vector precoding

In recent years the interest in developing efficient algorithms for the multiple-input multiple-output (MIMO) broadcast channel has arisen. Vector precoding (VP) techniques have shown very promising performance results, but the perturbation process inherent in these type of non-linear systems hinders their efficient implementation. The key to achieving a high-throughput VP implementation is to operate directly on the complex-valued constellations. Nevertheless, the complex-plane Schnorr-Euchner enumerators present in the literature follow a sequential scheme, which derives in an increased system delay and high resource demand in fully-pipelined architectures. This paper presents the first non-sequential complex Schnorr-Euchner enumerator for the precoding scenario. The proposed complex enumerator has been implemented and analyzed along with other state-of-the-art enumeration algorithms. Provided hardware occupation and latency results show that the proposed enumeration algorithm is superior to other existing schemes in terms of hardware resource usage and throughput.

[1]  Claus-Peter Schnorr,et al.  Lattice basis reduction: Improved practical algorithms and solving subset sum problems , 1991, FCT.

[2]  P. Glenn Gulak,et al.  A pipelined scalable high-throughput implementation of a near-ML K-best complex lattice decoder , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[3]  Sudip Mondal,et al.  A novel approach for K-best MIMO detection and its VLSI implementation , 2008, 2008 IEEE International Symposium on Circuits and Systems.

[4]  Wolfgang Utschick,et al.  Minimum Mean Square Error Vector Precoding , 2005, 2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications.

[5]  G. Fettweis,et al.  Vector precoding with bounded complexity , 2007, 2007 IEEE 8th Workshop on Signal Processing Advances in Wireless Communications.

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

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

[8]  J. Del Ser,et al.  Wiener filter-based fixed-complexity vector precoding for the MIMO downlink channel , 2009, 2009 IEEE 10th Workshop on Signal Processing Advances in Wireless Communications.

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

[10]  Gerhard Fettweis,et al.  Search sequence determination for tree search based detection algorithms , 2009, 2009 IEEE Sarnoff Symposium.

[11]  Andreas Peter Burg,et al.  K-best MIMO detection VLSI architectures achieving up to 424 Mbps , 2006, 2006 IEEE International Symposium on Circuits and Systems.

[12]  L. G. Barbero,et al.  A Fixed-Complexity MIMO Detector Based on the Complex Sphere Decoder , 2006, 2006 IEEE 7th Workshop on Signal Processing Advances in Wireless Communications.

[13]  A. Burg,et al.  VLSI implementation of MIMO detection using the sphere decoding algorithm , 2005, IEEE Journal of Solid-State Circuits.