[1]李忠慧,曾毓敏,尹晓琦,等.一种改进的基于FFT Pruning算法的快速实现方法[J].南京师范大学学报(工程技术版),2005,05(04):042-45.
 LI Zhonghui,ZENG Yumin,YIN Xiaoqi,et al.An Improved Fast Implementation Method for FFT Pruning Algorithm[J].Journal of Nanjing Normal University(Engineering and Technology),2005,05(04):042-45.
点击复制

一种改进的基于FFT Pruning算法的快速实现方法
分享到:

南京师范大学学报(工程技术版)[ISSN:1006-6977/CN:61-1281/TN]

卷:
05卷
期数:
2005年04期
页码:
042-45
栏目:
出版日期:
2005-12-30

文章信息/Info

Title:
An Improved Fast Implementation Method for FFT Pruning Algorithm
作者:
李忠慧;曾毓敏;尹晓琦;吴婷婷;
南京师范大学物理科学与技术学院, 江苏南京210097
Author(s):
LI ZhonghuiZENG YuminYIN XiaoqiWU Tingting
School of Physical Science and Technology,Nanjing Normal University,Jiangsu Nanjing 210097,China
关键词:
FFTPruning算法 算法实现 数字信号处理 频谱分辨率
Keywords:
FFT Prun ing algor ithm imp lem enta tion o f a lgor ithm dig ital signa l processing spectrum reso lution
分类号:
TN911.7
摘要:
针对文献[5]提出的FFT Prun ing算法作了一些改进,得到了只计算FFT频谱中部分频点谱值的改进的快速实现方法.根据输入输出数据的结构特点,利用辅助矩阵和数据复制等手段,降低了FFT Prun ing算法实现的复杂度,提高了FFTPrun ing算法实现的灵活性.将改进后的FFT Prun ing算法用C语言实现并在DSP集成开发环境CCS下的C5402 D evice S im-u lator上运行.在相同条件下,再运行一般意义上的FFT算法和文献[5]中算法所对应的C程序,统计3种方法的运行时
Abstract:
Considering the FFT Prun ing a lgor ithm propo sed in lite rature[ 5], this paper improves it and obtains an improv ed fast im plem en tation m ethod fo r FFT prun ing algorithm in which only part spectra l o f thew ho le FFT. s spectra l need to be ca lculated. Accord ing to struc tura l charac teristics o f the input and output data, the im proved m ethod utilizes the data replication and assistantm atrix to decrease the com putationa l com plex ity and enhance the im plem entary flex ib ility of the FFT Prun ing algorithm. The improved m ethod is realized in C and run in C5402 Dev ice S imu lator o f CCS w hich is the integ rated explo itive circum stance fo rDSP. The C prog ram s correspond ing to the a lgo rithm in reference [ 5] and basic FFT algor ithm a re run respective ly in the sam e c ircum stance too. A fter the three C prog ram files a re execu ted, the executive tim e o f each a lgor ithm are recorded to compare the e fficiency o f them. The emu lational expe rim en ts show that in the sam e cond ition, contrasted w ith other me thods, the im proved m ethod consumes less tim e obv iously wh ile the co rresponding spectra can be obta ined qu ickly and correctly, and tha t it doesn. t lim it the leng th o f the input and output data too.

参考文献/References:

[ 1] M arke l J D. FFT pruning [ J]. IEEE Trans on Audio E lectroacoust, 1971, 19( 4): 305- 311.
[ 2] Skinner D P. Prun ing the dec im ation in time FFT algor ithm [ J]. IEEE T rans on ASSP, 1976, 24( 3): 193- 194.
[ 3] S reeniv as T V, Rao P V S. FFT a lgor ithm fo r both input and output prun ing[ J]. IEEE Trans on ASSP, 1979, 27 ( 3): 291- 292.
[ 4] N aga i K. Prun ing the decim a tion- in- tim e FFT a lgo rithm w ith frequency shift[ J]. IEEE Trans on ASSP, 1986, 34 ( 4): 1008 -1010.
[ 5] A lves R G, O sor io P L, Sw am y M N S. General FFT prun ing [ C ] / / Proceed ing s of the 43rd IEEE M idwest Symposium. M ich igan: Lansing, 2000: 1192- 1195.
[ 6] 胡广书. 数字信号处理) ) ) 理论、算法与实现[M ] . 2 版. 北京: 清华大学出版社, 2003: 187- 192.

备注/Memo

备注/Memo:
作者简介: 李忠慧( 1978-) , 女, 硕士研究生, 主要从事物理电子学与语音信号处理等方面的学习与研究. E-m ail:l ililzh@ 163. com
通讯联系人: 曾毓敏( 1962-) , 教授, 博士, 主要从事语音信号处理方面的教学与研究. E-m ail:zengyum in@ n jnu. edu. cn
更新日期/Last Update: 2013-04-29