A Fast Low Complexity Method for Optimal Zero-Forcing Beamformer MU-MIMO System

This letter proposes a new algorithm for solving the optimal zero-forcing beamforming problem that maximizes the user achievable rate with restriction on the per-antenna element power constraints. An accelerated gradient method with step size search is proposed for solving the problem. For each iter...

Full description

Saved in:
Bibliographic Details
Published in:IEEE signal processing letters 2015-09, Vol.22 (9), p.1443-1447
Main Authors: Dam, Hai Huyen, Cantoni, Antonio, Bin Li
Format: Article
Language:English
Subjects:
Accelerated gradient method
Acceleration
Array signal processing
beamformer
Complexity theory
Convergence
Gradient methods
MU-MIMO
optimal step size
optimum zero-forcing
per-antenna power constraints
Signal processing algorithms
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:This letter proposes a new algorithm for solving the optimal zero-forcing beamforming problem that maximizes the user achievable rate with restriction on the per-antenna element power constraints. An accelerated gradient method with step size search is proposed for solving the problem. For each iteration of the gradient approach, a quick one dimensional search is employed to obtain the step size. The advantage of the step-size search is that it is relatively fast and requires only a few calculations of the objective function. Design examples show that the proposed algorithm converges faster than the gradient approach and the accelerated gradient approach with a constant step size while achieving a low computational complexity.
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2015.2407903