Goals For This Class Quickly review of the main results from last class Convolution and Cross-correlation Discrete Fourier Analysis: Important Considerations.

Slides:



Advertisements
Similar presentations
ECON 397 Macroeconometrics Cunningham
Advertisements

Digital Kommunikationselektronik TNE027 Lecture 5 1 Fourier Transforms Discrete Fourier Transform (DFT) Algorithms Fast Fourier Transform (FFT) Algorithms.
Thursday, October 12, Fourier Transform (and Inverse Fourier Transform) Last Class How to do Fourier Analysis (IDL, MATLAB) What is FFT?? What about.
1 Chapter 16 Fourier Analysis with MATLAB Fourier analysis is the process of representing a function in terms of sinusoidal components. It is widely employed.
1 LES of Turbulent Flows: Lecture 4 (ME EN ) Prof. Rob Stoll Department of Mechanical Engineering University of Utah Spring 2011.
Aristotle University of Thessaloniki – Department of Geodesy and Surveying A. DermanisSignals and Spectral Methods in Geoinformatics A. Dermanis Signals.
Cellular Communications
Fourier Transform – Chapter 13. Fourier Transform – continuous function Apply the Fourier Series to complex- valued functions using Euler’s notation to.
Sampling theorem, I  Suppose function h(t) is sampled at evenly spaced intervals in time; – 1/  : Sampling rate  For any sampling interval , there.
MSP15 The Fourier Transform (cont’) Lim, MSP16 The Fourier Series Expansion Suppose g(t) is a transient function that is zero outside the interval.
Image Enhancement in the Frequency Domain Part I Image Enhancement in the Frequency Domain Part I Dr. Samir H. Abdul-Jauwad Electrical Engineering Department.
Autumn Analog and Digital Communications Autumn
PROPERTIES OF FOURIER REPRESENTATIONS
Fourier Theory and its Application to Vision
Analogue and digital techniques in closed loop regulation applications Digital systems Sampling of analogue signals Sample-and-hold Parseval’s theorem.
Continuous-Time Signal Analysis: The Fourier Transform
CELLULAR COMMUNICATIONS DSP Intro. Signals: quantization and sampling.
EE513 Audio Signals and Systems Digital Signal Processing (Systems) Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Integral Transform Dongsup Kim Department of Biosystems, KAIST Fall, 2004.
DSP for Dummies aka How to turn this (actual raw sonar trace) Into this.. (filtered sonar data)
Discrete-Time and System (A Review)
1 Chapter 8 The Discrete Fourier Transform 2 Introduction  In Chapters 2 and 3 we discussed the representation of sequences and LTI systems in terms.
Outline 2-D Fourier transforms The sampling theorem Sampling Aliasing
Fourier Series Summary (From Salivahanan et al, 2002)
The Story of Wavelets.
EE D Fourier Transform. Bahadir K. Gunturk EE Image Analysis I 2 Summary of Lecture 2 We talked about the digital image properties, including.
Signals & Systems Lecture 11: Chapter 3 Spectrum Representation (Book: Signal Processing First)
Time Series Spectral Representation Z(t) = {Z 1, Z 2, Z 3, … Z n } Any mathematical function has a representation in terms of sin and cos functions.
1 The Fourier Series for Discrete- Time Signals Suppose that we are given a periodic sequence with period N. The Fourier series representation for x[n]
1 LES of Turbulent Flows: Lecture 2 Supplement (ME EN ) Prof. Rob Stoll Department of Mechanical Engineering University of Utah Fall 2014.
1 Fourier Representations of Signals & Linear Time-Invariant Systems Chapter 3.
EE104: Lecture 5 Outline Review of Last Lecture Introduction to Fourier Transforms Fourier Transform from Fourier Series Fourier Transform Pair and Signal.
Digital Image Processing Chapter 4 Image Enhancement in the Frequency Domain Part I.
Lecture 7: Sampling Review of 2D Fourier Theory We view f(x,y) as a linear combination of complex exponentials that represent plane waves. F(u,v) describes.
Chapter 6 Spectrum Estimation § 6.1 Time and Frequency Domain Analysis § 6.2 Fourier Transform in Discrete Form § 6.3 Spectrum Estimator § 6.4 Practical.
Fourier Analysis of Discrete Time Signals
revision Transfer function. Frequency Response
Lecture 7 Transformations in frequency domain 1.Basic steps in frequency domain transformation 2.Fourier transformation theory in 1-D.
2D Sampling Goal: Represent a 2D function by a finite set of points.
Fourier Transform.
Lecture 5 – 6 Z - Transform By Dileep Kumar.
2D Fourier Transform.
Eeng360 1 Chapter 2 Fourier Transform and Spectra Topics:  Fourier transform (FT) of a waveform  Properties of Fourier Transforms  Parseval’s Theorem.
Learning from the Past, Looking to the Future James R. (Jim) Beaty, PhD - NASA Langley Research Center Vehicle Analysis Branch, Systems Analysis & Concepts.
بسم الله الرحمن الرحيم University of Khartoum Department of Electrical and Electronic Engineering Third Year – 2015 Dr. Iman AbuelMaaly Abdelrahman
Fourier transform.
Fourier Transform and Spectra
The Fourier Transform.
Fourier Analysis Patrice Koehl Department of Biological Sciences National University of Singapore
EE422G Signals and Systems Laboratory Fourier Series and the DFT Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Lecture 19 Spectrogram: Spectral Analysis via DFT & DTFT
Signal Fndamentals Analogue, Discrete and Digital Signals
UNIT-II FOURIER TRANSFORM
Chapter 4 Discrete-Time Signals and transform
Integral Transform Method
MECH 373 Instrumentation and Measurements
LECTURE 11: FOURIER TRANSFORM PROPERTIES
Outline 2-D Fourier transforms The sampling theorem Sampling Aliasing
EE Audio Signals and Systems
Dr. Nikos Desypris, Oct Lecture 3
Laboratory in Oceanography: Data and Methods
Chapter 8 The Discrete Fourier Transform
Lecture 18 DFS: Discrete Fourier Series, and Windowing
Chapter 2 Discrete Fourier Transform (DFT)
Fourier Transform and Spectra
Chapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform
Chapter 3 Sampling.
Lec.6:Discrete Fourier Transform and Signal Spectrum
LECTURE 11: FOURIER TRANSFORM PROPERTIES
Presentation transcript:

