TREE DECOMPOSITION FFT ALGORITHM

Wang Kairen

Volume 7 Issue 1

Jan. 1985

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 1985 > 7(1): 20-27

Wang Kairen. TREE DECOMPOSITION FFT ALGORITHM[J]. Journal of Electronics & Information Technology, 1985, 7(1): 20-27.

Citation:

Wang Kairen. TREE DECOMPOSITION FFT ALGORITHM[J]. Journal of Electronics & Information Technology, 1985, 7(1): 20-27.

Wang Kairen. TREE DECOMPOSITION FFT ALGORITHM[J]. Journal of Electronics & Information Technology, 1985, 7(1): 20-27.

Citation:

Wang Kairen. TREE DECOMPOSITION FFT ALGORITHM[J]. Journal of Electronics & Information Technology, 1985, 7(1): 20-27.

PDF( 1249 KB)

TREE DECOMPOSITION FFT ALGORITHM

Wang Kairen

Received Date: 1982-09-28
Rev Recd Date: 1984-08-27
Publish Date: 1985-01-19

Abstract

Abstract

The Mixed Time and Frequency Decimation FFT Algorithm (MDFFT) proposed by K. Nakayama is simplified and deepened, then a new FFT algorithm based on tree-decomposition process is developed. The number of real multiplications of the newalgorithm is about (65/64)Nlog2N-3N-4 which is less than (3/2)Nlog2N-7N+10N1/2-4 of MDFFT.

FullText(HTML)

References(1)

References

J. Cooley and J. Tukey, Mathematics of Computation, 19(1965), 297.[2]K. Nakayama, Fast Fourier Transform Using Mixed Frequency and Time Decimation, IECE of Japan, Report of Technical Group on Circuit Syst.,Vol. CAS 79-94, pp.49-54, Oct.1979.[3]C . Caraiscos and B. Liu, Two Dimensional DFT Using Mixed Time and Frequency Decimation,Proc. Int. Conf. Acoust., Speech, Signal Processing, pp. 24-27, Paris, May 1982.[4]E. O. Brigham, The Fast Fourier Transform, Prentice-Hall, 1974.

Relative Articles

Supplements(0)

Cited By

Proportional views