Robust recursive least squares adaptive beamforming algorithm

Xin Song, Jinkuan Wang, Han Wang
{"title":"Robust recursive least squares adaptive beamforming algorithm","authors":"Xin Song, Jinkuan Wang, Han Wang","doi":"10.1109/ISCIT.2004.1412846","DOIUrl":null,"url":null,"abstract":"When adaptive arrays are applied to practical problems, the performance degradation of adaptive beamforming techniques may become even more pronounced than in ideal cases because some of the underlying assumptions on the environment, sources, or sensor array can be violated and this may cause a mismatch between the presumed and actual signal steering vectors. In fact, the performances of existing adaptive array algorithms are known to degrade substantially in the presence of even slight mismatches between the actual and presumed array responses to the desired signal. Similar types of degradation can take place when the signal array response is known precisely but the training sample size is small. On the basis of the recursive least squares (RLS) algorithm, we propose a novel approach to robust adaptive beamforming. Our robust RLS adaptive beamforming algorithm provides excellent robustness against signal steering vector mismatches and small training sample size, offers faster convergence rate, makes the mean output array SINR consistently close to the optimal one, and improves the unitary mismatch. Computer simulations demonstrate a visible performance gain of the proposed robust RLS algorithm.","PeriodicalId":237047,"journal":{"name":"IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCIT.2004.1412846","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

When adaptive arrays are applied to practical problems, the performance degradation of adaptive beamforming techniques may become even more pronounced than in ideal cases because some of the underlying assumptions on the environment, sources, or sensor array can be violated and this may cause a mismatch between the presumed and actual signal steering vectors. In fact, the performances of existing adaptive array algorithms are known to degrade substantially in the presence of even slight mismatches between the actual and presumed array responses to the desired signal. Similar types of degradation can take place when the signal array response is known precisely but the training sample size is small. On the basis of the recursive least squares (RLS) algorithm, we propose a novel approach to robust adaptive beamforming. Our robust RLS adaptive beamforming algorithm provides excellent robustness against signal steering vector mismatches and small training sample size, offers faster convergence rate, makes the mean output array SINR consistently close to the optimal one, and improves the unitary mismatch. Computer simulations demonstrate a visible performance gain of the proposed robust RLS algorithm.
鲁棒递归最小二乘自适应波束形成算法
当自适应阵列应用于实际问题时,自适应波束形成技术的性能下降可能比理想情况下更加明显,因为一些对环境、源或传感器阵列的潜在假设可能被违反,这可能导致假设和实际信号转向矢量之间的不匹配。事实上,已知现有的自适应阵列算法的性能在实际和假定的阵列响应对期望信号的轻微不匹配的情况下会大大降低。当精确地知道信号阵列响应但训练样本量很小时,也会发生类似类型的退化。在递推最小二乘算法的基础上,提出了一种鲁棒自适应波束形成的新方法。鲁棒RLS自适应波束形成算法对信号转向向量失配具有良好的鲁棒性和较小的训练样本量,收敛速度更快,使输出阵列的平均SINR始终接近最优值,改善了单一失配。计算机仿真表明,所提出的鲁棒RLS算法具有明显的性能增益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信