CHINESE JOURNAL OF COMPUTATIONAL PHYSICS ›› 1986, Vol. 3 ›› Issue (1): 99-112.

Previous Articles     Next Articles

AN EFFICIENT HIGHLY COMPOSITE FFT ALGORITHM

Lu Xian-chi   

  1. Department of Geophysics, Peking. University, Beijing
  • Received:1985-09-25 Online:1986-03-25 Published:1986-03-25

Abstract: In this paper some fundamental methods of fast Fourier transform (FFT) are mentioned with a highly composite twiddle factor FFT:algorithm discussed in particular. The computer program upon the algorithm with other measures, which can be used for both forward and backward Fourier transform of either complex or real sequence,has been shown to have remarkably faster transform speed, and so it will be useful in practical computational work.