基于块正交最小二乘的多基地MIMO雷达多目标定位

IF 3.2 2区 工程技术 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC
Martin Willame;Gilles Monnoyer;Hasan Can Yildirim;François Horlin;Jérôme Louveaux
{"title":"基于块正交最小二乘的多基地MIMO雷达多目标定位","authors":"Martin Willame;Gilles Monnoyer;Hasan Can Yildirim;François Horlin;Jérôme Louveaux","doi":"10.1109/LSP.2025.3565168","DOIUrl":null,"url":null,"abstract":"Recently, there has been a growing interest in multistatic radar configurations to improve the localization of multiple targets. Theoretically, the maximum likelihood (ML) approach enables to fuse the information provided by each radar pair to localize the different targets. However, it involves a multi-dimensional search process whose complexity exponentially grows with the number of targets. Consequently, heuristic methods, notably including the block orthogonal matching pursuit (BOMP), have been used in the multistatic radar context to approach the ML estimation greedily. Interestingly, the more accurate block orthogonal least squares (BOLS) method has not been studied in this context because the performance improvement is usually low in regard to its computational complexity. In this work, we investigate the application of BOLS to an angle-based localization of multiple targets using a multistatic multiple-input and multiple-output (MIMO) radar. First, an efficient implementation of BOLS is presented reducing its computational complexity. Then, using Monte Carlo simulations, we show evidence of the significant advantage of this efficient implementation of BOLS over BOMP in this scenario featuring highly correlated signals. The impact of radar parameters on the localization root mean square error and on the computational complexity of both algorithms is studied.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"1990-1994"},"PeriodicalIF":3.2000,"publicationDate":"2025-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi Target Localization With Block Orthogonal Least Squares for Multistatic MIMO Radars\",\"authors\":\"Martin Willame;Gilles Monnoyer;Hasan Can Yildirim;François Horlin;Jérôme Louveaux\",\"doi\":\"10.1109/LSP.2025.3565168\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, there has been a growing interest in multistatic radar configurations to improve the localization of multiple targets. Theoretically, the maximum likelihood (ML) approach enables to fuse the information provided by each radar pair to localize the different targets. However, it involves a multi-dimensional search process whose complexity exponentially grows with the number of targets. Consequently, heuristic methods, notably including the block orthogonal matching pursuit (BOMP), have been used in the multistatic radar context to approach the ML estimation greedily. Interestingly, the more accurate block orthogonal least squares (BOLS) method has not been studied in this context because the performance improvement is usually low in regard to its computational complexity. In this work, we investigate the application of BOLS to an angle-based localization of multiple targets using a multistatic multiple-input and multiple-output (MIMO) radar. First, an efficient implementation of BOLS is presented reducing its computational complexity. Then, using Monte Carlo simulations, we show evidence of the significant advantage of this efficient implementation of BOLS over BOMP in this scenario featuring highly correlated signals. The impact of radar parameters on the localization root mean square error and on the computational complexity of both algorithms is studied.\",\"PeriodicalId\":13154,\"journal\":{\"name\":\"IEEE Signal Processing Letters\",\"volume\":\"32 \",\"pages\":\"1990-1994\"},\"PeriodicalIF\":3.2000,\"publicationDate\":\"2025-04-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Signal Processing Letters\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10979421/\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Signal Processing Letters","FirstCategoryId":"5","ListUrlMain":"https://ieeexplore.ieee.org/document/10979421/","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

最近,人们对多基地雷达配置的兴趣越来越大,以提高多目标的定位。从理论上讲,最大似然(ML)方法能够融合每对雷达提供的信息来定位不同的目标。然而,它涉及到一个多维搜索过程,其复杂性随着目标数量的增加呈指数增长。因此,在多基地雷达环境下,启发式方法,特别是块正交匹配追踪(BOMP),被用于贪婪地接近机器学习估计。有趣的是,更精确的块正交最小二乘(bol)方法尚未在此背景下进行研究,因为其性能改进通常与计算复杂度有关。在这项工作中,我们研究了波士在多静态多输入多输出(MIMO)雷达中基于角度的多目标定位中的应用。首先,提出了一种有效的波士算法,降低了波士算法的计算复杂度。然后,使用蒙特卡罗模拟,我们证明了在这种具有高度相关信号的场景中,这种有效的bol实现比BOMP具有显著的优势。研究了雷达参数对定位均方根误差和两种算法计算复杂度的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi Target Localization With Block Orthogonal Least Squares for Multistatic MIMO Radars
Recently, there has been a growing interest in multistatic radar configurations to improve the localization of multiple targets. Theoretically, the maximum likelihood (ML) approach enables to fuse the information provided by each radar pair to localize the different targets. However, it involves a multi-dimensional search process whose complexity exponentially grows with the number of targets. Consequently, heuristic methods, notably including the block orthogonal matching pursuit (BOMP), have been used in the multistatic radar context to approach the ML estimation greedily. Interestingly, the more accurate block orthogonal least squares (BOLS) method has not been studied in this context because the performance improvement is usually low in regard to its computational complexity. In this work, we investigate the application of BOLS to an angle-based localization of multiple targets using a multistatic multiple-input and multiple-output (MIMO) radar. First, an efficient implementation of BOLS is presented reducing its computational complexity. Then, using Monte Carlo simulations, we show evidence of the significant advantage of this efficient implementation of BOLS over BOMP in this scenario featuring highly correlated signals. The impact of radar parameters on the localization root mean square error and on the computational complexity of both algorithms is studied.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Signal Processing Letters
IEEE Signal Processing Letters 工程技术-工程:电子与电气
CiteScore
7.40
自引率
12.80%
发文量
339
审稿时长
2.8 months
期刊介绍: The IEEE Signal Processing Letters is a monthly, archival publication designed to provide rapid dissemination of original, cutting-edge ideas and timely, significant contributions in signal, image, speech, language and audio processing. Papers published in the Letters can be presented within one year of their appearance in signal processing conferences such as ICASSP, GlobalSIP and ICIP, and also in several workshop organized by the Signal Processing Society.
×
引用
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学术官方微信