Ecosyste.ms: Repos

An open API service providing repository metadata for many open source software ecosystems.

GitHub topics: radix-2

hukenovs/fp23fftk

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

Language: VHDL - Size: 1.27 MB - Last synced: 15 days ago - Pushed: almost 2 years ago - Stars: 48 - Forks: 15

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: VHDL - Size: 309 KB - Last synced: 15 days ago - Pushed: over 1 year ago - Stars: 71 - Forks: 25

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: MATLAB - Size: 2.57 MB - Last synced: about 1 year ago - Pushed: almost 3 years ago - Stars: 12 - Forks: 3

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: Cuda - Size: 9.12 MB - Last synced: about 1 year ago - Pushed: almost 6 years ago - Stars: 7 - Forks: 2

Michael-MD/Radix-2-FFT

Small library for in-place bit reversed DIT DFT radix-2 FFT. 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: C - Size: 4.88 KB - Last synced: about 1 year ago - Pushed: over 1 year ago - Stars: 0 - Forks: 0

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: Verilog - Size: 1.81 MB - Last synced: about 1 year ago - Pushed: almost 5 years ago - Stars: 20 - Forks: 11

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++ - Size: 183 KB - Last synced: about 1 year ago - Pushed: over 3 years ago - Stars: 0 - Forks: 0

Related Keywords
radix-2 7 fft 7 digital-signal-processing 4 verilog 3 dsp 3 fast-fourier-transform 3 dft 2 xilinx 2 vhdl 2 fpga 2 fast-convolutions 2 cooley-tukey-fft 2 convolution 2 altera 2 gpu-programming 1 nvcc 1 openacc 1 parallel-computing 1 pgi 1 pgi-compiler 1 dit 1 fft2 1 fftshift 1 butterfly 1 gate-level 1 pipeline 1 processor 1 single-path-delay 1 snr 1 cpp 1 efficiency 1 fourier-transform 1 floating-point 1 frequency-analysis 1 ieee754 1 matlab 1 octave 1 convolution-filter 1 chirp 1 integer-arithmetic 1 route-optimization 1 vivado 1 auto-correlation 1 cross-correlation 1 divide-and-conquer 1 fir-filter 1 acceleration 1 cuda 1 gpu-acceleration 1 gpu-computing 1