What kind of analysis of a signal is done using fft?
Answers
Answered by
0
Answer:
A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT). Fourier analysis converts a signal from its original domain (often time or space) to a representation in the frequency domain and vice versa.
Answered by
2
Answer:
A fast Fourier transform (FFT) in an algorithm that computes the discreet Fourier transform (DFF) of a sequence,or its inverse (IDFT). Fourier analysis converts a signal from its original domain (often time or space) to a
Similar questions