Discrete Fourier Transform
The Fourier Transform has wide applications in scientific computing and engineering. Although it has a continuous version, we will consider only the discrete version (DFT) and present what is commonly known as the Fast Fourier Transform (FFT) algorithm. The DFT can replace a set of n values with another set of n values that represents the same information in a different way that may be easier to work with in a particular application. Later, after the work has been performed, the transformation can be reversed.
KeywordsConvolution Sine Stein Rosen Fermat
Unable to display preview. Download preview PDF.