Ruilin Chen;Shisheng Guo;Jiahui Chen;Xingyu Gu;Guolong Cui;Lingjiang Kong;Weijian Liu
{"title":"分布式多输入多输出雷达的低复杂度多目标探测和定位方法","authors":"Ruilin Chen;Shisheng Guo;Jiahui Chen;Xingyu Gu;Guolong Cui;Lingjiang Kong;Weijian Liu","doi":"10.1109/TRS.2025.3554198","DOIUrl":null,"url":null,"abstract":"Direct position determination (DPD) for multiple targets in distributed multiple-input multiple-output (MIMO) radar has been a challenging problem. This article proposed a low-complexity multitarget detection and localization method for distributed MIMO radar. To address the problem of exponential expansion of the state space caused by high-dimensional detection in traditional DPD, a low-dimensional detector is proposed. Specifically, we divide the radar-sensed scene into discrete 2-D grid cells and derive the maximum likelihood estimation (MLE) function as well as the generalized likelihood ratio test (GLRT) detector in the 2-D scene. In addition, the probability of a false alarm (PFA) for the derived GLRT detector has an analytic solution, ensuring each grid cell maintains a constant PFA. Since the proposed detector introduces a large number of false targets, we further propose the clean with protected cells (CPCs) algorithm to remove false targets and localize real targets. This method generates protection points based on the relationship between the real targets and the radar channels, achieving high-accuracy localization with low computational complexity, even in scenes with inseparable targets. Finally, both numerical simulations and experimental data demonstrate the effectiveness of the proposed method. Simulation results show that the proposed method achieves the best detection performance compared to state-of-the-art methods, with an average processing time of only 565.7 ms, meeting the requirements for real-time target detection and localization.","PeriodicalId":100645,"journal":{"name":"IEEE Transactions on Radar Systems","volume":"3 ","pages":"599-614"},"PeriodicalIF":0.0000,"publicationDate":"2025-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Low-Complexity Multitarget Detection and Localization Method for Distributed MIMO Radar\",\"authors\":\"Ruilin Chen;Shisheng Guo;Jiahui Chen;Xingyu Gu;Guolong Cui;Lingjiang Kong;Weijian Liu\",\"doi\":\"10.1109/TRS.2025.3554198\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Direct position determination (DPD) for multiple targets in distributed multiple-input multiple-output (MIMO) radar has been a challenging problem. This article proposed a low-complexity multitarget detection and localization method for distributed MIMO radar. To address the problem of exponential expansion of the state space caused by high-dimensional detection in traditional DPD, a low-dimensional detector is proposed. Specifically, we divide the radar-sensed scene into discrete 2-D grid cells and derive the maximum likelihood estimation (MLE) function as well as the generalized likelihood ratio test (GLRT) detector in the 2-D scene. In addition, the probability of a false alarm (PFA) for the derived GLRT detector has an analytic solution, ensuring each grid cell maintains a constant PFA. Since the proposed detector introduces a large number of false targets, we further propose the clean with protected cells (CPCs) algorithm to remove false targets and localize real targets. This method generates protection points based on the relationship between the real targets and the radar channels, achieving high-accuracy localization with low computational complexity, even in scenes with inseparable targets. Finally, both numerical simulations and experimental data demonstrate the effectiveness of the proposed method. Simulation results show that the proposed method achieves the best detection performance compared to state-of-the-art methods, with an average processing time of only 565.7 ms, meeting the requirements for real-time target detection and localization.\",\"PeriodicalId\":100645,\"journal\":{\"name\":\"IEEE Transactions on Radar Systems\",\"volume\":\"3 \",\"pages\":\"599-614\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2025-03-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Radar Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10938334/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Radar Systems","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10938334/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
分布式多输入多输出(MIMO)雷达中多目标的直接定位(DPD)一直是一个具有挑战性的问题。针对分布式MIMO雷达,提出了一种低复杂度的多目标检测与定位方法。针对传统DPD中由于高维检测导致状态空间呈指数扩展的问题,提出了一种低维检测器。具体而言,我们将雷达感测场景划分为离散的二维网格单元,并推导出二维场景中的最大似然估计(MLE)函数和广义似然比检验(GLRT)检测器。此外,导出的GLRT检测器的虚警概率(PFA)具有解析解,确保每个网格单元保持恒定的PFA。由于该检测器引入了大量假目标,我们进一步提出了CPCs (clean with protection cells)算法来去除假目标并定位真实目标。该方法根据真实目标与雷达通道之间的关系生成保护点,即使在目标不可分割的场景下,也能以较低的计算复杂度实现高精度定位。最后,通过数值模拟和实验数据验证了该方法的有效性。仿真结果表明,与现有方法相比,该方法具有最佳的检测性能,平均处理时间仅为565.7 ms,满足实时目标检测和定位的要求。
Low-Complexity Multitarget Detection and Localization Method for Distributed MIMO Radar
Direct position determination (DPD) for multiple targets in distributed multiple-input multiple-output (MIMO) radar has been a challenging problem. This article proposed a low-complexity multitarget detection and localization method for distributed MIMO radar. To address the problem of exponential expansion of the state space caused by high-dimensional detection in traditional DPD, a low-dimensional detector is proposed. Specifically, we divide the radar-sensed scene into discrete 2-D grid cells and derive the maximum likelihood estimation (MLE) function as well as the generalized likelihood ratio test (GLRT) detector in the 2-D scene. In addition, the probability of a false alarm (PFA) for the derived GLRT detector has an analytic solution, ensuring each grid cell maintains a constant PFA. Since the proposed detector introduces a large number of false targets, we further propose the clean with protected cells (CPCs) algorithm to remove false targets and localize real targets. This method generates protection points based on the relationship between the real targets and the radar channels, achieving high-accuracy localization with low computational complexity, even in scenes with inseparable targets. Finally, both numerical simulations and experimental data demonstrate the effectiveness of the proposed method. Simulation results show that the proposed method achieves the best detection performance compared to state-of-the-art methods, with an average processing time of only 565.7 ms, meeting the requirements for real-time target detection and localization.