sfft
0.1.0_15Optimized Sparse Fast Fourier Transform
sfft is a library to compute discrete Fourier transforms of signals with a sparse frequency domain, using an algorithm that is more efficient than other known FFT algorithms. It was developed by Haitham Hassanieh, Piotr Indyk, Dina Katabi, and Eric Price at the Computer Science and Artifical Intelligence Lab at MIT. Performance optimizations were developed by J. Schumacher at the Computer Science Department of ETH Zurich in 2013.
Origin: math/sfft
Category: math
Size: 312KiB
License: GPLv2
Maintainer: ports@FreeBSD.org
Dependencies: 2 packages
Required by: 0 packages
Website: spiral.net/software/sfft.html
$
pkg install sfftDependencies (2)
More in math
py311-numpy1.26.4_11,1
The New Numeric Extension to PythonR4.5.2
Language for statistical computing and graphicsgmp6.3.0
Free library for arbitrary precision arithmeticopenblas0.3.30,2
Optimized BLAS library based on GotoBLAS2fftw33.3.10_5
Fast C routines to compute the Discrete Fourier Transformpy311-matplotlib3.8.0_2
Plotting library uses a syntax familiar to MATLAB userspy311-pandas2.3.3,1
Flexible, high-performance data analysis in Pythonmpfr4.2.2,1
Library for multiple-precision floating-point computationsoctave10.3.0_2
High-level interactive language for numerical computationsoctave-forge-base1.9_1
Octave-forge baseport for all packages