project-gemmi / benchmarking-fft
choosing FFT library...
☆138Updated 2 years ago
Alternatives and similar repositories for benchmarking-fft:
Users that are interested in benchmarking-fft are comparing it to the libraries listed below
- Fork of https://gitlab.mpcdf.mpg.de/mtr/pocketfft to simplify external contributions☆78Updated 2 weeks ago
- FFT implementation based on FFTPack, but with several improvements, cloned from☆22Updated 6 months ago
- OTFFT is a high-speed FFT library using the Stockham's algorithm and AVX.☆18Updated 2 years ago
- PFFFT: a pretty fast FFT with Bluestein's FFT Algorithm(Non Power of Two)☆24Updated 6 years ago
- A fork of Julien Pommier's Pretty Fast FFT (PFFFT) library, with several additions☆259Updated last year
- Fast Fourier Transform C++ Header/MPI Transpose for FFTW3 with Implicitly Dealiased Convolutions☆121Updated this week
- Implementation of FIR and IIR filters optimized for SIMD processing☆48Updated 7 years ago
- SIMD optimised library for matrix inversion of 2x2, 3x3, and 4x4 matrices.☆92Updated 8 years ago
- A small and fast Discrete Fourier Transform library☆43Updated 8 months ago
- A library for computing the Fast Fourier Transform (FFT) in one or two dimensions.☆168Updated 5 years ago
- FFT (Fast Fourier Transform): SSE, AVX, AVX2☆51Updated 8 years ago
- Just my local copy of math-neon with build script☆91Updated 6 years ago
- Parallel nonequispaced fast Fourier transforms☆16Updated 6 years ago
- Header-only C++ library implementing fast Fourier transform of 1D, 2D and 3D data.☆176Updated 4 years ago
- Flexible Library for Efficient Numerical Solutions☆127Updated 2 years ago
- The Fastest Fourier Transform in the South☆539Updated 5 months ago
- Header only FFT library☆169Updated last year
- http://www.kurims.kyoto-u.ac.jp/~ooura/fft.html☆34Updated 9 years ago
- A header only library implementing common mathematical functions using SIMD intrinsics☆95Updated this week
- Automatically exported from code.google.com/p/math-neon☆39Updated 9 years ago
- A simple demo shows how to use the SIMD,Single Instruction Multiple Data, to optimize and accelerate the FFT algorithm.☆33Updated 5 years ago
- ☆20Updated 6 years ago
- Generative Fast Fourier Transforms in C++ using template metaprogramming☆10Updated 8 years ago
- Some C++ codes for computing a 1D and 2D convolution product using the FFT implemented with the GSL or FFTW☆57Updated 11 years ago
- The Numerical Template Toolbox - C++ Scientific Computing Made Easy☆37Updated 9 years ago
- A simple, C99, header only, 0-Clause BSD Licensed, fast fourier transform (FFT).☆111Updated 5 months ago
- Agenium Scale vectorization library for CPUs and GPUs☆327Updated 3 years ago
- fast log and exp functions for x86/x64 SSE☆224Updated 3 months ago
- C++ class computing FFT on vectors of real numbers and their inverse FFT. Fairly optimized, free.☆51Updated 8 years ago
- The Fastest Fourier Transform in the South☆140Updated 2 years ago