English

A Low ML-decoding Complexity, Full-diversity, Full-rate MIMO Precoder

Information Theory 2015-03-17 v1 math.IT

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, an approximately optimal (with respect to the minimum Euclidean distance between points in the received signal space) real-valued precoder based on the singular value decomposition (SVD) of the channel is proposed, and it is shown to offer a maximum-likelihood (ML)-decoding complexity of O(M)\mathcal{O}(\sqrt{M}) for square MM-QAM. 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 with an ML-decoding complexity of O(MM)\mathcal{O}(M\sqrt{M}) (M=4) and is extremely hard to obtain for larger QAM constellations. The proposed precoder's loss in error performance for 4-QAM in comparison with the complex-valued optimal precoder is only marginal. Our precoding scheme is extended to higher number of transmit antennas on the lines of the E-dmind_{min} precoder for 4-QAM by Vrigneau et al. which is an extension of the complex-valued optimal precoder for 4-QAM. Compared with the recently proposed XX- and YY-precoders, the error performance of our precoder is significantly better. It is shown that our precoder provides full-diversity for QAM constellations and this is supported by simulation plots of the word error probability for 2×22\times2, 4×44\times4 and 8×88\times8 systems.

Keywords

Cite

@article{arxiv.1101.2533,
  title  = {A Low ML-decoding Complexity, Full-diversity, Full-rate MIMO Precoder},
  author = {K. Pavan Srinath and B. Sundar Rajan},
  journal= {arXiv preprint arXiv:1101.2533},
  year   = {2015}
}

Comments

33 pages, 7 figures, 4 tables

R2 v1 2026-06-21T17:11:25.201Z