摘要
为了解决减少重频分频最大公约数算法在分频数不互质情况下不能正确计算真实重频值的问题,提出了基于已知占空比信息的减少重频分频最大公约数算法.首先,构建了减少重频分频的最大公约数算法的数学模型,利用该数学模型分析并得出通过合理地确定分频数范围可以在分频数不互质情况下正确计算真实重频值;其次,设计了利用占空比确定分频数范围的方法,并构建了基于已知占空比信息的减少重频分频最大公约数算法.数值分析表明所提出的算法能够在分频数不互质情况下正确计算真实重频值,并且具有较好的鲁棒性.
A greatest common divisor (GCD) algorithm for reducing pulse repetition frequency (PRF) division based on duty circle information is proposed to solve the problem that the original GCD algorithm cannot correctly deal with the case when PRF divisions numbers are not co-prime. Firstly, the mathematical model of the GCD algorithm for reducing PRF division is constructed, and by use of this model an analysis is made and it is concluded that by means of the proper determination of the range of PRF divisions numbers, the true repetition frequency value can be correctly worked out when the PRF division numbers are not co-prime numbers;Secondly, a method for determining the range of frequency division numbers is designed based on duty circle and a GCD algorithm for reducing PRF division based on duty circle prior information is proposed. Numerical analysis finds that the proposed algorithm can correctly work out the true repetition frequency value when PRF divisions numbers are not co-prime, with a rather satisfactory robustness.
作者
杨洋
刘高峰
YANG Yang;LIU Gaofeng(No.29 Research Institute of China Electronic Technology Corporation,Chengdu 610036,China)
出处
《内江师范学院学报》
2019年第6期56-60,共5页
Journal of Neijiang Normal University
基金
国防科技重点实验室基金(JS16112201609)
关键词
雷达信号分选
直方图分选
重频分频
最大公约数
占空比
radar signal sorting
histogram sorting
pulse repetition frequency division
greatest common divisor
duty circle
