1 / 7

For the previous examples we have

The previous example suggests that the discrete Fourier transform can be calculated using a matrix equation:. For the previous examples we have. x[n]= d [n]. x[n]= 1.

kirk-snider
Download Presentation

For the previous examples we have

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. The previous example suggests that the discrete Fourier transform can be calculated using a matrix equation:

  2. For the previous examples we have x[n]=d[n]

  3. x[n]=1

  4. In both cases the results are consistent with Fourier transforms: the Fourier transform of an impulse is a constant (white) spectrum, and the Fourier transform of a constant is an impulse in frequency domain (just a D.C. component). Suppose that we found the DFT of x[n] = {1 –1 1 –1}.

More Related