arXiv Analytics

Sign in

arXiv:1406.7486 [cs.IT]AbstractReferencesReviewsResources

Achievable Rates of FDD Massive MIMO Systems with Spatial Channel Correlation

Zhiyuan Jiang, Andreas F. Molisch, Giuseppe Caire, Zhisheng Niu

Published 2014-06-29Version 1

It is well known that the performance of frequency-division-duplex (FDD) massive MIMO systems with i.i.d. channels is disappointing compared with that of time-division-duplex (TDD) systems, due to the prohibitively large overhead for acquiring channel state information at the transmitter (CSIT). In this paper, we investigate the achievable rates of FDD massive MIMO systems with spatially correlated channels, considering the CSIT acquisition dimensionality loss, the imperfection of CSIT and the regularized-zero-forcing linear precoder. The achievable rates are optimized by judiciously designing the downlink channel training sequences and user CSIT feedback codebooks, exploiting the multiuser spatial channel correlation. We compare our achievable rates with TDD massive MIMO systems, i.i.d. FDD systems, and the joint spatial division and multiplexing (JSDM) scheme, by deriving the deterministic equivalents of the achievable rates, based on popular channel models. It is shown that, based on the proposed eigenspace channel estimation schemes, the rate-gap between FDD systems and TDD systems is significantly narrowed, even approached under moderate number of base station antennas. Compared to the JSDM scheme, our proposal achieves dimensionality-reduction channel estimation without channel pre-projection, and higher throughput for moderate number of antennas and moderate to large channel coherence time, though at higher computational complexity.

Related articles: Most relevant | Search more
arXiv:1512.03230 [cs.IT] (Published 2015-12-10)
Joint Channel Training and Feedback for FDD Massive MIMO Systems
arXiv:cs/0512076 [cs.IT] (Published 2005-12-18)
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications
arXiv:1705.02976 [cs.IT] (Published 2017-05-08)
On the Achievable Rates of Decentralized Equalization in Massive MU-MIMO Systems