Distributed Downlink Beamforming With Cooperative Base Stations

In this paper, we consider multicell processing on the downlink of a cellular network to accomplish ldquomacrodiversityrdquo transmit beamforming. The particular downlink beamformer structure we consider allows a recasting of the downlink beamforming problem as a virtual linear mean square error (LM...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory Jg. 54; H. 12; S. 5491 - 5499
Hauptverfasser: Boon Loong Ng, Evans, J.S., Hanly, S.V., Aktas, D.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.12.2008
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
ISSN:0018-9448, 1557-9654
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we consider multicell processing on the downlink of a cellular network to accomplish ldquomacrodiversityrdquo transmit beamforming. The particular downlink beamformer structure we consider allows a recasting of the downlink beamforming problem as a virtual linear mean square error (LMMSE) estimation problem. We exploit the structure of the channel and develop distributed beamforming algorithms using local message passing between neighboring base stations. For 1-D networks, we use the Kalman smoothing framework to obtain a forward-backward beamforming algorithm. We also propose a limited extent version of this algorithm that shows that the delay need not grow with the size of the network in practice. For 2-D cellular networks, we remodel the network as a factor graph and present a distributed beamforming algorithm based on the sum-product algorithm. Despite the presence of loops in the factor graph, the algorithm produces optimal results if convergence occurs.
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:0018-9448
1557-9654
DOI:10.1109/TIT.2008.2006426