Distributed downlink beamforming with cooperative base stations

Date

2008

Authors

Ng, B. L.
Evans, J. S.
Hanly, S. V.
Aktas, D.

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

Source Title

IEEE Transactions on Information Theory

Print ISSN

0018-9448

Electronic ISSN

1557-9654

Publisher

Institute of Electrical and Electronics Engineers

Volume

54

Issue

12

Pages

5491 - 5499

Language

English

Journal Title

Journal ISSN

Volume Title

Citation Stats
Attention Stats
Usage Stats
2
views
34
downloads

Series

Abstract

In this paper, we consider multicell processing on the downlink of a cellular network to accomplish "macrodiversity" 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.

Course

Other identifiers

Book Title

Degree Discipline

Degree Level

Degree Name

Citation

Published Version (Please cite this version)