Using nonequispaced fast Fourier transformation to process optical coherence tomography signals

In OCT imaging the spectra that are used for Fourier transformation are in general not acquired linearly in k-space. Therefore one needs to apply an algorithm to re-sample the data and finally do the Fourier Transformation to gain depth information. We compare three algorithms (Non-Equispaced DFT, interpolated FFT and Non-Equispaced FFT) for this purpose in terms of speed and accuracy. The optimal algorithm depends on the OCT device (speed, SNR) and the object.