Study of Barankin bound vs Cramér-Rao bound for interferometric-like array design at low SNR

Jianhua Wang , Lucien Bacharach , Mohammed Nabil El Korso , Pascal Larzabal
{"title":"Study of Barankin bound vs Cramér-Rao bound for interferometric-like array design at low SNR","authors":"Jianhua Wang ,&nbsp;Lucien Bacharach ,&nbsp;Mohammed Nabil El Korso ,&nbsp;Pascal Larzabal","doi":"10.1016/j.sctalk.2024.100327","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, we address the antenna array design problem at low signal-to-noise ratio (SNR). The Cramér-Rao bound (CRB) is the most commonly used criterion to solve the array optimization problem due to its computing simplicity and tightness in the asymptotical region. However, there exists a threshold SNR at which the estimation variance significantly deviates from the CRB. In this case, the CRB is no longer a tight bound. To address this issue, we propose the use of the Barankin Bound (BB) on the source location and source intensity in astrometry and photometry problems as an alternative optimization criterion. BB provides a mean square error (MSE)-optimal trade-off mainlobe width and sidelobe level of beampattern. The performance of the obtained array geometries is assessed and compared by evaluating the aforementioned bounds and the mean square error (MSE) on the estimation of source location and intensity. The simulation results illustrate that the BB-based criterion provides a trade-off between increasing the estimation accuracy and reducing the ambiguity.</p></div>","PeriodicalId":101148,"journal":{"name":"Science Talks","volume":"10 ","pages":"Article 100327"},"PeriodicalIF":0.0000,"publicationDate":"2024-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772569324000355/pdfft?md5=bdade32bafdfa8f295090583763ad27c&pid=1-s2.0-S2772569324000355-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Science Talks","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2772569324000355","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we address the antenna array design problem at low signal-to-noise ratio (SNR). The Cramér-Rao bound (CRB) is the most commonly used criterion to solve the array optimization problem due to its computing simplicity and tightness in the asymptotical region. However, there exists a threshold SNR at which the estimation variance significantly deviates from the CRB. In this case, the CRB is no longer a tight bound. To address this issue, we propose the use of the Barankin Bound (BB) on the source location and source intensity in astrometry and photometry problems as an alternative optimization criterion. BB provides a mean square error (MSE)-optimal trade-off mainlobe width and sidelobe level of beampattern. The performance of the obtained array geometries is assessed and compared by evaluating the aforementioned bounds and the mean square error (MSE) on the estimation of source location and intensity. The simulation results illustrate that the BB-based criterion provides a trade-off between increasing the estimation accuracy and reducing the ambiguity.

低信噪比下类似干涉阵列设计的巴兰金边界与克拉梅尔-拉奥边界对比研究
本文探讨了低信噪比(SNR)条件下的天线阵列设计问题。Cramér-Rao 约束(CRB)是解决阵列优化问题最常用的准则,因为它在渐近区域内计算简单、严密。然而,存在一个阈值 SNR,在该阈值下,估计方差会明显偏离 CRB。在这种情况下,CRB 就不再是严密约束了。为了解决这个问题,我们建议在天体测量学和光度测量学问题中使用关于源位置和源强度的巴兰金约束(Barankin Bound,BB)作为替代优化标准。巴兰金约束提供了一个均方误差(MSE)最优的主波束宽度和侧叶水平的权衡标准。通过评估上述边界以及对源位置和强度估计的均方误差(MSE),对所获得的阵列几何图形的性能进行了评估和比较。模拟结果表明,基于 BB 的准则在提高估计精度和减少模糊性之间进行了权衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信