Fourier theory made easy A sine wave 5sin

  • Slides: 30
Download presentation
Fourier theory made easy (? )

Fourier theory made easy (? )

A sine wave 5*sin (2 4 t) Amplitude = 5 Frequency = 4 Hz

A sine wave 5*sin (2 4 t) Amplitude = 5 Frequency = 4 Hz seconds

A sine wave signal 5*sin(2 4 t) Amplitude = 5 Frequency = 4 Hz

A sine wave signal 5*sin(2 4 t) Amplitude = 5 Frequency = 4 Hz Sampling rate = 256 samples/second Sampling duration = 1 seconds

An undersampled signal

An undersampled signal

The Nyquist Frequency • The Nyquist frequency is equal to one-half of the sampling

The Nyquist Frequency • The Nyquist frequency is equal to one-half of the sampling frequency. • The Nyquist frequency is the highest frequency that can be measured in a signal.

Fourier series • Periodic functions and signals may be expanded into a series of

Fourier series • Periodic functions and signals may be expanded into a series of sine and cosine functions http: //www. falstad. com/fourier/j 2/

The Fourier Transform • A transform takes one function (or signal) and turns it

The Fourier Transform • A transform takes one function (or signal) and turns it into another function (or signal)

The Fourier Transform • A transform takes one function (or signal) and turns it

The Fourier Transform • A transform takes one function (or signal) and turns it into another function (or signal) • Continuous Fourier Transform: close your eyes if you don’t like integrals

The Fourier Transform • A transform takes one function (or signal) and turns it

The Fourier Transform • A transform takes one function (or signal) and turns it into another function (or signal) • Continuous Fourier Transform:

The Fourier Transform • A transform takes one function (or signal) and turns it

The Fourier Transform • A transform takes one function (or signal) and turns it into another function (or signal) • The Discrete Fourier Transform:

Fast Fourier Transform • The Fast Fourier Transform (FFT) is a very efficient algorithm

Fast Fourier Transform • The Fast Fourier Transform (FFT) is a very efficient algorithm for performing a discrete Fourier transform • FFT principle first used by Gauss in 18? ? • FFT algorithm published by Cooley & Tukey in 1965 • In 1969, the 2048 point analysis of a seismic trace took 13 ½ hours. Using the FFT, the same task on the same machine took 2. 4 seconds!

Famous Fourier Transforms Sine wave Delta function

Famous Fourier Transforms Sine wave Delta function

Famous Fourier Transforms Gaussian

Famous Fourier Transforms Gaussian

Famous Fourier Transforms Sinc function Square wave

Famous Fourier Transforms Sinc function Square wave

Famous Fourier Transforms Sinc function Square wave

Famous Fourier Transforms Sinc function Square wave

Famous Fourier Transforms Exponential Lorentzian

Famous Fourier Transforms Exponential Lorentzian

FFT of FID

FFT of FID

FFT of FID

FFT of FID

FFT of FID

FFT of FID

Effect of changing sample rate

Effect of changing sample rate

Effect of changing sample rate

Effect of changing sample rate

Effect of changing sample rate • Lowering the sample rate: – Reduces the Nyquist

Effect of changing sample rate • Lowering the sample rate: – Reduces the Nyquist frequency, which – Reduces the maximum measurable frequency – Does not affect the frequency resolution

Effect of changing sampling duration

Effect of changing sampling duration

Effect of changing sampling duration

Effect of changing sampling duration

Effect of changing sampling duration • Reducing the sampling duration: – Lowers the frequency

Effect of changing sampling duration • Reducing the sampling duration: – Lowers the frequency resolution – Does not affect the range of frequencies you can measure

Effect of changing sampling duration

Effect of changing sampling duration

Effect of changing sampling duration

Effect of changing sampling duration

Measuring multiple frequencies

Measuring multiple frequencies

Measuring multiple frequencies

Measuring multiple frequencies

Some useful links • • • http: //www. falstad. com/fourier/ – Fourier series java

Some useful links • • • http: //www. falstad. com/fourier/ – Fourier series java applet http: //www. jhu. edu/~signals/ – Collection of demonstrations about digital signal processing http: //www. ni. com/events/tutorials/campus. htm – FFT tutorial from National Instruments http: //www. cf. ac. uk/psych/Culling. J/dictionary. html – Dictionary of DSP terms http: //jchemed. chem. wisc. edu/JCEWWW/Features/Mcad. In. Chem/mcad 008/FT 4 Free. Ind. Decay. pdf – Mathcad tutorial for exploring Fourier transforms of free-induction decay http: //lcni. uoregon. edu/fft. ppt – This presentation