参考文献
[1] Alan H K.Bit Reversal on Uniprocessor[J].SLAM Review,1996,38(1):289-307.
[2] Wang H H.On Vectorizing the Fast Fourier Transform[J].BIT Numerical Mathematics,1980,20(2):233-243.
[3] Thomas G.Interpolation Algorithms for Discrete Fourier Transform of Weighed Signals[J].EEE Transactions on Instrumentation & Measurement,1983,32(2):350-355.
[4]Pease M C.An Adaptation of the Fast Fourier Transform for Parallel Processing[J].Journal of the ACM,1968,15(2):252-264.
[5] Linzer E N,Feig E.Implementation of Efficient FFT Algorithms on Fused Multiply-add Architectures[J].IEEE Transactions on Signal Processing,1993,41(1):93-107.
[6] 黄佳森,陈帅,王小龙,等.基于映射迭代策略的FFT重排序算法设计[J].计算机工程,2013,39(9):285-288.
[7] 胡广书.数字信号处理理论、算法与实现[M].北京:清华大学出版社,2003.
[8] Kass M,Witkin A.Constraints on Deformable Models:Recovering 3D Shape and Nonrigid Motion[J].Artificial Intelligence,1988,36(1):91-123.
[9] 林水生,黄顺吉.一种实现任意基的快速整序算法[J].电子科技大学学报,1998,27(4):343-346.
[10]应启珩,窦维蓓.离散时间信号分析和处理[M].北京:清华大学出版社,2001.
(下转第212页)
(上接第203页)
[11]Yong A.A Better FFT Bit-reversal Algorithm Without Tables[J].IEEE Transactions on Signal Processing,1991,9(10):2365-2367.
[12]James S W.A New Bit Reversal Algorithm[J].IEEE Transactions on Acoustics Speech & Signal Processing,1990,38(8):1427-1483.
[13] 贾渊,王俊波,姬长英.FFT快速整序算法的对比、改进及实现[J].电子科技大学学报,2009,38(2):292-295.
[14] Evans D.A Second Improved Digit-reversal Permutation Algorithm for Fast Fourier Transforms[J].IEEE Transactions on Acoustics Speech & Signal Processing,1989,37(8):1288-1291.
[15]Evans D.A Second Improved Digit-reversal Permutation Algorithm for Fast Fourier Transforms[J].IEEE Transactions on Acoustics Speech & Signal Processing,1989,37(8):1288-1291.
[16] 汪海兵,徐淑正,杨华中.基于查找表的单基FFT原址倒序算法[J].清华大学学报(自然科学版),2008,48(1):43-50.
编辑顾逸斐
|