一种改进的快速RFT实现方法  

A Novel Improved Fast RFT Algorithm

作　　者：商哲然 谭贤四[2] 曲智国[2] 王红[2] 杨康峰 SHANG Zhe-ran TAN Xian-si QU Zhi-guo WANG hong YANG Kang-feng(Air Force Early Warning Academy, Department of Graduate Management Department of Land-Based Early Warning Surveillance Equipment, Huhei Wuhan 430019, China)

机构地区：[1]空军预警学院研究生管理大队,湖北武汉430019 [2]空军预警学院陆基预警监视装备系,湖北武汉430019

出　　处：《现代防御技术》2017年第1期140-146,共7页Modern Defence Technology

摘　　要：RFT算法是一种广义的MTD,可以沿着目标运动轨迹进行相参积累。将基于Chirp-Z变换的快速RFT与标准RFT结合,提出一种改进的快速RFT实现方法。该方法根据旁瓣与主瓣的关系,通过搜索高于噪声电平的旁瓣找到主瓣,从而实现目标检测。与原有遍历所有可能的盲速因子的快速RFT相比,新算法运算量明显减少。实验结果表明,该方法在保持检测性能基本不变的情况下,能显著提高算法的运算速度。The Radon-Fourier transform （RFT） algorithm is considered as a generalized moving targets detection （MTD） , which can coherently integrate target＇ s energy along its moving track. A novel fast implementation of RFT algorithm is proposed by combining the merits of two recently proposed algorithms： the standard RFT and the fast RFT based on Chirp-Z transform. By analyzing the relationship between the main lobes and side lobes, the target can be detected quickly by finding the main lobes according to the positions of side lobes whose levels are higher than the noise level. Compared with previous fast RFT which searches all the possible blind speed integers, the computational cost of our algorithm has been prominently reduced. Experimental results show that the new algorithm effectively improves the speed of standard RFT while keeping its performance nearly unaffected.

关 键 词：高速目标检测 距离走动 相参积累 盲速旁瓣 模糊因子 快速算法 

分 类 号：TN957.51[电子电信—信号与信息处理]