radix-2

There are 9 repositories under radix-2 topic.

  • hukenovs/intfftk

    Fully pipelined Integer Scaled / Unscaled Radix-2 Forward/Inverse Fast Fourier Transform (FFT) IP-core for newest Xilinx FPGAs (Source language - VHDL / Verilog). GNU GPL 3.0.

    Language:VHDL797125

  • hukenovs/fp23fftk

    Floating point Forward/Inverse Fast Fourier Transform (FFT) IP-core for newest Xilinx FPGAs (Source lang. - VHDL).

    Language:VHDL568117
  • A-Single-Path-Delay-32-Point-FFT-Processor

    jasonlin316/A-Single-Path-Delay-32-Point-FFT-Processor

    A 32-point pipelined Fast Fourier transform processor, using single path delay architecture, and based on radix2-DIF(decimation-in-frequency) algorithm. The average SNR = 58.76.

    Language:Verilog422113

  • SaiferGit/Digital-Signal-Processing-Codes

    This is a repository where I added my DSP codes that have written in Matlab (without built-in function). I have also commented inside every code so that it will become helpful for newbies. Also added cross-check using Library Function.

    Language:MATLAB17104

  • ShadyBoukhary/GPU-research-FFT-OpenACC-CUDA

    Case studies constitute a modern interdisciplinary and valuable teaching practice which plays a critical and fundamental role in the development of new skills and the formation of new knowledge. This research studies the behavior and performance of two interdisciplinary and widely adopted scientific kernels, a Fast Fourier Transform and Matrix Multiplication. Both routines are implemented in the two current most popular many-core programming models CUDA and OpenACC. A Fast Fourier Transform (FFT) samples a signal over a period of time and divides it into its frequency components, computing the Discrete Fourier Transform (DFT) of a sequence. Unlike the traditional approach to computing a DFT, FFT algorithms reduce the complexity of the problem from O(n2) to O(nLog2n). Matrix multiplication is a cornerstone routine in Mathematics, Artificial Intelligence and Machine Learning. This research also shows that the nature of the problem plays a crucial role in determining what many-core model will provide the highest benefit in performance.

    Language:Cuda11103

  • anandketan/Fast_Fourier_Transforms

    A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform of a sequence. Decomposing an N-point time domain signal into sequence of single points. The N-spectra are synthesized into a single frequency spectrum.

    Language:C++2100

  • Flinch010/bachelor-s-degree

    A comparison study between different FFT algorithms implemented in Java as part of the bachelor's degree. Implemented algorithms: Furier transform by definition, radix-2 (DIT) recursive, radix-2 (DIT) iterative, radix-2 (DIF) recursive, radix-4 (DIT) recursive, radix-4 (DIF) recursive, radix-4 (DIT) iterative, split radix (DIT), split radix (DIF), Bluestein's algoritm.

    Language:EmberScript0100

  • hnkr/DSP-FFT

    FFT - Radix2 DIT

    Language:C0200

  • Michael-MD/Radix-2-FFT

    Small library for in-place bit reversed DIT DFT radix-2 FFT using the same definition as MATLAB. Functions are provided for 1D and 2D FFTs as well as fftshift and fftshift2 which rearranges the components to place the 0 frequency term in the centre.

    Language:C0100