Real-Valued Arithmetic Linearly-Constrained Beamforming in Symmetric Adaptive Arrays

V. Djigan
{"title":"Real-Valued Arithmetic Linearly-Constrained Beamforming in Symmetric Adaptive Arrays","authors":"V. Djigan","doi":"10.1109/SIBCON50419.2021.9438854","DOIUrl":null,"url":null,"abstract":"This paper presents computational procedures of two adaptive filtering algorithms for antenna arrays with odd symmetry. The algorithms are designed for the antenna arrays of radio systems, which receive information signals below the thermal noise. The linearly constrained versions of the algorithms without desired signal are often used in this scenario. The constraints are imposed onto the adaptive filtering algorithms to protect the distortion of main lobe of the antenna array radiation pattern. In the case of the antenna array with odd symmetry, it is possible to modify Toeplitz correlation matrix of the received signals to the persymmetric one and to obtain the adaptive filtering algorithms, which have the most of calculations in real-valued arithmetic. This allows to decrease the computational complexity of the algorithms and to improve the steady-state performance of the adaptive antenna array. The considered algorithms are the Linearly Constrained Recursive Least Squares and the Least Mean Square ones. The simulation example demonstrates the performance of a circular adaptive antenna array, which uses these algorithms for the weight calculation and spatial filtering of the incoming signals.","PeriodicalId":150550,"journal":{"name":"2021 International Siberian Conference on Control and Communications (SIBCON)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Siberian Conference on Control and Communications (SIBCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIBCON50419.2021.9438854","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper presents computational procedures of two adaptive filtering algorithms for antenna arrays with odd symmetry. The algorithms are designed for the antenna arrays of radio systems, which receive information signals below the thermal noise. The linearly constrained versions of the algorithms without desired signal are often used in this scenario. The constraints are imposed onto the adaptive filtering algorithms to protect the distortion of main lobe of the antenna array radiation pattern. In the case of the antenna array with odd symmetry, it is possible to modify Toeplitz correlation matrix of the received signals to the persymmetric one and to obtain the adaptive filtering algorithms, which have the most of calculations in real-valued arithmetic. This allows to decrease the computational complexity of the algorithms and to improve the steady-state performance of the adaptive antenna array. The considered algorithms are the Linearly Constrained Recursive Least Squares and the Least Mean Square ones. The simulation example demonstrates the performance of a circular adaptive antenna array, which uses these algorithms for the weight calculation and spatial filtering of the incoming signals.
对称自适应阵列中的实值算法线性约束波束形成
本文给出了奇对称天线阵的两种自适应滤波算法的计算过程。该算法是为接收低于热噪声的信息信号的无线电系统天线阵列设计的。在这种情况下,通常使用没有期望信号的算法的线性约束版本。为了保护天线阵列辐射方向图主瓣畸变,对自适应滤波算法进行了约束。对于奇对称天线阵列,可以将接收信号的Toeplitz相关矩阵修改为超对称的Toeplitz相关矩阵,从而得到实数算法中计算量最多的自适应滤波算法。这样可以降低算法的计算复杂度,提高自适应天线阵列的稳态性能。所考虑的算法是线性约束递归最小二乘法和最小均二乘法。仿真实例验证了圆形自适应天线阵列的性能,该阵列使用这些算法对输入信号进行权值计算和空间滤波。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信