摘要
本文在循环型DIT一FFT的DSP汇编算法查表实现的基础上,用1/4周期的因子表取代原有的两个周期的因子表,并把长度为2N的实数计算序列,转化为长度为N的复数序列进行FFT变换,从而改进了原算法的时间和空间复杂度及程序存储空间。
On the basis of the loop imputation of DIT-FFT algorithms, with application in Digital Signal Processing (DSP), we replace original two periods gene table with one-fourth period one. Furthermore, we change a real computing series with 2N length into a Complex number one with N length to complete FFt, with the result of improvement the algorithm's complexity in time and space and decrease used memories.
出处
《中山大学研究生学刊（自然科学与医学版）》
2000年第2期30-36,共7页
Journal of the Graduates Sun YAT-SEN University(Natural Sciences.Medicine)
