This is just an anouncement that I have been working on a package for
performing non-equidistant fast Fourier transforms (NFFT). The package
should now be accessible using Pkg.add("NFFT"). Some basic usage examples
can be found here: https://github.com/tknopp/NFFT.jl
The NFFT (also known as Gridding or NUFFT) allows to apply Fourier
transforms where the sampling nodes in one of the domains are irregular.
One application can be found in magnetic resonance imaging (MRI)
reconstruction.
I initially wrote this to play with Julia and determine how close to C
speed one can get.
