Giters

jomonkjoy / FFT-Computation

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

Home Page:http://en.dsplib.org/content/fft_dec_in_time.html

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

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]

About

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

http://en.dsplib.org/content/fft_dec_in_time.html

License:GNU General Public License v3.0

Languages

Language:SystemVerilog 100.0%