A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform of a sequence. Decomposing an N-point time domain signal into sequence of single points. The N-spectra are synthesized into a single frequency spectrum.
Geek Repo:Geek Repo
Github PK Tool:Github PK Tool
