Extendible look-up table of twiddle factors and radix-8 based fast Fourier transform

  • Authors:

  • Qing Li;Nengchao Wang;Baochang Shi;Chuguang Zheng

  • Affiliations:

  • School of Computer Eng. & Sci., Shanghai University, Shanghai 200072, People's Republic of China and State Key Laboratory of Coal Combustion, Huazhong University of Science and Technology, Wuhan 4 ...;Parallel Computation Institute, Huazhong University of Science and Technology, Wuhan 430074, People's Republic of China;Parallel Computation Institute, Huazhong University of Science and Technology, Wuhan 430074, People's Republic of China;State Key Laboratory of Coal Combustion, Huazhong University of Science and Technology, Wuhan 430074, People's Republic of China

  • Venue:
  • Signal Processing
  • Year:
  • 2002

Quantified Score

Hi-index 0.08

Visualization

Abstract

An extendible look-up table of the twiddle factors for implementation of fast Fourier transform (FFT) is introduced in this paper. In fact, this twiddle factors table is independent of the length of sequence. It need not be recomputed for shorter sequences. And for longer sequences, the table can be extended easily. A radix-8 based FFT algorithm for 2m-FFT with this table is presented. Experimental comparisons between our algorithm and FFTW software package have be done. And the results indicate that our FFT scheme is effective.