Sankhyā: The Indian Journal of Statistics, Series A (2008-), Vol. 71, No. 2 (August 2009), pp. 221-259 (39 pages) Asymptotic distribution of the Discrete Fourier Transformation (DFT) of spatial data ...

A new algorithm performs Fourier transforms using a minimal number of samples. The fast Fourier transform, one of the most important algorithms of the 20th century, revolutionized signal processing.

Let $G$ be a semisimple real Lie group. Explicit formulas for discrete series characters on noncompact Cartan subgroups are given. These formulas are used to give a ...

As shown in the last subsection, kernel density estimates can be expressed as a submatrix of a certain convolution. The fast Fourier transform (FFT) is a computationally effective method for computing ...

Over at Quanta Magazine [Shalma Wegsman] asks What Is the Fourier Transform? [Shalma] begins by telling you a little about Joseph Fourier, the French mathematician with an interest in heat propagation ...