|
Frontiers of Information Technology & Electronic Engineering
ISSN 2095-9184 (print), ISSN 2095-9230 (online)
2022 Vol.23 No.2 P.304-316
Range estimation based on symmetry polynomial aided Chinese remainder theorem for multiple targets in a pulse Doppler radar
Abstract: To avoid Doppler ambiguity, pulse Doppler radar may operate on a high pulse repetition frequency (PRF). The use of a high PRF can, however, lead to range ambiguity in many cases. At present, the major efficient solution to solve range ambiguity is based on a waveform design scheme. It adds complexity to a radar system. However, the traditional multiple-PRF-based scheme is difficult to be applied in multiple targets because of unknown correspondence between the target range and measured range, especially using the Chinese remainder theorem (CRT) algorithm. We make a study of the CRT algorithm for multiple targets when the residue set contains noise error. In this paper, we present a symmetry polynomial aided CRT algorithm to effectively achieve range estimation of multiple targets when the measured ranges are overlapped with noise error. A closed-form and robust CRT algorithm for single target and the Aitken acceleration algorithm for finding roots of a polynomial equation are used to decrease the computational complexity of the proposed algorithm.
Key words: Range ambiguity; Erroneous range; Multiple targets; Symmetry polynomial aided Chinese remainder theorem
1西安电子科技大学雷达信号处理国家重点实验室,中国西安市,710071
2西安电子科技大学信息感知技术协同创新中心,中国西安市,710071
摘要:工作在高脉冲重复频率的脉冲多普勒雷达能避免多普勒模糊,但是高脉冲重复频率在许多场合导致距离模糊。目前,解决距离模糊的有效方案是基于波形设计,但是增加了雷达系统的复杂性。由于目标距离和量测距离的对应关系未知,传统的基于多脉冲重复频率方案,特别是中国余数定理,很难应用于多目标距离解模糊。本文旨在研究量测距离含有误差的基于中国余数定理多目标距离估计方法。提出基于对称多项式辅助的中国余数定理,能有效从含有误差的量测距离中重建多目标距离。封闭式鲁棒中国余数定理和基于Aitken加速算法的多项式方程求解方法能有效降低所提算法的计算复杂度。
关键词组:
References:
Open peer comments: Debate/Discuss/Question/Opinion
<1>
DOI:
10.1631/FITEE.2000418
CLC number:
TN953
Download Full Text:
Downloaded:
6967
Download summary:
<Click Here>Downloaded:
639Clicked:
6893
Cited:
0
On-line Access:
2024-08-27
Received:
2023-10-17
Revision Accepted:
2024-05-08
Crosschecked:
2021-01-17