Due to the requirement of anti-interception and the limitation of processing capability of the fusion center, the subarray selection is very important for the distributed multiple-input multiple-output(MIMO) radar sys...Due to the requirement of anti-interception and the limitation of processing capability of the fusion center, the subarray selection is very important for the distributed multiple-input multiple-output(MIMO) radar system, especially in the hostile environment. In such conditions, an efficient subarray selection strategy is proposed for MIMO radar performing tasks of target tracking and detection. The goal of the proposed strategy is to minimize the worst-case predicted posterior Cramer-Rao lower bound(PCRLB) while maximizing the detection probability for a certain region. It is shown that the subarray selection problem is NP-hard, and a modified particle swarm optimization(MPSO) algorithm is developed as the solution strategy. A large number of simulations verify that the MPSO can provide close performance to the exhaustive search(ES) algorithm. Furthermore, the MPSO has the advantages of simpler structure and lower computational complexity than the multi-start local search algorithm.展开更多
An antenna adjustment strategy is developed for the target tracking problem in the collocated multiple-input multipleoutput(MIMO)radar.The basic technique of this strategy is to optimally allocate antennas by the prio...An antenna adjustment strategy is developed for the target tracking problem in the collocated multiple-input multipleoutput(MIMO)radar.The basic technique of this strategy is to optimally allocate antennas by the prior information in the tracking recursive period,with the objective of enhancing the worst-case estimate precision of multiple targets.On account of the posterior Cramer-Rao lower bound(PCRLB)offering a quantitative measure for target tracking accuracy,the PCRLB of joint direction-of-arrival(DOA)and Doppler is derived and utilized as the optimization criterion.It is shown that the dynamic antenna selection problem is NP-hard,and an efficient technique which combines convex relaxation with local search is put forward as the solution.Simulation results demonstrate the outperformance of the proposed strategy to the fixed antenna configuration and heuristic search algorithm.Moreover,it is able to offer close-to performance of the exhaustive search method.展开更多
基金supported by the National Natural Science Foundation of China(61601504)。
文摘Due to the requirement of anti-interception and the limitation of processing capability of the fusion center, the subarray selection is very important for the distributed multiple-input multiple-output(MIMO) radar system, especially in the hostile environment. In such conditions, an efficient subarray selection strategy is proposed for MIMO radar performing tasks of target tracking and detection. The goal of the proposed strategy is to minimize the worst-case predicted posterior Cramer-Rao lower bound(PCRLB) while maximizing the detection probability for a certain region. It is shown that the subarray selection problem is NP-hard, and a modified particle swarm optimization(MPSO) algorithm is developed as the solution strategy. A large number of simulations verify that the MPSO can provide close performance to the exhaustive search(ES) algorithm. Furthermore, the MPSO has the advantages of simpler structure and lower computational complexity than the multi-start local search algorithm.
基金supported by the National Natural Science Foundation of China(61601504)
文摘An antenna adjustment strategy is developed for the target tracking problem in the collocated multiple-input multipleoutput(MIMO)radar.The basic technique of this strategy is to optimally allocate antennas by the prior information in the tracking recursive period,with the objective of enhancing the worst-case estimate precision of multiple targets.On account of the posterior Cramer-Rao lower bound(PCRLB)offering a quantitative measure for target tracking accuracy,the PCRLB of joint direction-of-arrival(DOA)and Doppler is derived and utilized as the optimization criterion.It is shown that the dynamic antenna selection problem is NP-hard,and an efficient technique which combines convex relaxation with local search is put forward as the solution.Simulation results demonstrate the outperformance of the proposed strategy to the fixed antenna configuration and heuristic search algorithm.Moreover,it is able to offer close-to performance of the exhaustive search method.
