A Low ML-Decoding Complexity, Full-Diversity, Full-Rate MIMO Precoder
From MaRDI portal
Publication:4573316
DOI10.1109/TSP.2011.2162957zbMATH Open1393.94760arXiv1101.2533OpenAlexW2053379333MaRDI QIDQ4573316FDOQ4573316
Authors:
Publication date: 18 July 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
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 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- 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 and 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 , and systems.
Full work available at URL: https://arxiv.org/abs/1101.2533
Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35)
Cited In (4)
- Title not available (Why is that?)
- A Simple ML Detection for Coded Generalized Frequency Division Multiplexing in MIMO Channels
- An Adaptive Conditional Zero-Forcing Decoder With Full-Diversity, Least Complexity and Essentially-ML Performance for STBCs
- High-Rate, Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks
This page was built for publication: A Low ML-Decoding Complexity, Full-Diversity, Full-Rate MIMO Precoder
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4573316)