FFT或FHT的一種改進的整序算法
AN IMPROVED DIGIT-REVERSAL PERMUTATION ALGORITHM
-
摘要: 本文提出一種適于基-2FFT或FHT的更為高效的整序算法,使以往算法的運算量、算法結構等性能都有明顯改善,尤其當N較大時有很大優(yōu)勢,可以進一步提高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]皺理和.數(shù)字信號處理.北京:國防工業(yè)出版社,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. -
計量
- 文章訪問數(shù): 2349
- HTML全文瀏覽量: 187
- PDF下載量: 699
- 被引次數(shù): 0
下載:
