Low-complexity twiddle factor generator for FFT processors

This paper presents a low-complexity twiddle factor (TF) generator suitable for radix-8/4/2 fast Fourier transformation (FFT). The proposed TF generator employs a full complex multiplier only and simple logic units to produce all the twiddle factors required for use in FFT computation. This generator approximately costs constant chip area for an arbitrary point of FFT processor, almost independent of the FFT processing size.