Phase Only RF Precoding for Massive MIMO Systems With Limited RF Chains

Massive MIMO systems promise high spectrum efficiency by deploying M ≫ 1 antennas at the base station (BS). However, to achieve the full gain provided by massive MIMO, the BS requires M radio frequency (RF) chains, which are expensive. This motivates us to consider RF-chain limited massive MIMO syst...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on signal processing Jg. 62; H. 17; S. 4505 - 4515
Hauptverfasser: An Liu, Lau, Vincent
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.09.2014
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
ISSN:1053-587X, 1941-0476
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Massive MIMO systems promise high spectrum efficiency by deploying M ≫ 1 antennas at the base station (BS). However, to achieve the full gain provided by massive MIMO, the BS requires M radio frequency (RF) chains, which are expensive. This motivates us to consider RF-chain limited massive MIMO systems with M antennas but only S ≪ M RF chains. We propose a two-stage precoding scheme to efficiently exploit the large spatial degree of freedom (DoF) gain in massive MIMO systems with limited RF chains and reduced channel state information (CSI) signaling overhead. In this scheme, the MIMO precoder is partitioned into a high-dimensional phase only RF precoder followed by a low-dimensional baseband precoder. The RF precoder is adaptive to the spatial correlation matrices for inter-cluster interference mitigation. The baseband precoder is adaptive to the reduced dimensional "effective" CSI for intra-cluster spatial multiplexing. We formulate the two stage precoding problem such that the minimum (weighted) average data rate of users is maximized under the phase only constraint on the RF precoder and the limited RF chain constraint. This is a combinatorial optimization problem which is in general NP-hard. We propose a low complexity solution based on a novel bi-convex approximation approach. Simulations show that the proposed design has significant gain over various baselines.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1053-587X
1941-0476
DOI:10.1109/TSP.2014.2337840