In this video, it demonstrates how to compute the Discrete Fourier Transform (DFT) for the given Discrete time sequence x (n)= {0,1,2,3}
The Discrete Fourier Transform (DFT) and its Inverse (IDFT) are core techniques in digital signal processing. They convert signals between the time or spatial domain and the frequency domain, revealing frequency components in data.
Write a function DFT (x) which takes in one argument, x - input 1 dimensional real-valued signal. The function will calculate the DFT of the signal and return the DFT values.