Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the Discrete Fourier Transform (DFT) applied to signals of unlimited duration, emphasizing the need to limit their duration for accurate representation. Various windowing techniques like rectangular, parabolic, cosine, Hanning, and Hamming windows are discussed to approximate the DFT of signals with infinite duration.