pith. sign in

arxiv: 1106.0178 · v2 · pith:GIJ6OBMOnew · submitted 2011-06-01 · 💻 cs.IT · math.IT

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

classification 💻 cs.IT math.IT
keywords lineardetectioniterativeprecodingsystemschannelsinformationlmmse
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.