An Efficient Algorithm for Zero-Forcing Coordinated Beamforming

The problem of beam tracking for zero-forcing coordinated beamforming in multiple-cell time-varying multiple-input multiple-output channels is considered. Based on null-space perturbation theory, an efficient update algorithm for block-diagonalization-based zero-forcing coordinated beam design is pr...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2012-07, Vol.16 (7), p.994-997
Main Authors: Haksoo Kim, Heejung Yu, Youngchul Sung, Lee, Y. H.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Algorithms
Applied sciences
Array signal processing
Beamforming
Blocking
Channels
Computational complexity
Coordinated beamforming
coordinated multipoint
Detection, estimation, filtering, equalization, prediction
Exact sciences and technology
Information, signal and communications theory
Mathematical analysis
Matrix decomposition
MIMO
Null space
Perturbation theory
Signal and communications theory
Signal, noise
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
time-varying channels
Tracking
Transmission and modulation (techniques and equipments)
Vectors
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The problem of beam tracking for zero-forcing coordinated beamforming in multiple-cell time-varying multiple-input multiple-output channels is considered. Based on null-space perturbation theory, an efficient update algorithm for block-diagonalization-based zero-forcing coordinated beam design is proposed and its performance is analyzed. In slowly-varying channels, the proposed algorithm well tracks the zero-forcing beam solution and significantly reduces computational complexity by simply updating beamforming matrices instead of redesigning them with new channel state information at each time step.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2012.050412.112565