A low ML-decoding complexity, full-diversity, full-rate MIMO precoder

Pavan Srinath, K. ; Sundar Rajan, B. (2011) A low ML-decoding complexity, full-diversity, full-rate MIMO precoder In: 2011 IEEE International Symposium on Information Theory Proceedings, 31 Jul-05 Aug 2011, St. Petersburg, Russia.

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/document/6034111/

Related URL: http://dx.doi.org/10.1109/ISIT.2011.6034111

Abstract

Precoding for multiple-input, multiple-output (MIMO) antenna systems is considered with perfect channel knowledge available at both the transmitter and the receiver. For 2 transmit antennas and QAM constellations, a precoder that is approximately optimal (with respect to the minimum Euclidean distance between points in the received signal space) among real-valued precoders based on the singular value decomposition (SVD) of the channel is proposed. The proposed precoder is obtainable easily for arbitrary QAM constellations, unlike the known complex-valued optimal precoder by Collin et al. for 2 transmit antennas which is in existence for 4-QAM alone and is extremely hard to obtain for larger QAM constellations. The proposed precoding scheme is extended to higher number of transmit antennas on the lines of the E-dmin precoder for 4-QAM by Vrigneau et al.. The proposed precoder has an ML-decoding complexity of O(√M) as against the E-dmin precoder's complexity of O(M√M) (M = 4). Compared with the recently proposed X- and Y - precoders, the error performance of the proposed precoder is significantly better. The proposed precoder provides full-diversity for QAM constellations and this is supported by simulation plots of the word error probability for 2 × 2, 4 × 4 and 8 × 8 systems.

Item Type:Conference or Workshop Item (Paper)
Source:Copyright of this article belongs to Institute of Electrical and Electronics Engineers.
ID Code:110460
Deposited On:08 Dec 2017 10:23
Last Modified:08 Dec 2017 10:23

Repository Staff Only: item control page