Search Results for "fft"

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.

* 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:...

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.

...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

...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. ...

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

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

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.

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.

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

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

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.

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.

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).