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

  • Harry8L
  • (London, United Kingdom)

  •  (V.I.P) 574128 points
  • 100% positive feedback
© 2025 CSOFT International, Ltd.