.png){kind=icon}
.png){kind=icon}
Return
A Fast Low Complexity Method for Optimal Zero-Forcing Beamformer MU-MIMO System
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2015.2407903.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Accelerated gradient method
beamformer
MU-MIMO
optimal step size
optimum zero-forcing
per-antenna power constraints
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W