A group of MIT researchers believe they’ve found a way to speed up audio, video, and image compression by improving on the Fourier Transform. They say the new algorithm is up to ten times faster than ...

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.

For a large range of practically useful cases, MIT researchers find a way to increase the speed of one of the most important algorithms in the information sciences. The Fourier transform is one of the ...

This paper introduces new techniques for the efficient computation of a Fourier transform on a finite group. We present a divide and conquer approach to the computation. The divide aspect uses ...

Sparse Fourier Transform (SFT) algorithms constitute a transformative approach to spectral analysis by leveraging the inherent sparsity of signals in the frequency domain. In contrast to the ...

Researchers have developed a new algorithm that, in a large range of practically important cases, improves on the fast Fourier transform. Under some circumstances, the improvement can be dramatic -- a ...

The Fast Fourier Transform (FFT) is an implementation of the Discrete Fourier Transform (DFT) using a divide-and-conquer approach. A DFT can transform any discrete signal, such as an image, to and ...

In this paper we describe a method for computing the Discrete Fourier Transform (DFT) of a sequence of $n$ elements over a finite field $\mathrm{GF}(p^m)$ with a ...