Fourier Transform – Chapter 13. Fourier Transform – continuous function Apply the Fourier Series to complex- valued functions using Euler’s notation to.

Slides:



Advertisements
Similar presentations
DCSP-11 Jianfeng Feng
Advertisements

The Fourier Transform I
ECON 397 Macroeconometrics Cunningham
3-D Computational Vision CSc Image Processing II - Fourier Transform.
Symmetry and the DTFT If we know a few things about the symmetry properties of the DTFT, it can make life simpler. First, for a real-valued sequence x(n),
Sampling theory Fourier theory made easy
Fourier Transform – Chapter 13. Image space Cameras (regardless of wave lengths) create images in the spatial domain Pixels represent features (intensity,
Aristotle University of Thessaloniki – Department of Geodesy and Surveying A. DermanisSignals and Spectral Methods in Geoinformatics A. Dermanis Signals.
IT-101 Section 001 Lecture #8 Introduction to Information Technology.
Leo Lam © Signals and Systems EE235. Fourier Transform: Leo Lam © Fourier Formulas: Inverse Fourier Transform: Fourier Transform:
Reminder Fourier Basis: t  [0,1] nZnZ Fourier Series: Fourier Coefficient:
Sep 15, 2005CS477: Analog and Digital Communications1 Modulation and Sampling Analog and Digital Communications Autumn
CSCE 641 Computer Graphics: Image Sampling and Reconstruction Jinxiang Chai.
MSP15 The Fourier Transform (cont’) Lim, MSP16 The Fourier Series Expansion Suppose g(t) is a transient function that is zero outside the interval.
Sampling (Section 4.3) CS474/674 – Prof. Bebis. Sampling How many samples should we obtain to minimize information loss during sampling? Hint: take enough.
General Functions A non-periodic function can be represented as a sum of sin’s and cos’s of (possibly) all frequencies: F(  ) is the spectrum of the function.
CSCE 641 Computer Graphics: Image Sampling and Reconstruction Jinxiang Chai.
EECS 20 Chapter 10 Part 11 Sampling and Reconstruction Last time we Viewed aperiodic functions in terms of frequency components via Fourier transform Gained.
EE-2027 SaS, L10: 1/13 Lecture 10: Sampling Discrete-Time Systems 4 Sampling & Discrete-time systems (2 lectures): Sampling theorem, discrete Fourier transform.
Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform.
EE D Fourier Transform.
Sampling of Continuous-Time Signals
First semester King Saud University College of Applied studies and Community Service 1301CT.
The Nyquist–Shannon Sampling Theorem. Impulse Train  Impulse Train (also known as "Dirac comb") is an infinite series of delta functions with a period.
Sampling of Continuous Time Signal Section
Systems: Definition Filter
Goals For This Class Quickly review of the main results from last class Convolution and Cross-correlation Discrete Fourier Analysis: Important Considerations.
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean 5403 T-R 3:00pm – 4:20pm.
Topic 7 - Fourier Transforms DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.
Fourier representation for discrete-time signals And Sampling Theorem
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.
Signals and Systems Jamshid Shanbehzadeh.
EE D Fourier Transform. Bahadir K. Gunturk EE Image Analysis I 2 Summary of Lecture 2 We talked about the digital image properties, including.
Outline  Fourier transforms (FT)  Forward and inverse  Discrete (DFT)  Fourier series  Properties of FT:  Symmetry and reciprocity  Scaling in time.
Chapter 4 Fourier transform Prepared by Dr. Taha MAhdy.
Zhongguo Liu_Biomedical Engineering_Shandong Univ. Chapter 8 The Discrete Fourier Transform Zhongguo Liu Biomedical Engineering School of Control.
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.
Digital Image Processing DIGITIZATION. Summery of previous lecture Digital image processing techniques Application areas of the digital image processing.
Chapter 2 Signals and Spectra (All sections, except Section 8, are covered.)
Fourier Analysis of Discrete Time Signals
Astronomical Data Analysis I
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.
Sampling of Continuous-Time Signals Quote of the Day Optimist: "The glass is half full." Pessimist: "The glass is half empty." Engineer: "That glass is.
ABE425 Engineering Measurement Systems Fourier Transform, Sampling theorem, Convolution and Digital Filters Dr. Tony E. Grift Dept. of Agricultural.
Lecture 3: The Sampling Process and Aliasing 1. Introduction A digital or sampled-data control system operates on discrete- time rather than continuous-time.
2D Fourier Transform.
The Fourier Transform.
Mathematical groundwork I: Fourier theory
Sampling (Section 4.3) CS474/674 – Prof. Bebis.
UNIT-II FOURIER TRANSFORM
Integral Transform Method
Lecture Signals with limited frequency range
(C) 2002 University of Wisconsin, CS 559
Dr. Nikos Desypris, Oct Lecture 3
General Functions A non-periodic function can be represented as a sum of sin’s and cos’s of (possibly) all frequencies: F() is the spectrum of the function.
لجنة الهندسة الكهربائية
Chapter 2. Fourier Representation of Signals and Systems
Fourier Transform Analytic geometry gives a coordinate system for describing geometric objects. Fourier transform gives a coordinate system for functions.
Fourier Transform Analytic geometry gives a coordinate system for describing geometric objects. Fourier transform gives a coordinate system for functions.
CSCE 643 Computer Vision: Image Sampling and Filtering
Signals & Systems (CNET - 221) Chapter-5 Fourier Transform
Signals and Systems Revision Lecture 2
Lesson Week 8 Fourier Transform of Time Functions (DC Signal, Periodic Signals, and Pulsed Cosine)
Signals & Systems (CNET - 221) Chapter-4
Chapter 3 Sampling.
Lecture 7: Signal Processing
Lecture 6: Fourier Transform
DIGITAL CONTROL SYSTEM WEEK 3 NUMERICAL APPROXIMATION
Presentation transcript:

Fourier Transform – Chapter 13

Fourier Transform – continuous function Apply the Fourier Series to complex- valued functions using Euler’s notation to get the Fourier Transform And the inverse Fourier Transform

Discrete Signals Next time

Sampling Conversion of a continuous function to a discrete function What does this have to do with the Fourier Transform? –Procedurally – nothing –Analytically – places constraints

Impulse function It all starts with the Dirac (delta) function we looked at previously Area “under” the signal is 1 –Infinitely tall –Infinitesimally narrow –Practically impossible for x ≠ 0

Sampling with the impulse function Multiply the continuous function with the delta function… results in the continuous function at position 0

Sampling with the impulse function Multiply the continuous function with the delta function shifted by x 0 … results in the continuous function at position x 0

Sampling with the impulse function Sampling two points at a time… For N points at a time…

The comb function

Sampling (pointwise multiplication) with Shah (comb function) provides all the sampled points of the original continuous signal at one time The sampling interval can be controlled as follows

The comb function and sampling The Fourier Transform of a comb is a comb function (same situation as we saw with the Gaussian) Combine this with the convolution property of the Fourier Transform The result is that the frequency spectrum of the [original] continuous function is replicated infinitely across the frequency spectrum

The comb function and sampling If the continuous function contains frequencies less than ω max and… the sampling frequency (distance between delta functions of the comb) is at least twice ω max … then all is OK This is referred to as the Nyquist Theorem

The comb function and aliasing If the continuous function contains frequencies less than ω max and… the sampling frequency (distance between delta functions of the comb) is less than twice ω max … then all is you get aliasing This violates the Nyquist Theorem

Aliasing Means the original, continuous signal cannot be uniquely recovered from the sampled signal’s spectrum (Fourier Transform) –Basically, this means there are not enough points in the sampled wave form to accurately represent the continuous signal

Aliasing

Discrete Fourier Transform Now that we know how to properly transform a continuous function to a discrete function (sample) we need a discrete version of the Fourier Transform

Discrete Fourier Transform Forward Inverse M is the length (number of discrete samples)