A Low ML-decoding Complexity, Full-diversity, Full-rate MIMO Precoder
K. Pavan Srinath, B. Sundar Rajan

TL;DR
This paper introduces a low-complexity, full-diversity, full-rate MIMO precoder based on SVD that is easily obtainable for arbitrary QAM, offering near-optimal performance with significantly reduced ML-decoding complexity.
Contribution
A novel real-valued precoder for 2 transmit antennas that simplifies ML decoding and extends to higher antennas, outperforming existing precoders in error performance.
Findings
Achieves ML-decoding complexity of O(√M) for square M-QAM.
Provides full-diversity for various MIMO configurations.
Shows improved error performance over recent precoders.
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 for square -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 (M=4) and is extremely hard to obtain for larger QAM constellations. The proposed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced MIMO Systems Optimization · Advanced Wireless Communication Techniques · Cooperative Communication and Network Coding
