7.7 Fourier Transform Theorems, Part II

Slides:



Advertisements
Similar presentations
Math Review with Matlab:
Advertisements

Lecture 7: Basis Functions & Fourier Series
Chapter 5 The Fourier Transform. Basic Idea We covered the Fourier Transform which to represent periodic signals We assumed periodic continuous signals.
Fourier Transform – Chapter 13. Fourier Transform – continuous function Apply the Fourier Series to complex- valued functions using Euler’s notation to.
PROPERTIES OF FOURIER REPRESENTATIONS
Some Properties of the 2-D Fourier Transform Translation Distributivity and Scaling Rotation Periodicity and Conjugate Symmetry Separability Convolution.
EE-2027 SaS, L11 1/13 Lecture 11: Discrete Fourier Transform 4 Sampling Discrete-time systems (2 lectures): Sampling theorem, discrete Fourier transform.
Continuous-Time Fourier Methods
Fourier Series. is the “fundamental frequency” Fourier Series is the “fundamental frequency”
Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 4 Image Enhancement in the Frequency Domain Chapter.
Chapter 4 The Fourier Transform EE 207 Dr. Adil Balghonaim.
Topic 7 - Fourier Transforms DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.
Laplace Transform BIOE 4200.
Prof. Nizamettin AYDIN Digital Signal Processing 1.
GG 313 Lecture 26 11/29/05 Sampling Theorem Transfer Functions.
1 Let g(t) be periodic; period = T o. Fundamental frequency = f o = 1/ T o Hz or  o = 2  / T o rad/sec. Harmonics =n f o, n =2,3 4,... Trigonometric.
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Linearity Time Shift and Time Reversal Multiplication Integration.
CISE315 SaS, L171/16 Lecture 8: Basis Functions & Fourier Series 3. Basis functions: Concept of basis function. Fourier series representation of time functions.
Image Processing © 2002 R. C. Gonzalez & R. E. Woods Lecture 4 Image Enhancement in the Frequency Domain Lecture 4 Image Enhancement.
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Review Resources: Wiki: Superheterodyne Receivers RE: Superheterodyne.
The Continuous - Time Fourier Transform (CTFT). Extending the CTFS The CTFS is a good analysis tool for systems with periodic excitation but the CTFS.
Signal and Systems Prof. H. Sameti Chapter 5: The Discrete Time Fourier Transform Examples of the DT Fourier Transform Properties of the DT Fourier Transform.
Fourier Series. Introduction Decompose a periodic input signal into primitive periodic components. A periodic sequence T2T3T t f(t)f(t)
1 Fourier Representations of Signals & Linear Time-Invariant Systems Chapter 3.
Chapter 5: Fourier Transform.
Fundamentals of Electric Circuits Chapter 18 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Course Outline (Tentative) Fundamental Concepts of Signals and Systems Signals Systems Linear Time-Invariant (LTI) Systems Convolution integral and sum.
Linearity Recall our expressions for the Fourier Transform and its inverse: The property of linearity: Proof: (synthesis) (analysis)
Chapter 7 The Laplace Transform
EE 207 Dr. Adil Balghonaim Chapter 4 The Fourier Transform.
DTFT continue (c.f. Shenoi, 2006)  We have introduced DTFT and showed some of its properties. We will investigate them in more detail by showing the associated.
ABE 463 Electro-hydraulic systems Laplace transform Tony Grift
Frequency domain analysis and Fourier Transform
ENEE 322: Continuous-Time Fourier Transform (Chapter 4)
بسم الله الرحمن الرحيم Digital Signal Processing Lecture 3 Review of Discerete time Fourier Transform (DTFT) University of Khartoum Department of Electrical.
The Fourier Transform.
Fourier Transform and Spectra
Complex Form of Fourier Series For a real periodic function f(t) with period T, fundamental frequency where is the “complex amplitude spectrum”.
1.Be able to distinguish linear and non-linear systems. 2.Be able to distinguish space-invariant from space-varying systems. 3.Describe and evaluate convolution.
الفريق الأكاديمي لجنة الهندسة الكهربائية 1 Discrete Fourier Series Given a periodic sequence with period N so that The Fourier series representation can.
Lecture 7: Basis Functions & Fourier Series
Review of DSP.
LECTURE 11: FOURIER TRANSFORM PROPERTIES
Chapter 13 Integral transforms
Image Enhancement in the
Description and Analysis of Systems
UNIT II Analysis of Continuous Time signal
2D Fourier transform is separable
EE 638: Principles of Digital Color Imaging Systems
Advanced Digital Signal Processing
Notes Assignments Tutorial problems
Fundamentals of Electric Circuits Chapter 18
Fourier Transform and Spectra
Fourier Series September 18, 2000 EE 64, Section 1 ©Michael R. Gustafson II Pratt School of Engineering.
B.Sc. II Year Mr. Shrimangale G.W.
Example I: F.T. Integration Property
7.4 Fourier Transform Theorems, Part I
7.3 Even Basis Set Transforms
Fundamentals of Electric Circuits Chapter 15
7.2 Even and Odd Fourier Transforms phase of signal frequencies
8.1 Circuit Parameters definition of decibels using decibels
7.6 Odd Basis Set Transforms
7.9 Comb Basis Set Transform comb-to-comb transform
8.6 Autocorrelation instrument, mathematical definition, and properties autocorrelation and Fourier transforms cosine and sine waves sum of cosines Johnson.
Lesson Week 8 Fourier Transform of Time Functions (DC Signal, Periodic Signals, and Pulsed Cosine)
Digital Signal Processing
Review of DSP.
Chapter 5 The Fourier Transform.
LECTURE 11: FOURIER TRANSFORM PROPERTIES
Presentation transcript:

7.7 Fourier Transform Theorems, Part II We have already covered four theorems. The following three theorems will be covered in this section  shift theorem  derivative theorem  convolution theorem The autocorrelation theorem will be covered under electronics. 7.7 : 1/9

Shift Theorem The Fourier transform of a shifted variable is the transform of the un-shifted variable multiplied by a complex harmonic. Given, then, where t' is a constant. Proof: Start with the integral for the forward transform. Multiply the integrand by e+i2pft'e-i2pft'. Since dt = d(t-t') the previous integral can be written in the form of a forward transform. 7.7 : 2/9

Shift Theorem Example The Fourier transform of a single impulse at f = f 0 with amplitude, A, can be determined by the shift theorem. First write the transform pair for the single impulse function d(f=0). d(f=0)  C(t) = A Now write the transform of the impulse at f 0 using the shift theorem. d(f-f 0=0) « Aexp(-i2pf 0t) = Acos(2pf 0t)-iAsin(2pf 0t) The temporal result can be written as a phase shifted cosine. 7.7 : 3/9

Derivative Theorem Given, then, The theorem can be extended to multiple levels of differentiation. Proof: 7.7 : 4/9

Derivative Theorem Example What is the Fourier transform of the derivative of a cosine, cos(2pt/t 0)? Given, then, where, 7.7 : 5/9

Convolution Theorem Consider the following two Fourier transform pairs. Let a new function, C(t) be the convolution of F1(t) and F2(t). The convolution theorem gives the following relationships between the convolution and multiplication operators. This is the most important and useful theorem - the convolution of two functions in the time domain has a transform given by multiplication in the frequency domain. The theorem can eliminate the need to evaluate convolution integrals. 7.7 : 6/9

Theorem Proof Start by writing out the Fourier transform of the convolved function. Substitute the convolution integral for C(t). Let t - t' = T, and dt = dT. Finally, separate the double integral into a product of integrals. 7.7 : 7/9

Properties of Convolution Commutation: Distribution: Association: Combinations with multiplication: multiplication and convolution do not commute! A more complicated example: 7.7 : 8/9

Convolution Examples Gaussian: The convolution of two Gaussian functions is a Gaussian function, where the variance of the two convolved functions adds to give the variance of the result. In some cases it is more convenient to use the FWHM, G32 = G12 + G22. Impulse: The convolution of an impulse with any other function, replicates the function and centers it at the position of the impulse. For this reason, the impulse function is called a replicator. Comb: The convolution of a comb with any function with a size smaller than the comb spacing, replicates the function at the center of each comb impulse. Thus a comb function is a multiple copy replicator. 7.7 : 9/9