Python Implementation of Radix4 N=64 DIT FFT with Reducedsize Twiddle table
John Bryan

The implemented algorithm to use a reducedsize twiddle table is from [1].

The twiddle table has nine entries, W^{k}_{64}, k=0,1,2,...,7,8.

Python implementation.

The algorithm is tested with random sequence input and compared with numpy fft result to verify correctness.

Reference:

Teemu Pitkänen, Tero Partanen, and Jarmo Takala, "LowPower Twiddle Factor Unit for FFT Computation", 2007.