.png){kind=icon}
返回
A Quadratically Constrained Stochastic Gradient Algorithm for Beamforming in Mobile Communications
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2017.2694338.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This brief presents a new adaptive beamforming algorithm for mobile communication systems with antenna arrays. Such an algorithm belongs to the constrained stochastic gradient class of algorithms, in which the maximization of the signal-to-interference-plus-noise ratio (SINR) is carried out by using stochastic gradient optimization strategies along with instantaneous cost functions related to the SINR. The main novelty of the proposed algorithm is the use of an adaptive quadratic constraint that allows obtaining enhanced solutions for both transient and steady-state phases of the iterative process. As a consequence, the proposed algorithm, termed adaptive-projection quadratically constrained stochastic gradient (AP-QCSG) algorithm, is capable of outperforming other constrained stochastic gradient (CSG) algorithms from the literature. Simulation results are presented aiming to confirm the effectiveness of the proposed approach.
Keyword:
Adaptive antenna array
beamforming
co-channel interference
gradient method
mobile communications
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
4.9
论文数:
8.8K
被引数:
2.5W
机构
引用论文
.png){kind=icon}
Optimal Multiuser Transmit Beamforming: A Difficult Problem with a Simple Solution Structure最佳多用户发射波束成形: 具有简单解决方案结构的难题
OAAI
OAAI分享收藏分享收藏
查看更多内容