The nonequidistant fast Fourier transform (NFFT) is an extension of the famous fast Fourier transform (FFT) that can be applied to nonequidistantly sampled data in time/space or frequency domain. It is an approximative algorithm that allows one to control the approximation error in such a way that machine precision is reached while keeping the algorithmic complexity in the same order as a regular FFT. The NFFT plays a major role in many signal processing applications and has been intensively studied from a theoretical and computational perspective. The fastest CPU implementations of the NFFT are implemented in the low-level programming languages C and C++ and require a compromise between code generalizability, code readability, and code efficiency. The programming language Julia promises new opportunities in optimizing these three conflicting goals. In this work we show that Julia indeed allows one to develop an NFFT implementation which is completely generic and dimension-agnostic and requires about two to three times less code than the other famous libraries NFFT3 and FINUFFT while still being one of the fastest NFFT implementations developed to date.

The entire methodology is described in the paper "NFFT.jl: Generic and Fast Julia Implementation of the Nonequidistant Fast Fourier Transform" by Tobias Knopp, Marija Boberg, and Mirco Grosser, which you can find here. The Julia package NFFT.jl is available on GitHub.