Abstract

Our goal in this paper is to study the effect of the receiver structure upon the achievable data rates. We consider transmission of linearly precoded data symbols over a frequency selective block fading multiple input multiple output (MIMO) wireless channel. To encompass a number of transmission schemes, we study this problem utilizing affine precoding, which is a unified model of linearly precoded data symbols with superimposed training. We focus on Bayesian receivers that estimate both the unknown fading coefficients and the data symbols. The receiver may adopt either of the following strategies to retrieve the data symbols: strategy (i) the receiver obtains joint Bayesian channel and symbol estimates, strategy, (ii) the receiver obtains a Bayesian channel estimate initially and the channel measurement is utilized to estimate the data symbols. For both strategies, we provide lower bounds on the mutual information between the data symbols and their corresponding estimates, and we relate these bounds to the symbol Cramer-Rao bound (CRB) matrices. In contrast to strategy (ii), for strategy (i) the lower bound does not depend on either the channel estimate or the covariance of the channel estimation error. For strategy (ii) we show that asymptotically (as the size of the transmission block grows) there is no loss of information after the maximum a posteriori (MAP) estimate of Gaussian symbols. We also provide guidelines to design affine precoders that maximize the derived lower bounds under the total average transmit power constraint.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.