Basic FAQ for FFT Analyzer

FFT is an abbreviation for Fast Fourier Transform (F ast F ourier T ransform), which is an algorithm for performing the Discrete Fourier Transform (DFT) quickly in digital signal processing. Also, DFT refers to the technique of transforming finite digital signals using Fourier transform.

By utilizing FFT technology, it becomes possible to perform real-time frequency analysis of time signals.

FFT is used in binary computers and DSP (D igital S ignal P rocessor), so the finite number of data for FFT is usually a power of 2 (that is, base 2).