DOA Estimation Based on a Sparsity Pre-estimation Adaptive Matching Pursuit Algorithm

Huijing Dou, Dongxu Xie, W. Guo
{"title":"DOA Estimation Based on a Sparsity Pre-estimation Adaptive Matching Pursuit Algorithm","authors":"Huijing Dou, Dongxu Xie, W. Guo","doi":"10.1145/3581807.3581863","DOIUrl":null,"url":null,"abstract":"The traditional subspace class algorithm has low or even no estimation accuracy for DOA estimation under the conditions of less number of snapshots, low SNR and source coherence. Therefore, the application of compressed sensing theory in DOA estimation is studied in this paper. To address the problems of poor estimation accuracy of sparsity adaptive matching Pursuit(SAMP) algorithm in noisy environment and the need to gradually approximate the true sparsity from zero, a sparsity pre-estimation adaptive matching Pursuit(SPAMP) algorithm is proposed in this paper . The algorithm in this paper optimizes the iterative termination conditions of the algorithm by using the changing rules of iterative residuals, and at the same time approximates the source sparsity quickly and accurately by pre-estimating the initial sparsity.. The simulation results show that the algorithm in this paper has the advantages of high estimation accuracy, fast operation speed and better noise immunity, which promotes further integration of compressed sensing and DOA estimation in practical situations.","PeriodicalId":292813,"journal":{"name":"Proceedings of the 2022 11th International Conference on Computing and Pattern Recognition","volume":"358 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2022 11th International Conference on Computing and Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3581807.3581863","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The traditional subspace class algorithm has low or even no estimation accuracy for DOA estimation under the conditions of less number of snapshots, low SNR and source coherence. Therefore, the application of compressed sensing theory in DOA estimation is studied in this paper. To address the problems of poor estimation accuracy of sparsity adaptive matching Pursuit(SAMP) algorithm in noisy environment and the need to gradually approximate the true sparsity from zero, a sparsity pre-estimation adaptive matching Pursuit(SPAMP) algorithm is proposed in this paper . The algorithm in this paper optimizes the iterative termination conditions of the algorithm by using the changing rules of iterative residuals, and at the same time approximates the source sparsity quickly and accurately by pre-estimating the initial sparsity.. The simulation results show that the algorithm in this paper has the advantages of high estimation accuracy, fast operation speed and better noise immunity, which promotes further integration of compressed sensing and DOA estimation in practical situations.
基于稀疏预估计自适应匹配跟踪算法的DOA估计
传统的子空间类算法在快照个数少、信噪比低、信源相干性低等条件下,对DOA估计精度低,甚至没有估计精度。因此,本文对压缩感知理论在DOA估计中的应用进行了研究。针对稀疏自适应匹配追踪(SAMP)算法在噪声环境下估计精度差,需要从零逐渐逼近真实稀疏度的问题,提出了稀疏预估计自适应匹配追踪(SPAMP)算法。本文算法利用迭代残差的变化规律来优化算法的迭代终止条件,同时通过预估初始稀疏度来快速准确地逼近源稀疏度。仿真结果表明,本文算法具有估计精度高、运算速度快、抗噪声能力强等优点,可促进压缩感知与DOA估计在实际应用中的进一步融合。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信