Goals For This Class Quickly review of the main results from last class Convolution and Cross-correlation Discrete Fourier Analysis: Important Considerations Some examples: How to do Fourier Analysis (IDL, MATLAB) Windowed Fourier Transforms and Wavelets Tapering Coherency

Time (Space) Domain Frequency Domain From Last Class….. Fourier Transform (Spectral Analysis) Fourier Transform: Inverse Fourier Transform: The Fourier transform decomposes a function into a continuous spectrum of its frequency components (using sine and cosine functions), and the inverse transform synthesizes a function from its spectrum of frequency components

A time domain graph shows how a signal changes over time. Frequency Vs Time (Space Domain) A frequency domain graph shows how much of the signal lies within each given frequency band over a range of frequencies. A frequency domain representation can also include information on the phase shift that must be applied to each sinusoid in order to be able to recombine the frequency components to recover the original time signal.

Important Properties to remember Parseval’s Theorem Fourier Transform conserves variance!! Spectral Estimation Complex Conjugate Fourier Transform is a special case of Integral Transforms Kernel Function An integral transform "maps" an equation from its original "domain" to a different one.

Convolution The convolution of two functions is defined as Books also use… Convolution: expresses the amount of overlap of one function as it is shifted over another function. A convolution is a kind of very general moving average (weighted).

Convolution: Properties Derivation:

Cross-Correlation The cross-correlation of two functionsis defined as Relationship Between Convolution And Cross-Correlation In General if Spectral density

Discrete Fourier Transform In this case we do not have a continuous function but a time series. Time series: Sequence of data points, measured typically at successive times, separated by time intervals (often uniform). Sampling Interval DFT IDFT

Discrete Fourier Transform: Properties Fourier Transform of a real sequence of numbers results in a sequence of complex numbers of the same length. If is realand is real Parseval’s Theorem Nyquist Frequency: In order to recover all Fourier components of a periodic waveform (band- limited), it is necessary to use a sampling rate at least twice the highest waveform frequency. This implies that the Nyquist frequency is the highest frequency that can be resolved at a given sampling rate in a DFT Sampling rate Nyquist Freq. Similarly… Lowest Frequency?

Aliasing Aliasing is an effect that causes different continuous signals to become indistinguishable when sampled. Classic Example: Wagon wheels in old western movies Good example to do in MatLab or IDL!!

Leakage Spectral leakage appears due to the finite length of the time series (non integer number of periods, discontinuities, sampling is not and integer multiple of the period). Allow frequency components that are not present in the original waveform to “leak” into the DFT. How to handle this? Tapering

Matlab? IDL? How-To (see the code)