Search Results for "fft"
Sort By:
Showing 22 open source projects for "fft"
View related business solutions-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
1
Armadillo
fast C++ library for linear algebra & scientific computing
* Fast C++ library for linear algebra (matrix maths) and scientific computing * Easy to use functions and syntax, deliberately similar to Matlab / Octave * Uses template meta-programming techniques to increase efficiency * Provides user-friendly wrappers for OpenBLAS, Intel MKL, LAPACK, ATLAS, ARPACK, SuperLU and FFTW libraries * Useful for machine learning, pattern recognition, signal processing, bioinformatics, statistics, finance, etc. * Downloads:... -
2
FFTW++ is a C++ header class for the FFTW Fast Fourier Transform library that automates memory allocation, alignment, planning, wisdom, and communication on both serial and parallel (OpenMP/MPI) architectures. In 2D and 3D, hybrid dealiasing of convolutions substantially reduces memory usage and computation time. Wrappers for C, Python, and Fortran are included.
-
3
Advanced Trigonometry Calculator
Precision Trigonometry: Advanced Calculator for Complex Math
Advanced Trigonometry Calculator is equipped with a user-friendly interface that allows for easy input of problems and instant computation. Professionals such as engineers who need to perform advanced trigonometric calculations in their work will find this tool extremely useful. ATC Online Alpha: https://advantrigoncalc.sourceforge.io/atc/ More info by clicking below: https://advantrigoncalc.sourceforge.io/ Advanced Trigonometry Calculator was only and always only developed by... -
4
libdspl-2.0
libdspl-2.0 is opensource cross-platform digital signal processing alg
libdspl-2.0 — opensource cross-platform digital signal processing algorithm library, written in C language. Distributed under LGPL v3 license. This allows to use this library in all applications with dynamic linking. -
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
5
AlphaPlot
Interactive scientific graphing and data analysis software.
...The spreadsheets as well as graphs and note windows are gathered in a project and can be organized using folders. The built-in analysis operations include column/row statistics, (de)convolution, FFT and FFT-based filters. Scripting Console support in-place evaluation of mathematical expressions and scrtipting interface to ECMAScript like dynamic scripting language(java script). The GUI of the application uses the Qt toolkit. Periodic test builds are available here http://alphaplot.sourceforge.net/test-build.html -
6
Command line FFT
A simple command line utility to produce an FFT/IFFT of ASCII data
Ever had a bunch of ASCII data that you would like to have a quick look at in frequency domain, but don't want to fire up some bulky analysis software package just for that? Well, I have... So I wrote this tiny tool. It is based on fftw (www.fftw.org) and boost's program options (boost.org). cli-fft is really simple: All it does is to receive ASCII data from a file or standard in, FFT it and write out the result into a file or to standard out. -
7
MSU's Sparse Fourier Repository
The Home of DMSFT, AAFFT, GFFT, and MSFFT.
...Currently codes for four different prototype sparse FFTs are here: 1.) DMSFT, implemented by Ruochuan Zhang. This is a fast, stable, noise robust, and *fully discrete* improvement on the ideas in GFFT below. It is THE BEST sparse FFT around!!! If you're looking for AAFFT, try this out first. 2.) AAFFT, implemented by Mark Iwen in 2008. This code is easy to use, and documented well, but not implemented very efficiently. It is much slower than it should be. 3.) GFFT, implemented by Ben Segal and Mark Iwen. This code is less easy to use, and also not terribly efficient. ... -
8
Generic simple and efficient Fast Fourier Transforms (FFT) implementation using policy-based design and template metaprogramming in C++
-
9
math lib for .NET. n-dim arrays, complex numbers, linear algebra, FFT, sorting, cells- and logical arrays as well as 3D plotting classes help developing algorithms on every platform supporting .NET. Sources from SVN, binaries: http://ilnumerics.net
-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
10
EMsieve
A simple sieve/prefactor program for Eisenstein-Mersenne Primes
...Related probable primes (3^p -+ 3^((p + 1)/2) + 1)/7 are sieved at the same time. See http://oeis.org/A125743, A125744. After sieving, the Berrizbeitia-Iskra or a Proth test can be run; this is best implemented with FFT mod (3^3p+1) using GWNUM library. A sample implementation (a patch to the LLR program) is available from Batalov. [1] P.Berrizbeitia B.Iskra, 2010; http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.189.311 [2] OEIS: http://oeis.org/ -
11
QRealFourier
Qt-based FFT implementation
A Qt library for Fast Fourier Transform (FFT) of real samples. Based on the FFTReal library. -
12
The FFT library to "Keep It Simple, Stupid" This is the original home of kissfft. Most recent development is at https://github.com/mborgerding/kissfft Please ask questions on stackoverflow.com
-
13
An implementation of the sparse FFT algorithms discovered by Mark Iwen and described in http://www.math.duke.edu/~markiwen/DukePage/Papers/JcFFTsubmit.pdf. Used for benchmarking in http://www.ima.umn.edu/preprints/jul2010/2326.pdf.
-
14
JTransforms is the first, open source, multithreaded FFT library written in pure Java. Benchmark results show better performance than FFTW. The latest version is available at http://github.com/wendykierp/JTransforms.
-
15
Program that does an FFT (Fast Fourier Transformation) algorithm on a 1 dimensional time buffer read from a file. It will display graphically.
-
16
Low-latency high speed hybrid framework-library for utilizing the IBM Cell processor SPE units (PS3, QS20) to carry out computational tasks. Provides some DSP tasks such as FFT and complex MAC. Thread-safe and easily extensible with new arithmetics tasks
-
17
A C++ Matrix/Vector Class supporting real & complex data for nearly all matrix algebra calculations. Optimized for double & std::complex<double>. Small and large matrices. Easy to use & get started. Plotting, fast inversion, FFT/IFFT, statistics, & more
-
18
GENIAL is a C++ library for signal and image processing. It uses template-generic techniques, multi threading, cache optimization and SIMD instructions for Pentium (MMX, SSE, SSE2, SSE3) to achieve high performance: FFT,DCT,Convolution,Linear Algebra...
-
19
Glucas is a client to make primality test for Mersenne numbers. It is related to GIMPS effort to search the bigest primes ever found. In addition, it can be used as an excellent performance test. Posix thread, OpenMP and SunMP compatible
-
20
ObjC framework for mathematical operations. Various DSP (inc. FFT + wavelet), statistical operations and more on vector and array types. Optimized for SIMD and multi-threading where possible.
-
21
Port of Numerical Python to Jython (Java Python) to support all mathematical operations (linear algebra, matrices, DSP, wavelets, FFT, arrays...) and thus compete with commercial packages such as Matlab. It can be easily embedded in Java programs.
-
22
The Arbitrarily-Decomposed MPI FFT library is a C subroutine library for the computation of the multidimensional Fast Fourier Transform (FFT) of a distributed grid using the Message-Passing Interface (MPI).
- Previous
- You're on page 1
- Next
