基于组合-无频带-发射机-接收机在线选择的非稳态信道分布式多输入多输出雷达

IF 3.4 2区 工程技术 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC
Yuhang Hao , Zengfu Wang , Jing Fu , Xianglong Bai , Can Li , Quan Pan
{"title":"基于组合-无频带-发射机-接收机在线选择的非稳态信道分布式多输入多输出雷达","authors":"Yuhang Hao ,&nbsp;Zengfu Wang ,&nbsp;Jing Fu ,&nbsp;Xianglong Bai ,&nbsp;Can Li ,&nbsp;Quan Pan","doi":"10.1016/j.sigpro.2024.109707","DOIUrl":null,"url":null,"abstract":"<div><p>In a distributed multiple-input multiple-output (MIMO) radar for tracking moving targets, optimizing sensible selections of the transmitter–receiver pairs is crucial for maximizing the sum of signal-to-interference-plus-noise ratios (SINRs), as it directly affects the tracking accuracy. In solving the trade-off between exploitation and exploration in non-stationary channels, the optimization problem is modeled by a restless multi-armed bandits model. This paper regards the estimated SINR mean reward as the state of an arm (transceiver channel). The SINR reward of each arm is estimated based on whether it is probed. A closed loop is established between SINR rewards and the dynamic states of targets, which are estimated via the interacting multiple model-unscented Kalman filter. The combinatorial optimized selection of transmitter–receiver pairs at each time is accomplished by using the binary particle swarm optimization with the SINR index fitness function, where the index represents the upper bound on the confidence of the SINR reward. Above all, a multi-group combinatorial-restless-bandit closed-loop (MG-CRB-CL) algorithm is proposed. Simulation results for different scenarios are provided to verify the effectiveness and superior performance of MG-CRB-CL.</p></div>","PeriodicalId":49523,"journal":{"name":"Signal Processing","volume":"227 ","pages":"Article 109707"},"PeriodicalIF":3.4000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Combinatorial-restless-bandit-based transmitter–receiver online selection of distributed MIMO radar with non-stationary channels\",\"authors\":\"Yuhang Hao ,&nbsp;Zengfu Wang ,&nbsp;Jing Fu ,&nbsp;Xianglong Bai ,&nbsp;Can Li ,&nbsp;Quan Pan\",\"doi\":\"10.1016/j.sigpro.2024.109707\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In a distributed multiple-input multiple-output (MIMO) radar for tracking moving targets, optimizing sensible selections of the transmitter–receiver pairs is crucial for maximizing the sum of signal-to-interference-plus-noise ratios (SINRs), as it directly affects the tracking accuracy. In solving the trade-off between exploitation and exploration in non-stationary channels, the optimization problem is modeled by a restless multi-armed bandits model. This paper regards the estimated SINR mean reward as the state of an arm (transceiver channel). The SINR reward of each arm is estimated based on whether it is probed. A closed loop is established between SINR rewards and the dynamic states of targets, which are estimated via the interacting multiple model-unscented Kalman filter. The combinatorial optimized selection of transmitter–receiver pairs at each time is accomplished by using the binary particle swarm optimization with the SINR index fitness function, where the index represents the upper bound on the confidence of the SINR reward. Above all, a multi-group combinatorial-restless-bandit closed-loop (MG-CRB-CL) algorithm is proposed. Simulation results for different scenarios are provided to verify the effectiveness and superior performance of MG-CRB-CL.</p></div>\",\"PeriodicalId\":49523,\"journal\":{\"name\":\"Signal Processing\",\"volume\":\"227 \",\"pages\":\"Article 109707\"},\"PeriodicalIF\":3.4000,\"publicationDate\":\"2024-09-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Signal Processing\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S016516842400327X\",\"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":"Signal Processing","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S016516842400327X","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

在用于跟踪移动目标的分布式多输入多输出(MIMO)雷达中,优化发射机-接收机对的合理选择对于最大化信号-干扰-噪声比(SINRs)之和至关重要,因为它直接影响跟踪精度。在解决非稳态信道中开发与探索之间的权衡问题时,优化问题被建模为一个不安分的多臂强盗模型。本文将估计的 SINR 平均奖励视为一个臂(收发信机信道)的状态。每个臂的 SINR 报酬根据其是否被探测来估算。SINR 奖励与目标的动态状态之间建立了一个闭环,目标的动态状态是通过交互式多模型无cented 卡尔曼滤波器估算出来的。每次发射机和接收机对的组合优化选择是通过二元粒子群优化和 SINR 指数拟合函数完成的,其中指数代表 SINR 奖励的置信度上限。此外,还提出了一种多组组合-无频带闭环(MG-CRB-CL)算法。针对不同场景的仿真结果验证了 MG-CRB-CL 的有效性和优越性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Combinatorial-restless-bandit-based transmitter–receiver online selection of distributed MIMO radar with non-stationary channels

In a distributed multiple-input multiple-output (MIMO) radar for tracking moving targets, optimizing sensible selections of the transmitter–receiver pairs is crucial for maximizing the sum of signal-to-interference-plus-noise ratios (SINRs), as it directly affects the tracking accuracy. In solving the trade-off between exploitation and exploration in non-stationary channels, the optimization problem is modeled by a restless multi-armed bandits model. This paper regards the estimated SINR mean reward as the state of an arm (transceiver channel). The SINR reward of each arm is estimated based on whether it is probed. A closed loop is established between SINR rewards and the dynamic states of targets, which are estimated via the interacting multiple model-unscented Kalman filter. The combinatorial optimized selection of transmitter–receiver pairs at each time is accomplished by using the binary particle swarm optimization with the SINR index fitness function, where the index represents the upper bound on the confidence of the SINR reward. Above all, a multi-group combinatorial-restless-bandit closed-loop (MG-CRB-CL) algorithm is proposed. Simulation results for different scenarios are provided to verify the effectiveness and superior performance of MG-CRB-CL.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Signal Processing
Signal Processing 工程技术-工程:电子与电气
CiteScore
9.20
自引率
9.10%
发文量
309
审稿时长
41 days
期刊介绍: Signal Processing incorporates all aspects of the theory and practice of signal processing. It features original research work, tutorial and review articles, and accounts of practical developments. It is intended for a rapid dissemination of knowledge and experience to engineers and scientists working in the research, development or practical application of signal processing. Subject areas covered by the journal include: Signal Theory; Stochastic Processes; Detection and Estimation; Spectral Analysis; Filtering; Signal Processing Systems; Software Developments; Image Processing; Pattern Recognition; Optical Signal Processing; Digital Signal Processing; Multi-dimensional Signal Processing; Communication Signal Processing; Biomedical Signal Processing; Geophysical and Astrophysical Signal Processing; Earth Resources Signal Processing; Acoustic and Vibration Signal Processing; Data Processing; Remote Sensing; Signal Processing Technology; Radar Signal Processing; Sonar Signal Processing; Industrial Applications; New Applications.
×
引用
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学术官方微信