节点文献

基于稀疏傅里叶变换的高速目标检测算法研究

Research on High Speed Target Detection Algorithm Based on Sparse Fourier Transform

【作者】 张秀丽

【导师】 王浩全;

【作者基本信息】 中北大学 , 信息与通信工程, 2018, 硕士

【摘要】 随着雷达领域的快速发展,需要实时处理的数据规模越来越大,应用快速傅里叶变换的高速目标检测方法运算量较大,满足不了雷达目标检测实时性的要求。稀疏傅里叶变换是利用信号频域稀疏性的特点提出的一种快速算法,这种算法大大提高了信号处理速度,为数据的快速处理开拓了新的方向。本文首先分析了影响雷达回波的因素并由此建立了高速目标回波模型,研究了高速目标检测的影响因素并进行了数学推导和仿真分析。并以匀速高速目标为对象,分析了距离走动产生的原因,提出了距离走动补偿算法的结构,针对提出的补偿算法结构分别介绍了基于时域补偿的Keystone变换和基于频域补偿的包络插值移位补偿算法。其次分析了稀疏傅里叶变换理论并将SFFT算法应用正弦信号的普通目标检测中,讨论了应用SFFT的条件,以及滤波器参数和分筐的长度对检测性能的影响。通过仿真验证了基于SFFT的正弦信号检测算法的可行性,并指出只有选取适当滤波参数和分段长度,才能确保目标检测的有效性。最后,由基于SFFT的正弦信号检测和高速目标检测算法推广到基于SFFT的高速目标检测算法,也就是本文的算法。针对高速目标检测中距离走动的问题,本文算法提出了在SFFT的分筐之后先进行速度补偿,再进行MTD运算完成目标的位置和速度等参数的估计。算法仿真结果和算法运算量分析证明基于SFFT的高速目标检测算法目标检测性能较好、运算量较低,对信号的实时处理具有一定的理论价值。

【Abstract】 With the rapid development of the radar field,the scale of data that needs to be processed in real time is increasing,and the fast Fourier transform-based high-speed target detection method has a large amount of calculations and cannot meet the radar target detection real-time requirements.Sparse Fourier transform is a fast algorithm that utilizes the sparsity of signal frequency domain.This algorithm greatly improves the signal processing speed and opens up new directions for rapid data processing.Firstly the paper analyzes the factors affecting radar echoes and establishes the echo model of high-speed targets.The influencing factors of high-speed target detection are studied and mathematical derivation and simulation analysis are performed.The uniform high-velocity target is taken as object,the reason of the distance walking is analyzed,and the structure of the distance walking compensation algorithm is proposed.The keystone transform based on time domain compensation and the envelope interpolation shift based on frequency domain compensation are introduced respectively for the structure of the proposed compensation algorithm.Bit compensation algorithm.Secondly,the basic theory of sparse Fourier transform is introduced and the SFFT algorithm is applied to the common target detection based on sinusoidal signals.The conditions of applying SFFT,and the influence of filter parameters and the length of sub-basket on detection performance are discussed.The feasibility of the sinusoidal signal detection algorithm based on SFFT is proved by simulation,and it is pointed out that the effectiveness of the target detection can only be ensured by selecting the appropriate filter parameters and segment length.Finally,the SFFT-based sinusoidal signal detection and high-speed target detection algorithms are extended to the SFFT-based high-speed target detection algorithm,which is the algorithm in this paper.For the problem of distance walking in high-speed target detection,the proposed algorithm first performs speed compensation after SFFT is divided into baskets,and then performs MTD operation.Finally,the target position and speed parameters are estimated.Through the simulation and verification of the algorithm and from the perspective of detection performance and computational complexity,the proposed algorithm is compared with the currently popular Keystone algorithm and envelope interpolation shift compensation algorithm.The results show that the proposed algorithm has better target detection performance and computational complexity.Low,improves the real-time performance of high-speed target detection.

  • 【网络出版投稿人】 中北大学
  • 【网络出版年期】2018年 10期
节点文献中: 

本文链接的文献网络图示:

本文的引文网络