Signal Transforms Including Fast Fourier Transform - FFT and Discrete Time Cosine Transforms - DCT

Fast Fourier Transform - FFT is widely used for many applications in engineering, science, and mathematics. FFT is an algorithm that is used to calculate frequency components of the input signal. FFT computes discrete Fourier transforms of an input sequence. It is very important to use an efficient algorithm for rapid calculations, and decrease algorithmic complexity from original O(n2) to effective O(nlogn).

MatDeck’s fft1() function rapidly calculates the DFT of the input sequence, with speed comparable to other leading mathematical software, achieving 0.5 secs for sequence lengths equal to one million samples . This speed is achieved using the "Build and Run Exe" option to execute the fft1() function. The ffti1() function is used to compute inverse discrete Fourier transform, and to move from the frequency domain to the time domain. The ffti1() function is realized using a very efficient algorithm as well. All MatDeck functions that rely on fft1() or ffti1() are efficient in an algorithmic sense.

There are several MatDeck examples that illustrate the use of FFT. The fft1() function can be called directly into a MatDeck Script. There is also a fft toolkit, where the fft is called from intuitive GUI. Finally, MatDeck offers several Templates which make the use of fft available in several clicks.