FFT或FHT的一种改进的整序算法
AN IMPROVED DIGIT-REVERSAL PERMUTATION ALGORITHM
-
摘要: 本文提出一种适于基-2FFT或FHT的更为高效的整序算法,使以往算法的运算量、算法结构等性能都有明显改善,尤其当N较大时有很大优势,可以进一步提高FFT和FHT的运算效率。Abstract: A more efficient permutation algorithm which has less computer operation and better structure is presented here for radix-2 FFT (FHT). It can fasten the FFT and FHT efficiently when N becomes large.
-
Cooley J W, Tukey J W. An algorithm for the fast Fourier transform and fast Hartley transform. Math. Comput., 1966,19(8): 197-202.[2]Duhamel P, Hollmamn H. Split-radix FFT algorithm, Election. Lett., 1984, 20(6): 14-16.[3]Hou H S. The fast Hartley transform algorithm. IEEE Trans. on C, 1987, 636(5): 147-156.[4]皱理和.数字信号处理.北京:国防工业出版社,1985,第六章.[5]曹钧.提高快速傅立叶变换算法效率的方法.微电子学与计算机,1984(5): 13-15.[6]Evans D M W. An improved digit-reversal permutation algorithm for the fast Fourier and Hartley[7]transform. IEEE Trans. on ASS只1987, ASSP-35(8): 1120-1135. -
计量
- 文章访问数: 2280
- HTML全文浏览量: 175
- PDF下载量: 696
- 被引次数: 0
下载:
