Decentralizing Multicell Beamforming via Deterministic Equivalents

This paper focuses on developing a decentralized framework for coordinated minimum power beamforming wherein <inline-formula> <tex-math notation="LaTeX">L </tex-math></inline-formula> base stations (BSs), each equipped with <inline-formula> <tex-math notati...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on communications Jg. 67; H. 3; S. 1894 - 1909
Hauptverfasser: Asgharimoghaddam, Hossein, Tolli, Antti, Sanguinetti, Luca, Debbah, Merouane
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.03.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Institute of Electrical and Electronics Engineers
Schlagworte:
Algorithms
Antennas
Approximation algorithms
Array signal processing
Asymptotic properties
Beamforming
Channels
Computer simulation
Correlation
distributed multicell beamforming
Engineering Sciences
Fading channels
Heuristic methods
Interference
Iterative methods
Large scale antenna arrays
large system analysis
MIMO cellular networks
Parameters
power minimization
System analysis and design
User satisfaction
ISSN:0090-6778, 1558-0857
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper focuses on developing a decentralized framework for coordinated minimum power beamforming wherein <inline-formula> <tex-math notation="LaTeX">L </tex-math></inline-formula> base stations (BSs), each equipped with <inline-formula> <tex-math notation="LaTeX">N </tex-math></inline-formula> antennas, serve <inline-formula> <tex-math notation="LaTeX">K </tex-math></inline-formula> single-antenna users with specific rate constraints. This is realized by considering user specific intercell interference (ICI) strength as the principal coupling parameter among BSs. First, explicit deterministic expressions for transmit powers are derived for spatially correlated channels in the asymptotic regime in which <inline-formula> <tex-math notation="LaTeX">N </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">K </tex-math></inline-formula> grow large with a non-trivial ratio <inline-formula> <tex-math notation="LaTeX">K/N </tex-math></inline-formula>. These asymptotic expressions are then used to compute approximations of the optimal ICI values that depend only on the channel statistics. By relying on the approximate ICI values as coordination parameters, a distributed non-iterative coordination algorithm, suitable for large networks with limited backhaul, is proposed. A heuristic algorithm is also proposed relaxing coordination requirements even further as it only needs pathloss values for non-local channels. The proposed algorithms satisfy the target rates for all users even when <inline-formula> <tex-math notation="LaTeX">N </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">K </tex-math></inline-formula> are relatively small. Finally, the potential benefits of grouping users with similar statistics are investigated to further reduce the overhead and computational effort of the proposed solutions. Simulation results show that the proposed methods yield near-optimal performance.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2018.2883445