19
Discrete Fourier Transform
Discrete Fourier transform (DFT) is a powerful tool for frequency analysis of discrete time signals. It transforms discrete-time signal of finite length into discrete-frequency sequence of finite length. As we shall observe, the DFT can also be used to calculate Fourier coefficients.
19.1 APPROXIMATION OF FOURIER COEFFICIENTS OF A PERIODIC FUNCTION
Let f be a real-valued periodic function with period T over the interval [0, T]. We divide [0, T] into N subintervals In of equal length T/N. Thus
The linear interpolation ln(t) of f (t) is given by
Thus the graph (Figure 19.1) of ln(t) consists of the line segment ...
Get Engineering Mathematics now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
