AN IMPROVED ALGORITHM FOR FFT

Jiang  Zun-Fu

Volume 3 Issue 3

Nov. 2010

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 1981 > 3(3): 196-200

Jiang Zun-Fu. AN IMPROVED ALGORITHM FOR FFT[J]. Journal of Electronics & Information Technology, 1981, 3(3): 196-200.

Citation:

Jiang Zun-Fu. AN IMPROVED ALGORITHM FOR FFT[J]. Journal of Electronics & Information Technology, 1981, 3(3): 196-200.

Jiang Zun-Fu. AN IMPROVED ALGORITHM FOR FFT[J]. Journal of Electronics & Information Technology, 1981, 3(3): 196-200.

Citation:

Jiang Zun-Fu. AN IMPROVED ALGORITHM FOR FFT[J]. Journal of Electronics & Information Technology, 1981, 3(3): 196-200.

PDF( 587 KB)

AN IMPROVED ALGORITHM FOR FFT

Jiang Zun-Fu

Received Date: 1980-04-02
Publish Date: 1981-07-19

Abstract

Abstract

An improved algorithm for FFT is proposed. The Fourier transforms of a complex discrete sequence with N = 2r points are performed by the operation of (-3) N/2 times of multiplication. The speed of the algorithm is faster than the conventional FFT. The speed up ratio is about 3/(-3).

FullText(HTML)

References(1)

References

J. Cooley and J. Tukey, Math. Comput.,19(1965), 297.[2]S. Winograd, Proc. Nat, Acad. Sci. U.S.A.,73(1976), 100.[3]H. F. Silverman, IEEE Trans. on Assp,ASSP-25(1977), 242.[4]V. P. Kolba and T. W. Parks, IEEE Trans.on Assp, ASSP-25(1977), 281.[5]田中公男、青山友纪,情报处理,19(1978), 1091.

Relative Articles

Supplements(0)

Cited By

Proportional views