Sum-Rate Based Coordinated Beamforming in Multicell Multi-Antenna Wireless Networks

This paper is concerned with sum rate maximization problem (program) of coordinated downlink beamforming in multicell multi-antenna wireless networks, which has never been adequately considered in literature due to its computational difficulty. It is shown to be efficiently solved by means of d.c. (...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE communications letters Jg. 18; H. 6; S. 1019 - 1022
Hauptverfasser: Che, E., Tuan, H. D.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.06.2014
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Antennas
Applied sciences
Array signal processing
Base stations
Convex functions
Detection, estimation, filtering, equalization, prediction
Equipments and installations
Exact sciences and technology
Information, signal and communications theory
Linear programming
Mobile radiocommunication systems
Optimization
Radiocommunications
Signal and communications theory
Signal, noise
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
Vectors
Wireless networks
Multicell multi-antenna network
coordinated beamforming
sum rate maximization
d.c. optimization
Performance evaluation
Mobile radiocommunication
Convex set
Wireless telecommunication
Downlink
Cell network
Computational complexity
Convex programming
Beam forming
Optimization
Algorithm performance
Signal processing
Convergence rate
Wireless network
Convex function
Antenna array
ISSN:1089-7798, 1558-2558
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper is concerned with sum rate maximization problem (program) of coordinated downlink beamforming in multicell multi-antenna wireless networks, which has never been adequately considered in literature due to its computational difficulty. It is shown to be efficiently solved by means of d.c. (difference of two convex functions/sets) programming. The important advantages of our proposed algorithm are: guaranteed convergence, low computational complexity, and excellent performance.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2014.2316147