Fast Fourier Transform
The Discrete Fourier Transform can be calculated with the Fast Fourier Transform algorithm.
fft() # complex values
rfft() # real values Advantages
- easy to build
- fast to deploy
- easy to maintain
- efficient & light resource
- able to detect Outlier in real time
- remove spikes and noise