Implementation Strategies for High-Performance Multiuser MIMO Precoders

The multiuser MIMO environment enables the communication between a base-station and multiple users with several antennas. In such a scenario, the use of precoding techniques is required in order to detect the signal at the users’ terminals without any cooperation between them. This contribution presents various designs and hardware implementations of a high-capacity precoder based on vector perturbation. To this aim, three tree-search techniques and their associated user-ordering schemes are investigated in this chapter: the well-known K-Best precoder, the fixed-complexity Fixed Sphere Encoder (FSE), and the variable complexity Single Best-Node Expansion (SBE). All of the aforementioned techniques aim at finding the most suitable perturbation vector within an infinite lattice without the high computational complexity of an exhaustive search.

[1]  John S. Thompson,et al.  Design and Implementation of a Low-Complexity Multiuser Vector Precoder , 2012, Int. J. Embed. Real Time Commun. Syst..

[2]  Zixiang Xiong,et al.  An FPGA Implementation of Dirty Paper Precoder , 2007, 2007 IEEE International Conference on Communications.

[3]  John B. Anderson,et al.  Sequential Coding Algorithms: A Survey and Cost Analysis , 1984, IEEE Trans. Commun..

[4]  Josef A. Nossek,et al.  Linear transmit processing in MIMO communications systems , 2005, IEEE Transactions on Signal Processing.

[5]  A. Lee Swindlehurst,et al.  A vector-perturbation technique for near-capacity multiantenna multiuser communication-part I: channel inversion and regularization , 2005, IEEE Transactions on Communications.

[6]  Wolfgang Utschick,et al.  Information Theory Minimum mean square error vector precoding , 2008, Eur. Trans. Telecommun..

[7]  Andreas Peter Burg,et al.  Low-complexity vector precoding for multi-user systems , 2012, 2012 Conference Record of the Forty Sixth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).

[8]  KyungHi Chang,et al.  Fixed-complexity sphere encoder for multi-user MIMO systems , 2011, Journal of Communications and Networks.

[9]  U. Fincke,et al.  Improved methods for calculating vectors of short length in a lattice , 1985 .

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

[11]  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.

[12]  Gerhard Bauch,et al.  Cholesky Factorization With Symmetric Permutation Applied to Detecting and Precoding Spatially Multiplexed Data Streams , 2007, IEEE Transactions on Signal Processing.

[13]  A. Burg,et al.  VLSI implementation of the sphere decoding algorithm , 2004, Proceedings of the 30th European Solid-State Circuits Conference.

[14]  Mikel Mendicute,et al.  Fully Pipelined Implementation of Tree-Search Algorithms for Vector Precoding , 2013, Int. J. Reconfigurable Comput..

[15]  Andreas Peter Burg,et al.  Reduced-complexity mimo detector with close-to ml error rate performance , 2007, GLSVLSI '07.

[16]  H. Miyakawa,et al.  Matched-Transmission Technique for Channels With Intersymbol Interference , 1972, IEEE Trans. Commun..

[17]  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.

[18]  M. Joham,et al.  MMSE Approaches to Multiuser Spatio-Temporal Tomlinson-Harashima Precoding , 2004 .

[19]  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.

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

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

[22]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

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

[24]  M. Tomlinson.  New automatic equaliser employing modulo arithmetic , 1971 .

[25]  Robert F. H. Fischer,et al.  Lattice-reduction-aided broadcast precoding , 2004, IEEE Transactions on Communications.

[26]  Robert W. Heath,et al.  Shifting the MIMO Paradigm , 2007, IEEE Signal Processing Magazine.

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

[28]  Kyeong Jin Kim,et al.  Near-Capacity MIMO Multiuser Precoding with QRD-M Algorithm , 2005, Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005..

[29]  Mikel Mendicute,et al.  High-throughput implementation of tree-search algorithms for vector precoding , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[30]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

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

[32]  Gerhard Bauch,et al.  Efficient Tomlinson-Harashima precoding for spatial multiplexing on flat MIMO channel , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[33]  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.

[34]  Gerald Matz,et al.  VLSI Implementation of a Lattice-Reduction Algorithm for Multi-Antenna Broadcast Precoding , 2007, 2007 IEEE International Symposium on Circuits and Systems.