Majorization-Minimization Algorithms for Analog Beamforming with Large-Scale Antenna Arrays

A. Arora, C. Tsinos, Bhavani Shankar Mysore R, S. Chatzinotas, B. Ottersten
{"title":"Majorization-Minimization Algorithms for Analog Beamforming with Large-Scale Antenna Arrays","authors":"A. Arora, C. Tsinos, Bhavani Shankar Mysore R, S. Chatzinotas, B. Ottersten","doi":"10.1109/GlobalSIP45357.2019.8969518","DOIUrl":null,"url":null,"abstract":"Beamforming with large-scale antenna arrays (LSAA) is one of the predominant operations in designing wireless communication systems. However, the implementation of a fully digital system significantly increases the number of required radio-frequency (RF) chains, which may be prohibitive. Thus, analog beamforming based on a phase-shifting network driven by a variable gain amplifier (VGA) is a potential alternative technology. In this paper, we cast the beamforming vector design problem as a beampattern matching problem, with an unknown power gain. This is formulated as a unit-modulus leastsquares (ULS) problem where the optimal gain of the VGA is also designed in addition to the beamforming vector. We also consider a scenario where the receivers have the additional processing capability to adjust the phases of the incoming signals to mitigate specular multipath components. We propose efficient majorization-minimization (MM) based algorithms with convergence guarantees to a stationary point for solving both variants of the proposed ULS problem. Numerical results verify the effectiveness of the proposed solution in comparison with the existing state-of-the-art techniques.","PeriodicalId":221378,"journal":{"name":"2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GlobalSIP45357.2019.8969518","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

Beamforming with large-scale antenna arrays (LSAA) is one of the predominant operations in designing wireless communication systems. However, the implementation of a fully digital system significantly increases the number of required radio-frequency (RF) chains, which may be prohibitive. Thus, analog beamforming based on a phase-shifting network driven by a variable gain amplifier (VGA) is a potential alternative technology. In this paper, we cast the beamforming vector design problem as a beampattern matching problem, with an unknown power gain. This is formulated as a unit-modulus leastsquares (ULS) problem where the optimal gain of the VGA is also designed in addition to the beamforming vector. We also consider a scenario where the receivers have the additional processing capability to adjust the phases of the incoming signals to mitigate specular multipath components. We propose efficient majorization-minimization (MM) based algorithms with convergence guarantees to a stationary point for solving both variants of the proposed ULS problem. Numerical results verify the effectiveness of the proposed solution in comparison with the existing state-of-the-art techniques.
大规模天线阵列模拟波束形成的最大化-最小化算法
大规模天线阵列波束形成是设计无线通信系统的主要操作之一。然而,全数字系统的实施显著增加了所需射频(RF)链的数量,这可能是令人望而却步的。因此,基于可变增益放大器(VGA)驱动的移相网络的模拟波束形成是一种潜在的替代技术。在本文中,我们将波束形成矢量设计问题视为波束模式匹配问题,具有未知的功率增益。这被表述为一个单位模最小二乘(ULS)问题,其中除了波束形成矢量外,还设计了VGA的最佳增益。我们还考虑了一种场景,其中接收器具有额外的处理能力来调整输入信号的相位以减轻反射多径分量。我们提出了有效的基于最大化最小化(MM)的算法,该算法具有收敛到平稳点的保证,用于解决所提出的ULS问题的两个变体。数值结果验证了该方法的有效性,并与现有的先进技术进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信