层叠分段傅里叶变换的数字Stretch实现新方法

针对数字Stretch处理在大抽取倍数情况下硬件资源消耗大、难以工程实现的问题，提出了层叠分段快速傅里叶变换处理的数字Stretch实现算法，将数字混频后的数据序列通过层叠分段与重组，利用小点数的快速傅里叶变换运算实现数字Stretch处理。实测数据验证了算法的有效性。资源消耗分析表明，与常规的数据滤波抽取处理方法相比，该算法可有效减少数字Stretch处理的硬件资源消耗。

Novel digital Stretch implementation method based on cascading segmented Fourier transform

To resolve the problem of high hardware consumption and difficulty in engineering implementation in digital Stretch processing with large decimation multiples, a new method based on cascading segmented FFT (fast Fourier transform) processing was proposed. The data sequence after digital mixing is cascading segmented and reorganized, and then the digital Stretch processing was realized by using the less points FFT operation. The experimental results based on the measured data prove the effectiveness of the presented strategy. The resource consumption analysis demonstrates that the proposed method can implement digital Stretch more hardware-efficiently compared with the conventional method.