Adaptive linearly constrained inverse QRD-RLS beamformer for multiple jammers suppression

Chung-Yao Chang, Shiunn-Jang Chern
{"title":"Adaptive linearly constrained inverse QRD-RLS beamformer for multiple jammers suppression","authors":"Chung-Yao Chang, Shiunn-Jang Chern","doi":"10.1109/SPAWC.2001.923907","DOIUrl":null,"url":null,"abstract":"A new general linearly constrained recursive least squares (RLS) array beamforming algorithm, based on an inverse QR decomposition, is developed for multiple jammer suppression. It is known the LS weight vector can be computed without back substitution in the inverse QRD-based algorithms and is suitable to be implemented using the systolic array. Also, the problem of the unacceptable numerical performance in limited-precision environments, occurring in the \"fast\" RLS filtering algorithms, can be avoided. To document the advantage of this new constrained algorithm, performance, in terms of convergence property of the learning curve and the capability of jammer suppression, is investigated. We show that our proposed algorithm outperforms the LCLMS algorithm and the linearly constraint fast LS algorithm (LCFLS) and its robust version (LCRFSL) algorithm.","PeriodicalId":435867,"journal":{"name":"2001 IEEE Third Workshop on Signal Processing Advances in Wireless Communications (SPAWC'01). Workshop Proceedings (Cat. No.01EX471)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2001 IEEE Third Workshop on Signal Processing Advances in Wireless Communications (SPAWC'01). Workshop Proceedings (Cat. No.01EX471)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2001.923907","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

A new general linearly constrained recursive least squares (RLS) array beamforming algorithm, based on an inverse QR decomposition, is developed for multiple jammer suppression. It is known the LS weight vector can be computed without back substitution in the inverse QRD-based algorithms and is suitable to be implemented using the systolic array. Also, the problem of the unacceptable numerical performance in limited-precision environments, occurring in the "fast" RLS filtering algorithms, can be avoided. To document the advantage of this new constrained algorithm, performance, in terms of convergence property of the learning curve and the capability of jammer suppression, is investigated. We show that our proposed algorithm outperforms the LCLMS algorithm and the linearly constraint fast LS algorithm (LCFLS) and its robust version (LCRFSL) algorithm.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
自适应线性约束逆QRD-RLS波束形成器抑制多干扰
提出了一种基于QR逆分解的线性约束递推最小二乘(RLS)阵列波束形成算法。已知LS权向量在基于逆qrd的算法中无需反向替换即可计算,并且适合使用收缩数组实现。此外,还可以避免“快速”RLS滤波算法在有限精度环境下出现的不可接受的数值性能问题。为了证明这种新的约束算法的优势,从学习曲线的收敛性和干扰抑制能力方面进行了性能研究。我们的算法优于LCLMS算法和线性约束快速LS算法(LCFLS)及其鲁棒版本(LCRFSL)算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Realistic channel model considerations in UMTS downlink capacity with space-time block coding Signal detection and timing estimation via summation likelihood ratio test ESPAR antennas-based signal processing for DS-CDMA signal waveforms in ad hoc network systems New results on blind asynchronous CDMA receivers using code-constrained CMA A flexible RAKE receiver architecture for WCDMA mobile terminals
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1