Implementation of N-Point FFT/IFFT processor based on Radix-2 Using FPGA
Kota Murali Mohan, K. Naresh, Chokkakula Ganesh, V. Sagar Reddy, Kakarla Hari Kishore · 2022
A Fast Fourier Transform is an efficient algorithm to compute the discrete Fourier Transform (DFT). It is one of the finest operations in the area of digital signal and image processing. The operation requires a high computational module i.e., (N2complex multiplications and N*(N-1) additions). This makes the computational and implementation very difficult. Implementation of N-point FFT/IFFT of data width 32-bit (16-bit real and 16-bit Imaginary) with run-time configurable Radix-2 Architecture, FFT size, and data type i.e., (Fixed Point). Compile time configurable data and twiddle factor precision. The design target is to minimize the latency and design constraints. The logic is implemented so that only one memory will be used for the entire computation process. Hence, this gives a Novel architecture design for N-point FFT.