128-point memory-based architecture for a fast Fourier transform
Chuen-Yau Chen, Chun‐Kai Huang · International Journal of Electronics · 2012
In this article, we take advantage of the merits of a one-sixteenth circle storage technique, radix-2 and radix-2/4/8 algorithms to implement a 128-point memory-based architecture for a fast Fourier transform processor. The one-sixteenth circle storage technique results in reducing 50% of the size of a look-up table (LUT) for storing the twiddle factors. The combination of radix-2 and radix-2/4/8 algorithms results in reducing the number of twiddle factors and allowing the processor to possess a regular architecture which is suitable for hardware implementation. This design has been synthesised by Altera Quartus II 6.0. The experimental results indicate that this design needs only 65,169 ALUTs for LUT. The operating frequency is 59.76 MHz. The signal-to-noise ratios for the real and imaginary parts of the output signal are 67.72 dB and 68.55 dB, respectively.