On the computation of the polar FFT

We show that the polar as well as the pseudo-polar FFT can be computed very accurately and efficiently by the well-known nonequispaced FFT. Furthermore, we discuss the reconstruction of a 2d signal from its Fourier transform samples on a (pseudo)polar grid by means of the inverse nonequispaced FFT.