Fast Fourier Transform (FFT) Definition/Meaning:
An algorithm that computes the discrete Fourier
transform accurately and efficiently on digital computers. FFT techniques have
wide applicability in linear systems, optics, probability theory, quantum
physics, antennas, and signal analysis.
|