AN IMPROVED DIGIT-REVERSAL PERMUTATION ALGORITHM

Liu Bin; Xie Ping

Volume 19 Issue 3

May 1997

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 1997 > 19(3): 306-310

Liu Bin, Xie Ping. AN IMPROVED DIGIT-REVERSAL PERMUTATION ALGORITHM[J]. Journal of Electronics & Information Technology, 1997, 19(3): 306-310.

Citation:

Liu Bin, Xie Ping. AN IMPROVED DIGIT-REVERSAL PERMUTATION ALGORITHM[J]. Journal of Electronics & Information Technology, 1997, 19(3): 306-310.

Liu Bin, Xie Ping. AN IMPROVED DIGIT-REVERSAL PERMUTATION ALGORITHM[J]. Journal of Electronics & Information Technology, 1997, 19(3): 306-310.

Citation:

Liu Bin, Xie Ping. AN IMPROVED DIGIT-REVERSAL PERMUTATION ALGORITHM[J]. Journal of Electronics & Information Technology, 1997, 19(3): 306-310.

PDF( 852 KB)

AN IMPROVED DIGIT-REVERSAL PERMUTATION ALGORITHM

Liu Bin,
Xie Ping

Received Date: 1995-07-07
Rev Recd Date: 1996-03-07
Publish Date: 1997-05-19

Abstract

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.

FullText(HTML)

References(1)

References

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.

Relative Articles

Supplements(0)

Cited By

Proportional views