Home >  Term: fast Fourier transform (FFT)
fast Fourier transform (FFT)

An efficient method of computing the discrete Fourier transform algorithm, which transforms functions between the time domain and frequency domain. The time-to-frequency domain is called the forward transform, and the frequency-to-time domain is called the inverse transformation.

0 0

Creator

  • Dedrick
  •  (Gold) 1101 points
  • 100% positive feedback
© 2025 CSOFT International, Ltd.