Search Results for "s-transform"

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.

Description and detailed explanation on Fourier Transform, some FFT, LPC etc. Runable project demonstrates DCT transform on continuous audio, show and edit audio source with different zooming and view.

...In the latest release MACE has got: + Sequences as variable containers and discrete signals. + A Signal Processing section including the (fast) (inverse) Fourier transform, several filters and fir / iir Systems + bug fixes

The Library is for Finite Transforms such as the Number Theoretic Transform (NTT) and Finite Radon Transform (FRT). Current modules include NTTW for NTTs with high resolution (microsecond) timing, basic array and imaging. The transforms are optimised for performance.

Main application is twofold: first to convert genotype SNP data into formats of different imputation tools like PLINK MACH, IMPUTE, BEAGLE and BIMBBAM, second to transform imputed data into different file formats like PLINK, HAPLOVIEW, EIGENSOFT and SNPTEST. Readable file formats: plink-pedigree (ped and map), plink-raw, plink-dosage, mach , minimac, impute, snptest, beagle and bimbam. Similarly all kinds of imputation of outputs are also accepted. Formats which can be generated by fcGENE: plink-pedigree, plink-raw, plink-dosage, mach-inputs, minimac-inputs, impute-inputs, beagle-inputs and bimbam-inputs, HAPLOVIEW-inputs, EIGENSOFT-inputs. ...

A collection of sparse Fourier transform codes developed by faculty at MSU. 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.)

ViennaCL provides high level C++ interfaces for linear algebra routines on CPUs and GPUs using CUDA, OpenCL, and OpenMP. The focus is on generic implementations of iterative solvers often used for large linear systems and simple integration into existing projects.

KL1p is a portable C++ framework for handling sparse recovery of inverse problems of underdetermined linear systems, like in compressed sensing technique.

A Qt library for Fast Fourier Transform (FFT) of real samples. Based on the FFTReal library.

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.

A library for fast computation of Gauss transforms in multiple dimensions, using the Improved Fast Gauss Transform and Approximate Nearest Neighbor searching. This library is useful for efficient Kernel Density Estimation (KDE) using a Gaussian kernel.

Continuous wavelet transform library

wxMorlet implements the new algorithm (see "Documentation") for the computation of the continuous wavelet transform with the Morlet wavelet. wxMorlet calculates it as a numerical solution of the proper PDE and represents the results in a graphical form

C++ template class library and Python modules for Computational Analytic Geometry, which define classes of geometry objects in 2D and 3D Cartesian coordinate system, such as line, circle, curve ... as well as relations and transform operations of them.