摘要
针对目前基于专用数字信号处理器（ＤＳＰ）实现快速傅里叶变换（ＦＦＴ）中遇到的处理速度和程序量之间的矛盾，提出了一种重复算法，它在保持直接算法速度的前提下减少了程序量，同时该方法可应用于其他变换（如ＤＣＴ等）．最后给出在ＴＭＳ３２０Ｃ２５上的实验结果，说明了该方法的有效性．
A new iterative FFT algorithm is proposed to solve the contradiction between the program code size and the processing speed encountered in applications based on the dedicated Digital Signal Processor (DSP). The program code size can be decreased by 40%～60% while the processing speed is slightly changed. The algorithm can also be used in other transforms such as convolution, Discrete Cosine Transform (DCT). Finally, the experimental results obtained on TMS320C25 is presented with the demonstration of effectiveness of the algorithm.
出处
《西安电子科技大学学报》
EI
CAS
CSCD
北大核心
1998年第4期445-449,共5页
Journal of Xidian University
基金
"九五"国防科技预研项目
