Core Transformation
NUFDOOFFT maps into the frequency domain via:
\[ Y(f) = \sum_{m=0}^{M-1} X_m(f) e^{-i 2 \pi f t_m}\]NUFDOOFFT takes in a mildly frequency-dependent set of time-domain inputs, and then returns the Fourier non-uniform sum in the frequency domain. This is a very unique algorithm, and scales as order \(M + N\log N\), where \(M\) is the number of inputs and \(N\) is the number of Nyquist bins.