fast-fourier-transform repositories

Trending repositories tagged fast-fourier-transform, ranked by trending score. Updated daily.

  1. 1
    kfrlib/kfr

    Fast, modern C++ DSP framework, FFT, Sample Rate Conversion, FIR/IIR/Biquad Filters (SSE, AVX, AVX-512, ARM NEON, RISC-V RVV)

    GitHub · C++ · 1,940 stars · 287 forks · +4 stars in 24 hours · Trending score 1.49

  2. 2
    spatialaudio/signals-and-systems-lecture

    Continuous- and Discrete-Time Signals and Systems - Theory and Computational Examples

    GitHub · Jupyter Notebook · 389 stars · 95 forks · +4 stars in 24 hours · Trending score 1.14

  3. 3
    lab-cosmo/torch-pme

    Particle-mesh based calculations of long-range interactions in PyTorch

    GitHub · Python · 84 stars · 16 forks · 0 stars in 24 hours · Trending score 0.59

  4. 4
    robertrypula/AudioNetwork

    Data transmission over sound waves written in JavaScript without any dependencies. All you need is just microphone, speakers and the browser!

    GitHub · JavaScript · 212 stars · 28 forks · +1 stars in 24 hours · Trending score 0.45

  5. 5
    smu160/PhastFT

    A high-performance Fast Fourier Transform (FFT) library written in pure and safe Rust.

    GitHub · Rust · 315 stars · 16 forks · 0 stars in 24 hours · Trending score 0.01

  6. 6
    alphaparkinc/genpark-cooley-tukey-fast-fourier-transform-fft-skill

    Autonomous Agent Radix-2 Cooley-Tukey Fast Fourier Transform (FFT) & Inverse Spectral Synthesis Engine

    GitHub · Python · 8 stars · 0 forks · 0 stars in 24 hours · Trending score 0.00

  7. 7
    cpmech/gosl

    Linear algebra, eigenvalues, FFT, Bessel, elliptic, orthogonal polys, geometry, NURBS, numerical quadrature, 3D transfinite interpolation, random numbers, Mersenne twister, probability distributions, optimisation, differential equations.

    GitHub · Go · 1,887 stars · 148 forks · 0 stars in 24 hours · Trending score 0.00

  8. 8
    Swapnil-jain/integer-mult-kappa

    Integer multiplication below n log n: a conditional witness kappa = 6685733/10^10 (> 2^-11) for T(n) = O(n (log n)^(1-kappa)) in the multitape model, building on OpenAI's problem and Colkitt's integer-mult-bounds: certificates, independent replays, Lean 4 checks

    GitHub · Python · 27 stars · 3 forks · 0 stars in 24 hours · Trending score 0.00