Achievable Rates of MIMO Systems With Linear Precoding and Iterative LMMSE Detection

DOI10.1109/TIT.2014.2349513MaRDI QIDQ2983351zbMATH OpenFDO

Authors Xiaojun Yuan, Li Ping, Aleksandar Kavčić, Chongbin Xu

Publication date 16 May 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1106.0178

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13) Source coding (94A29)

Abstract: We establish area theorems for iterative detection over coded linear systems (including multiple-input multipleoutput (MIMO) channels, inter-symbol-interference (ISI) channels, and orthogonal frequency-division multiplexing (OFDM) systems). We propose a linear precoding technique that asymptotically ensures the Gaussianness of the messages passed in iterative detection, as the transmission block length tends to infinity. We show that the proposed linear precoding scheme with iterative linear minimum mean-square error (LMMSE) detection is potentially information lossless, under various assumptions on the availability of channel state information at the transmitter (CSIT). Numerical results are provided to verify our analysis.

Cited in

(2)

• A simplified MMSE-based iterative receiver for MIMO systems
• Achievable Sum Rate of MIMO MMSE Receivers: A General Analytic Framework

This page was built for publication: Achievable Rates of MIMO Systems With Linear Precoding and Iterative LMMSE Detection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2983351)