摘要
快速富里叶交换ＦＦＴ算法是公认的效率很高的傅里叶交换算法．在实际应用中对数据流结构进行必要的修剪工作有可能使运算次数大幅度地减少．本文提出了一种修剪算法的原理及实现，并提出了可实际应用的程序．
FT algorithm is recongnized as a very efficient way to compute are proPOsed and DiscreteFourier Transform. But in many applications, PRUNING on the datuflow structure of the algorithmcan reduce the compunctional complexity greatly. In this paper the theory and realization of such apruning algorithm, are proposed and an applicable program is offered.
基金
国家自然科学基金
