Explicit entropy error bound for compressive DOA estimation in sensor array

IF 2.9 3区 工程技术 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC Digital Signal Processing Pub Date : 2024-09-19 DOI:10.1016/j.dsp.2024.104785
Nan Wang , Han Zhang , Xiaolong Kong , Dazhuan Xu
{"title":"Explicit entropy error bound for compressive DOA estimation in sensor array","authors":"Nan Wang ,&nbsp;Han Zhang ,&nbsp;Xiaolong Kong ,&nbsp;Dazhuan Xu","doi":"10.1016/j.dsp.2024.104785","DOIUrl":null,"url":null,"abstract":"<div><div>Compressive sensing (CS) simplifies software and hardware by sampling below the Nyquist rate, making it widely used in array signal processing. For the assessment of the compressive direction-of-arrival (DOA) estimation, a lower bound on the mean square error is essential. However, the most widely utilized Cramér-Rao bound (CRB) is only asymptotically tight. This paper proposes a globally tight bound with a closed-form expression for compressive DOA estimation in the uniform linear arrays employing Shannon information theory. Based on the <em>a posteriori</em> probability density function, we propose the indicator of the entropy error (EE) with compression to assess the DOA estimation. The theoretical EE bounds the compressive DOA estimation performance. Moreover, the explicit EE is derived by approximating the normalized differential entropy, which is comprehensive and captures the effect of the compression ratio, the SNR, the number of elements, and the mean square bandwidth. In Particular, the compression ratio has almost no influence on the EE in low SNR. Additionally, the asymptotic lower bound of the theoretical EE is identical to the CRB. Simulation results illustrate the superiority of EE over CRB in evaluating and predicting compressive DOA estimation performance in the uniform linear arrays.</div></div>","PeriodicalId":51011,"journal":{"name":"Digital Signal Processing","volume":"156 ","pages":"Article 104785"},"PeriodicalIF":2.9000,"publicationDate":"2024-09-19","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/S105120042400410X","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

Compressive sensing (CS) simplifies software and hardware by sampling below the Nyquist rate, making it widely used in array signal processing. For the assessment of the compressive direction-of-arrival (DOA) estimation, a lower bound on the mean square error is essential. However, the most widely utilized Cramér-Rao bound (CRB) is only asymptotically tight. This paper proposes a globally tight bound with a closed-form expression for compressive DOA estimation in the uniform linear arrays employing Shannon information theory. Based on the a posteriori probability density function, we propose the indicator of the entropy error (EE) with compression to assess the DOA estimation. The theoretical EE bounds the compressive DOA estimation performance. Moreover, the explicit EE is derived by approximating the normalized differential entropy, which is comprehensive and captures the effect of the compression ratio, the SNR, the number of elements, and the mean square bandwidth. In Particular, the compression ratio has almost no influence on the EE in low SNR. Additionally, the asymptotic lower bound of the theoretical EE is identical to the CRB. Simulation results illustrate the superiority of EE over CRB in evaluating and predicting compressive DOA estimation performance in the uniform linear arrays.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
传感器阵列中压缩 DOA 估计的显式熵误差约束
压缩传感(CS)通过低于奈奎斯特速率的采样简化了软件和硬件,因此在阵列信号处理中得到了广泛应用。对于压缩到达方向(DOA)估计的评估,均方误差的下限至关重要。然而,最广泛使用的克拉梅尔-拉奥约束(CRB)只是渐近紧密的。本文利用香农信息论,为均匀线性阵列中的压缩 DOA 估计提出了一个具有闭式表达的全局紧约束。基于后验概率密度函数,我们提出了压缩熵误差(EE)指标来评估 DOA 估计。理论 EE 对压缩 DOA 估计性能进行了约束。此外,显式 EE 是通过近似归一化差分熵得出的,它很全面,能捕捉到压缩比、信噪比、元素数和均方带宽的影响。特别是在低信噪比情况下,压缩比对熵几乎没有影响。此外,理论 EE 的渐进下限与 CRB 相同。仿真结果表明,在评估和预测均匀线性阵列中的压缩 DOA 估计性能时,EE 优于 CRB。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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,
期刊最新文献
Adaptive polarimetric persymmetric detection for distributed subspace targets in lognormal texture clutter MFFR-net: Multi-scale feature fusion and attentive recalibration network for deep neural speech enhancement PV-YOLO: A lightweight pedestrian and vehicle detection model based on improved YOLOv8 Efficient recurrent real video restoration IGGCN: Individual-guided graph convolution network for pedestrian trajectory prediction
×
引用
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