401 skills found · Page 4 of 14
tavurth / Godot FftFast Fourier Transform in GDScript
cpuimage / FFTResamplerA Simple and Efficient Implementation Of Fast Fourier Transform For Audio Resampler
thomasvrussell / SfftSaccadic Fast Fourier Transform (SFFT) algorithm for Image subtraction in Fourier space
zhangprofessor / Fast Non Local Means And Asymptotic Non Local MeansNon-Local means denoising (NLM) algorithm is a milestone algorithm in the field of image processing. The proposal of NLM has opened up the non-local method which has a deep influence. This paper performed a revisit for NLM from two aspects as follows: 1. To alleviate the high computational complexity problem of NLM, a fast algorithm was constructed, which was based on cross-correlation and fast Fourier transform; 2. NLM always blur structures and textures during the noise removal, especially in the case of strong noise. To solve this problem, an Asymptotic Non-Local Means image denoising algorithm is put forward, which uses the property of noise variance to control the filtering parameters. Numerical experiments illustrate that the fast algorithm is 27 times faster than classical implementation with standard parameter configuration, and the ANLM uniformly outperforms classical NLM, in terms of both PSNR and visual effects.
mpi4py / Mpi4py Fftmpi4py-fft is a Python package for computing Fast Fourier Transforms (FFTs).
FastNFT / FNFTFast numerical computation of (inverse) nonlinear Fourier transforms
kfrlib / FftFFT (Fast Fourier Transform): SSE, AVX, AVX2
siddharth-maddali / FrftFast implementation of the multi-dimensional fractional Fourier transform in Python
visore / QRealFourierA Qt-based C++ library for Fast Fourier Transform (FFT) of real samples.
pushkar-khetrapal / Fast CNNGenerating similiar results of convolution layers from Fast Fourier Transform
rhysnewell / FftconvolveRust implementations of Fast Fourier Transform convolution and correlation for n-dimensional arrays
aimukhin / MinfftA small and fast Discrete Fourier Transform library
jasonlin316 / A Single Path Delay 32 Point FFT ProcessorA 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.
Alisah-Ozcan / GPU NTTWelcome to the GPU-NTT-Optimization repository! We present cutting-edge algorithms and implementations for optimizing the Number Theoretic Transform (NTT) on Graphics Processing Units (GPUs).
Samson-Mano / Fast Fourier TransformC# implementation of Cooley–Tukey's FFT algorithm.
dasaki / Android Fft MinimFast Fourier Transform algorithms from Processing's Minim audio library, adapted to work in android
rreusser / Glsl RfftGLSL setup for performing a Fast Fourier Transform of real-valued input
abdelazeem201 / Design And ASIC Implementation Of 32 Point FFT ProcessorI present a novel pipelined fast Fourier transform (FFT) architecture which is capable of producing the output sequence in normal order. A single-path delay commutator processing element (SDC PE) has been proposed for the first time. It saves a complex adder compared with the typical radix-2 butterfly unit. The new pipelined architecture can be built using the proposed processing element. The proposed architecture can lead to 100% hardware utilization and 50% reduction in the overall number of adders required in the conventional pipelined FFT designs. In order to produce the output sequence in normal order, we also present a bit reverser, which can achieve a 50% reduction in memory usage.
bickelmps / DIC FFT ETHZDigital Image Correlation using a Fast Fourier Transform approach
syedalamabbas / 2D 3D PolarFourierTransformC++, CUDA, and MATLAB codes for the paper "An Exact and Fast Computation of Discrete Fourier Transform for Polar and Spherical Grid"
