1 / 16

Life in the frequency domain

Life in the frequency domain. Jean Baptiste Joseph Fourier (1768-1830). Spectrogram, Northern Cardinal. Sampling. Sampling. Example: CD rate f = 44,100 Hz , so the highest frequency that can be represented is 22,050 Hz. Called Nyquist frequency = ½ cycle/sample = f/ 2 Hz.

loki
Télécharger la présentation

Life in the frequency domain

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. Life in the frequency domain Jean Baptiste Joseph Fourier (1768-1830)

  2. Spectrogram, Northern Cardinal

  3. Sampling

  4. Sampling Example: CD rate f = 44,100 Hz, so the highest frequency that can be represented is 22,050 Hz Called Nyquist frequency = ½ cycle/sample = f/2Hz

  5. Sampling and aliasing Aliasing a sine wave:

  6. One frequency can masquerade as another • When viewed as a strobed phasor, it’s easy to see that we need to sample at least twice each period to capture the frequency unambiguously • Nyquist’s theorem: Highest allowed signal frequency is half the sampling frequency = Nyquist frequency

  7. Aliasing strikes!

  8. Prefiltering: avoids aliasing on A-to-D • Oversampling: can substitute cheap digital filtering for expensive analog filtering for A-to-D or D-to-A conversion

  9. The Discrete Fourier Transform(DFT) representation transform Frequencies on circle

  10. Johann Carl Friedrich Gauss(1777-1855) Heideman, Johnson, Burrus (1985)

  11. The FFT Divide-and-conquer algorithm for DFT Yields O(N log N) algorithm

  12. FFT Butterfly

  13. A once-a-minute application: JPEG Discrete Cosine Transform (DCT) Steven W. Smith's Book (1997)

More Related