nfft-3

v 3.5.0

Fast C routines to compute the Non-equispaced Discrete Fourier Transform

NFFT3 is a software library written in C for computing nonequispaced fast Fourier and related transformations. In detail, NFFT3 implements 1) The nonequispaced fast Fourier transform (NFFT) - the forward transform (NFFT) - the adjoint transform (adjoint NFFT) 2) Generalisations of the NFFT - to arbitrary knots in time and frequency domain (NNFFT) - to the sphere S^2 (NFSFT) - to the hyperbolic cross (NSFFT) - to real-valued data, i.e. (co)sine transforms, (NFCT, NFST) - to the rotation group (NFSOFT) 3) Generalised inverses based on iterative methods, e.g. CGNR, CGNE 4) Applications in - medical imaging * magnetic resonance imaging * computerised tomography - summation schemes * fast Gauss transform (FGT) * singular kernels * zonal kernels - polar FFT, discrete Radon transform, ridgelet transform

NFFT3 is a software library written in C for computing nonequispaced fast Fourier and related transformations. In detail, NFFT3 implements 1) The nonequispaced fast Fourier transform (NFFT) - the forward transform (NFFT) - the adjoint transform (adjoint NFFT) 2) Generalisations of the NFFT - to arbitrary knots in time and frequency domain (NNFFT) - to the sphere S^2 (NFSFT) - to the hyperbolic cross (NSFFT) - to real-valued data, i.e. (co)sine transforms, (NFCT, NFST) - to the rotation group (NFSOFT) 3) Generalised inverses based on iterative methods, e.g. CGNR, CGNE 4) Applications in - medical imaging * magnetic resonance imaging * computerised tomography - summation schemes * fast Gauss transform (FGT) * singular kernels * zonal kernels - polar FFT, discrete Radon transform, ridgelet transform

+ Show more

http://www.nfft.org/