Linear minimum-distance precoding for MIMO systems using quadrature amplitude modulation

The criterion of maximizing the minimum Euclidean distance under the transmit power constraint is investigated in this paper for multiple-input multiple-output (MIMO) spatial multiplexing systems. With a real-valued constraint on the precoding matrix, a new low-complexity construction algorithm is proposed for arbitrary number of data streams and rectangular quadrature amplitude modulation (QAM) input. Feasible precoding matrices are constructed with distinctive ranks dropping from full rank to rank one, where the full-rank precoder is generated through an iteration mechanism, and the rank-one precoder is obtained by a parameterized matrix associated with the particular modulation level of QAM constellation. In addition, the other rank-deficient precoders are formally constructed by a combination of two sub-precoders from lower dimensional space. The achievable minimum distance is also presented in closedform expression for the proposed precoder, and simulation results validate the efficiency of the proposed precoder as compared with the traditional cross-form precoder.

[1]  Wai Ho Mow,et al.  A Lattice-Theoretic Characterization of Optimal Minimum-Distance Linear Precoders , 2012, ArXiv.

[2]  R. Guy Review: J. H. Conway and N. J. A. Sloane, Sphere packings, lattices and groups , 1989 .

[3]  Wai Ho Mow,et al.  Reduced and Fixed-Complexity Variants of the LLL Algorithm for Communications , 2013, IEEE Transactions on Communications.

[4]  Olivier Berder,et al.  Minimum Euclidean Distance-Based Precoding for Three-Dimensional Multiple Input Multiple Output Spatial Multiplexing Systems , 2012, IEEE Transactions on Wireless Communications.

[5]  Fredrik Rusek,et al.  Construction of Minimum Euclidean Distance MIMO Precoders and Their Lattice Classifications , 2012, IEEE Transactions on Signal Processing.

[6]  Olivier Berder,et al.  Minimum Euclidean Distance Based Precoders for MIMO Systems Using Rectangular QAM Modulations , 2012, IEEE Transactions on Signal Processing.

[7]  Gilles Burel,et al.  Extension of the MIMO Precoder Based on the Minimum Euclidean Distance: A Cross-Form Matrix , 2008, IEEE Journal of Selected Topics in Signal Processing.

[8]  Olivier Berder,et al.  Minimum Distance Based Precoder for MIMO-OFDM Systems Using a 16-QAM Modulation , 2009, 2009 IEEE International Conference on Communications.

[9]  Björn E. Ottersten,et al.  Lattice-Based Linear Precoding for MIMO Channels With Transmitter CSI , 2008, IEEE Transactions on Signal Processing.

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

[11]  Helmut Bölcskei,et al.  An overview of MIMO communications - a key to gigabit wireless , 2004, Proceedings of the IEEE.

[12]  Peter A. Hoeher,et al.  Fixed Complexity LLL Algorithm , 2009, IEEE Transactions on Signal Processing.

[13]  Zhiyong Chen,et al.  Recursive Construction of Minimum Euclidean Distance-Based Precoder for Arbitrary-Dimensional MIMO Systems , 2014, IEEE Transactions on Communications.

[14]  W. Fischer,et al.  Sphere Packings, Lattices and Groups , 1990 .

[15]  Wai Ho Mow,et al.  Optimal lattices for MIMO precoding , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[16]  Olivier Berder,et al.  Optimal minimum distance-based precoder for MIMO spatial multiplexing systems , 2004, IEEE Transactions on Signal Processing.

[17]  Yi Jiang,et al.  Ellipse Expanding Method for Minimum Distance-Based MIMO Precoder , 2012, IEEE Communications Letters.

[18]  B. Sundar Rajan,et al.  A Low ML-Decoding Complexity, Full-Diversity, Full-Rate MIMO Precoder , 2011, IEEE Transactions on Signal Processing.