Fast Fourier Transform (FFT) is one of the most important algorithms in computer science, electronics and signal processing engineering. It is a fast solver for Discrete Fourier Transform (DFT). Basically, DFT or FFT transforms signals from time-amplitude domain to frequency-amplitude domain. The reverse form of the FFT is known as Inverse Fast Fourier Transform which converts, naturally, signals from frequency domain to time domain. FFT is heavily used in communication, radar or computer systems. For example OFDM (orthogonal frequency division multiplexing) is developed based on IFFT and FFT. Since Python is most common used scientific programming language beside Matlab, I would like to present some information about FFT and using it in Python. This blog post ( https://jakevdp.github.io/blog/2013/08/28/understanding-the-fft/ ) includes the basics of the FFT and very clear comparison of it to DFT. Another blog post ( https://www.ritchievink.com/blog/2017/04/23/understanding-t...
Artificial intelligence and machine learning applications in wireless communication networks - 6G and IoT Communication Systems