用简化的零定位算法提高波束形成器的跟踪速度

Shaowei Dai, Minghui Li, Q. Abbasi, M. Imran
{"title":"用简化的零定位算法提高波束形成器的跟踪速度","authors":"Shaowei Dai, Minghui Li, Q. Abbasi, M. Imran","doi":"10.1109/IEEE-IWS.2019.8804154","DOIUrl":null,"url":null,"abstract":"This paper presents a new structure and algorithm to improve the tracking speed of a Generalized Sidelobe Canceler (GSC) based adaptive beamformer. Iterative methods like Conjugate Gradient algorithm to calculate the beamformer weight vector eliminates the complexity of Matrix reversing. But the reduced complexity comes with time cost which requires iterations of calculation before converging to the desired direction. To combat the problem, a Simplified Zero Placement algorithm is proposed to set the initial weight vector to make the starting value near the optimum location of weight vector. Numerical simulation and analysis confirms the effectiveness of the proposed solution.","PeriodicalId":306297,"journal":{"name":"2019 IEEE MTT-S International Wireless Symposium (IWS)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Improve Tracking Speed of Beamformer With Simplified Zero Placement Algorithm\",\"authors\":\"Shaowei Dai, Minghui Li, Q. Abbasi, M. Imran\",\"doi\":\"10.1109/IEEE-IWS.2019.8804154\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new structure and algorithm to improve the tracking speed of a Generalized Sidelobe Canceler (GSC) based adaptive beamformer. Iterative methods like Conjugate Gradient algorithm to calculate the beamformer weight vector eliminates the complexity of Matrix reversing. But the reduced complexity comes with time cost which requires iterations of calculation before converging to the desired direction. To combat the problem, a Simplified Zero Placement algorithm is proposed to set the initial weight vector to make the starting value near the optimum location of weight vector. Numerical simulation and analysis confirms the effectiveness of the proposed solution.\",\"PeriodicalId\":306297,\"journal\":{\"name\":\"2019 IEEE MTT-S International Wireless Symposium (IWS)\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE MTT-S International Wireless Symposium (IWS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IEEE-IWS.2019.8804154\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE MTT-S International Wireless Symposium (IWS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEEE-IWS.2019.8804154","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文提出了一种新的结构和算法来提高基于广义旁瓣抵消(GSC)的自适应波束形成器的跟踪速度。采用共轭梯度算法等迭代方法计算波束形成器权向量,消除了矩阵反转的复杂性。但是复杂性的降低伴随着时间成本,在收敛到期望的方向之前需要进行迭代计算。为了解决这一问题,提出了一种简化的置零算法来设置初始权向量,使起始值接近权向量的最优位置。数值仿真和分析验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Improve Tracking Speed of Beamformer With Simplified Zero Placement Algorithm
This paper presents a new structure and algorithm to improve the tracking speed of a Generalized Sidelobe Canceler (GSC) based adaptive beamformer. Iterative methods like Conjugate Gradient algorithm to calculate the beamformer weight vector eliminates the complexity of Matrix reversing. But the reduced complexity comes with time cost which requires iterations of calculation before converging to the desired direction. To combat the problem, a Simplified Zero Placement algorithm is proposed to set the initial weight vector to make the starting value near the optimum location of weight vector. Numerical simulation and analysis confirms the effectiveness of the proposed solution.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信