/FFT-Computation

Fast Fourier Transform (FFT) algorithm computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IFFT)

Primary LanguageSystemVerilogGNU General Public License v3.0GPL-3.0

FFT-Computation

Fast Fourier Transform (FFT) algorithm computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IFFT)

N-Point FFT uses (N/2)*clog2(N) Multiply-Add Units [Xilinx-DSP48E1]