Abstract
In this chapter, we describe fast algorithms for the computation of the DFT for d-variate nonequispaced data, since in a variety of applications the restriction to equispaced data is a serious drawback. These algorithms are called nonequispaced fast Fourier transforms and abbreviated by NFFT.
Cite
CITATION STYLE
APA
Plonka, G., Potts, D., Steidl, G., & Tasche, M. (2018). Fast fourier transforms for nonequispaced data. In Applied and Numerical Harmonic Analysis (pp. 377–419). Springer International Publishing. https://doi.org/10.1007/978-3-030-04306-3_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free