A modified PUMA/EPUMA for direction-of-arrival estimation of coherent sources

IF 3 3区 工程技术 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC Digital Signal Processing Pub Date : 2025-01-02 DOI:10.1016/j.dsp.2024.104967
Diyuan Xu , Yide Wang , Biyun Ma , Qingqing Zhu , Julien Sarrazin
{"title":"A modified PUMA/EPUMA for direction-of-arrival estimation of coherent sources","authors":"Diyuan Xu ,&nbsp;Yide Wang ,&nbsp;Biyun Ma ,&nbsp;Qingqing Zhu ,&nbsp;Julien Sarrazin","doi":"10.1016/j.dsp.2024.104967","DOIUrl":null,"url":null,"abstract":"<div><div>The principal-singular-vector utilization modal analysis (PUMA) related algorithms have been proposed to address the problem of insufficient robustness of the method of direction estimation (MODE) related algorithms, which are sensitive to the parity of the number of sources due to the additional assumption and constraints on the symmetry of the root polynomial coefficients. Moreover, the MODE-related algorithms do not have severe performance degradation when the source covariance matrix is rank deficient, however, the initial PUMA-related algorithms will have a degraded performance under such circumstances. The initial PUMA is developed using a full rank source covariance matrix hypothesis, which is not valid for coherent sources. In this paper, a rigorous extension of the PUMA and enhanced-PUMA (EPUMA) is proposed to handle the case where the source covariance matrix may be rank deficient. The modified PUMA/EPUMA (Mod-PUMA/EPUMA) can be applied rigorously in the case of multiple coherent sources. In addition, it has lower computational complexity and faster convergence than the initial PUMA/EPUMA. The effectiveness of the Mod-PUMA/EPUMA is shown by experimental comparison with the initial PUMA-related algorithms and MODE-related algorithms.</div></div>","PeriodicalId":51011,"journal":{"name":"Digital Signal Processing","volume":"158 ","pages":"Article 104967"},"PeriodicalIF":3.0000,"publicationDate":"2025-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Digital Signal Processing","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1051200424005918","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

The principal-singular-vector utilization modal analysis (PUMA) related algorithms have been proposed to address the problem of insufficient robustness of the method of direction estimation (MODE) related algorithms, which are sensitive to the parity of the number of sources due to the additional assumption and constraints on the symmetry of the root polynomial coefficients. Moreover, the MODE-related algorithms do not have severe performance degradation when the source covariance matrix is rank deficient, however, the initial PUMA-related algorithms will have a degraded performance under such circumstances. The initial PUMA is developed using a full rank source covariance matrix hypothesis, which is not valid for coherent sources. In this paper, a rigorous extension of the PUMA and enhanced-PUMA (EPUMA) is proposed to handle the case where the source covariance matrix may be rank deficient. The modified PUMA/EPUMA (Mod-PUMA/EPUMA) can be applied rigorously in the case of multiple coherent sources. In addition, it has lower computational complexity and faster convergence than the initial PUMA/EPUMA. The effectiveness of the Mod-PUMA/EPUMA is shown by experimental comparison with the initial PUMA-related algorithms and MODE-related algorithms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
相干源到达方向估计的改进PUMA/EPUMA
针对方向估计(MODE)相关算法由于对根多项式系数的对称性附加假设和约束而对源数奇偶性敏感的问题,提出了主-奇异-矢量利用模态分析(PUMA)相关算法。此外,当源协方差矩阵秩不足时,mode相关算法不会出现严重的性能下降,而初始puma相关算法在这种情况下会出现性能下降。初始PUMA是使用全秩源协方差矩阵假设开发的,该假设对相干源无效。本文针对源协方差矩阵可能是秩亏的情况,提出了PUMA和增强PUMA (EPUMA)的严格扩展。改进后的PUMA/EPUMA (mode -PUMA/EPUMA)可以在多相干源的情况下严格应用。与初始的PUMA/EPUMA相比,具有较低的计算复杂度和较快的收敛速度。通过与初始puma相关算法和mode相关算法的实验对比,验证了Mod-PUMA/EPUMA算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Digital Signal Processing
Digital Signal Processing 工程技术-工程:电子与电气
CiteScore
5.30
自引率
17.20%
发文量
435
审稿时长
66 days
期刊介绍: Digital Signal Processing: A Review Journal is one of the oldest and most established journals in the field of signal processing yet it aims to be the most innovative. The Journal invites top quality research articles at the frontiers of research in all aspects of signal processing. Our objective is to provide a platform for the publication of ground-breaking research in signal processing with both academic and industrial appeal. The journal has a special emphasis on statistical signal processing methodology such as Bayesian signal processing, and encourages articles on emerging applications of signal processing such as: • big data• machine learning• internet of things• information security• systems biology and computational biology,• financial time series analysis,• autonomous vehicles,• quantum computing,• neuromorphic engineering,• human-computer interaction and intelligent user interfaces,• environmental signal processing,• geophysical signal processing including seismic signal processing,• chemioinformatics and bioinformatics,• audio, visual and performance arts,• disaster management and prevention,• renewable energy,
期刊最新文献
Zero-reference illumination estimation model for image enhancement in underground mines Lightweight speech enhancement with state-space model and depthwise separable convolution A visual security image encryption algorithm based on 1D-CHCCM and super-resolution reconstruction No-reference magnetic resonance image quality assessment via local-global feature integration Low Complexity estimation of fractional delay-Doppler-Angle parameters in MIMO-OTFS ISAC system
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1