论文部分内容阅读
原有的映射法ZFFT和复调制法ZFFT,都要等待全部P·M个信号数据(P为细化因子,M为实际作FFT的点数)都收集完毕,并且再经过隔点式(即时间抽取式)重新采样后才能开始运算。因此起始运算等待时间(——一种重要的运算辅助时间)太长,严重影响着总运算效率。本文提出的ZFFT方法,信号边顺序分段输入,就边进行分段处理。因而大大节省运算辅助时间,尤其适应高速数字硬件使纯计算时间大为缩短的新形势下,使得运算辅助时间与纯计算时间相协调,从而构成整体的高效率运算。这种ZFFT结构简单易于实现,便于开发应用。
The original mapping method ZFFT and complex modulation method ZFFT, have to wait for all P · M signal data (P is the thinning factor, M is the actual number of FFT points) are collected, and then through the point type (ie, time Extraction) Resampling to start computing. Therefore, the starting operation waiting time (an important computing auxiliary time) is too long, seriously affecting the overall operation efficiency. ZFFT proposed in this paper, the signal edge of the input sequence, the edge of the segmentation. Thus greatly saving the computing auxiliary time, especially under the new situation that the high-speed digital hardware greatly reduces the pure computing time. As a result, the computing auxiliary time and the pure computing time are coordinated to form the overall high-efficiency computing. This ZFFT structure is simple and easy to implement, easy to develop and apply.