The use of all of these transforms is greatly facilitated by the existence of efficient algorithms based on a fast Fourier transform (FFT). The Nyquist–Shannon sampling theorem is critical for understanding the output of such discrete transforms.