Lecture 1 January 5, 2016

Size: px
Start display at page:

Download "Lecture 1 January 5, 2016"

Transcription

1 MATH 262/CME 372: Applied Fourier Analysis and Winter 26 Elements of Modern Signal Processing Lecture January 5, 26 Prof. Emmanuel Candes Scribe: Carlos A. Sing-Long; Edited by E. Candes & E. Bates Outline Agenda: Fourier Integrals. Time-invariant operators 2. Convolutions 3. Continuous-time Fourier transform 4. Fourier transforms of simple functions 2 Time-invariant linear operators Here we consider signals f = f(t) with t T where typically T = Z or R. We will be interested in linear mappings f g = Lf. This map can be represented in discrete time as g(t) = u Z K(t, u)f(u), and in continuous time as g(t) = R K(t, u)f(u) du. Without fear of confusion, we will drop the R in the integral above. An important example is the time-shift operator f f τ where f τ (t) = f(t τ). An operator L is called a time-invariant operator (TIO) if g τ = (Lf) τ is equal to Lf τ. In other words, Input delayed by τ = Output delayed by τ. Examples: Electrical circuits Linear filtering Derivatives (Lf = f )

2 3 Convolutions The convolution product in R is defined as (f g)(t) = f(u)g(t u) du. The convolution product is (i) Commutative: f g = g f for any f, g. (ii) Associative: (f g) h = f (g h) for any f, g, h. For fixed h we can define the convolution operator f g = h f. Roughly speaking, the output g is the local averages of the input f, weighted by the function h. For instance, when h is a Gaussian curve, g is a smoothed version of f. A convolution operator is a TIO. Indeed, (Lf τ )(t) = = R R L f(u τ)h(t u) du f(u)h((t τ) u) du = (f h)(t τ) = (Lf) τ (t). Conversely, every TIO is a convolution operator. To see this, we write g(t) = h(t, u)f(u) du. This is the continuous analog of a matrix-vector product. To prove the claim, consider on one hand g τ (t) = (Lf) τ (t) = h(t τ, u)f(u) du. () On the other, consider (Lf τ )(t) = h(t, u)f τ (u) du = h(t, u)f(u τ) du = h(t, u + τ)f(u) du. (2) Since L is a TIO, g τ = Lf τ and so () and (2) yield h(t τ, u)f(u) du = h(t, u + τ)f(u) du = (h(t τ, u) h(t, u + τ))f(u) du, for any f. In turn h(t, u + τ) = h(t τ, u) for t R. Consequently h(t, u) = h( ( t), u) = h(, u t) = h(t u) 2

3 is a function of only the difference t u. We now see that L is a convolution operator (Lf)(t) = h(t u)f(u) du. (3) In (3), h is referred to as the convolution kernel. In application, this kernel is often called the impulse-response function, for reasons we will see below. In optics and imaging, h is also called the point spread function (PSF). When observing a very localized and bright spot, similar to a physical realization of an impulse, we observe a blurred source; this blurred image is the convolution kernel of the system (c.f. Airy disk). 3. Response to impulse (a) T = Z: In this domain, the impulse is the function δ defined as { t =, δ(t) = t. We have and f, δ = u Z f(u)δ(u) = f(), (f δ)(t) = u Z f(u)δ(t u) = f(t), from which it follows that f δ = f. That is, the impulse is the identity of the convolution product. When we apply a TIO L to the impulse, we obtain Lδ = h δ = h, meaning the convolution kernel h is the response to the impulse δ. The name impulse-repsonse is thus fitting. (b) T = R: In this case the impulse is the Dirac delta function δ, which is better called a distribution or generalized function. In analog to the discrete case, we define f, δ = f(u)δ(u) du = f(), and (f δ)(t) = f(u)δ(t u) du = f(t). In the language of probability, then, δ is a point mass of weight at t =. Applying a TIO L to the impulse yields Lδ = h δ = h, and once again we see the convolution kernel is the response to the impulse δ. 3

4 3.2 Transfer functions When a TIO acts on a complex exponential f(t) = e iωt it has the form Lf(t) = h(u) e iω(t u) du = e iωt h(u) e iωu du = ĥ(ω) eiωt. }{{} This is a very simple action! In fact, the TIO acts as multiplication. This says that complex exponentials are eigenvectors of TIOs with eigenvalues ĥ(ω) = h(u) e iωu du. (4) ĥ(ω) The function ĥ of frequency ω is called the transfer function. Notice that ĥ(ω) is just the inner (dot) product of h with the trigonometric exponential function e iωu. Given how easy it is to understand the action of TIOs on complex exponentials, it is tempting to decompose any signal f as a superposition of these eigenvectors. Amazingly, Fourier analysis shows that this is possible! 3.3 Causal filter A TIO is said to be causal if Lf(t) does not depend of the values f(u) for u > t. From this we deduce that g(t) = h(u)f(t u) du = h(u) = for u <, that is, the transfer function of a causal TIO vanishes over negative numbers. 4 Fourier integrals Motivated by the form of the transfer function (4), we make the following definition: Definition. The Fourier transform of a function f L (R) is defined as ˆf(ω) = f(t) e iωt dt. Note: There are other possible normalizations. For instance, one could instead define ˆf(ω) = f(t) e 2πiωt dt. Because f L (R), the integral converges to make ˆf well-defined: ˆf(ω) = f(t)e iωt dt f(t)e iωt dt = f(t) dt <. 4

5 f(t) ˆf(ω) Figure : Fourier transform pair for the boxcar function Exercise: Show that ˆf is continuous as a function of ω. 4. Fourier integrals of simple functions Let us compute the Fourier transforms of some common signals. (i) Boxcar: By direct computation when ω, ˆf(ω) = /2 /2 f(t) = e iωt dt = { t [ 2, 2 ], otherwise. iω e iωt /2 /2 = sin(ω/2). ω/2 And when ω =, ˆf() = /2 /2 dt =. We can express this result in terms of a useful function we will see many times during this course: the sinc function is given by { sin(πt) sinc(t) = πt, t,, t =. In this notation, we have ˆf(ω) = sinc(ω/2π). 5

6 f(t) ˆf(ω) Figure 2: Fourier transform pair for the triangle function (ii) Triangle: f(t) = { t t [, ], otherwise. Once again by direct computation, when ω, And ˆf() = = sinc 2 (). ˆf(ω) = = 2 f(t) cos(ωt) dt ( t) cos(ωt) dt = 2( t) sin(ωt) ω = 2 ( cos ω) ω2 = 4 sin(ω/2)2 ω 2 = sinc 2 (ω/2π). + 2 ω sin(ωt) dt (iii) Gaussian bell curve: f(t) = 2π e t2 /2 Note that R f(t) dt =, making f(t) a valid probability density. Its Fourier transform is ˆf(ω) = e ω2 /2. Here we outline two ways to obtain it. 6

7 Complex variable arguments: We can extend f as an analytic function f : C C with f(z) = e z2 /2. Therefore the integral over the contour Γ (see Fig. 4) is such that f(z) dz =, and Γ f(z) dz = ( Γ + Γ + Γ + Γ ) Γ f(z) dz = L L ( L ) f(t) dt f(t+iω) dt+ + f(z) dz. L Γ Γ By enlarging Γ so that Γ and Γ go to infinity (that is, taking the limit L ) the corresponding integrals tend to zero (since f(a + bi) = e (a+bi)2 /2 = e b2 a 2 tends to zero as a ± and b remains fixed). Then using the fact that f(t + iω) = f(t) e ω2 /2 e iωt, we obtain ( ) = f(t) dt e ω2 /2 f(t) e iωt dt = ˆf(ω) = f(t) dt e ω2 /2 = e ω2 /2. A differential equation: A direct computation shows that ˆf(ω) = 2π e t2 /2 e iωt dt and ˆf (ω) = 2π = ω 2π ( it) e t2 /2 e iωt dt e t2 /2 e iωt dt, and consequently ˆf (ω) = ω ˆf(ω). Therefore (log ˆf(ω)) = ω = ˆf(ω) = ˆf() e ω2 /2. Since ˆf() =, we obtain ˆf(ω) = e ω2 /2 as before. We will see later that the Heisenberg Uncertainty Principle is a consequence of this important example. 7

8 f(t) ˆf(ω) Figure 3: Fourier transform pair for the Gaussian bell function C! # " L! Figure 4: Contour of integration +L 8

Lecture 6 January 21, 2016

Lecture 6 January 21, 2016 MATH 6/CME 37: Applied Fourier Analysis and Winter 06 Elements of Modern Signal Processing Lecture 6 January, 06 Prof. Emmanuel Candes Scribe: Carlos A. Sing-Long, Edited by E. Bates Outline Agenda: Fourier

More information

Lecture 9 February 2, 2016

Lecture 9 February 2, 2016 MATH 262/CME 372: Applied Fourier Analysis and Winter 26 Elements of Modern Signal Processing Lecture 9 February 2, 26 Prof. Emmanuel Candes Scribe: Carlos A. Sing-Long, Edited by E. Bates Outline Agenda:

More information

Lecture 7 January 26, 2016

Lecture 7 January 26, 2016 MATH 262/CME 372: Applied Fourier Analysis and Winter 26 Elements of Modern Signal Processing Lecture 7 January 26, 26 Prof Emmanuel Candes Scribe: Carlos A Sing-Long, Edited by E Bates Outline Agenda:

More information

Math Fall Linear Filters

Math Fall Linear Filters Math 658-6 Fall 212 Linear Filters 1. Convolutions and filters. A filter is a black box that takes an input signal, processes it, and then returns an output signal that in some way modifies the input.

More information

Linear Filters. L[e iωt ] = 2π ĥ(ω)eiωt. Proof: Let L[e iωt ] = ẽ ω (t). Because L is time-invariant, we have that. L[e iω(t a) ] = ẽ ω (t a).

Linear Filters. L[e iωt ] = 2π ĥ(ω)eiωt. Proof: Let L[e iωt ] = ẽ ω (t). Because L is time-invariant, we have that. L[e iω(t a) ] = ẽ ω (t a). Linear Filters 1. Convolutions and filters. A filter is a black box that takes an input signal, processes it, and then returns an output signal that in some way modifies the input. For example, if the

More information

2 The Fourier Transform

2 The Fourier Transform 2 The Fourier Transform The Fourier transform decomposes a signal defined on an infinite time interval into a λ-frequency component, where λ can be any real(or even complex) number. 2.1 Informal Development

More information

Continuous-Time Frequency Response (II) Lecture 28: EECS 20 N April 2, Laurent El Ghaoui

Continuous-Time Frequency Response (II) Lecture 28: EECS 20 N April 2, Laurent El Ghaoui EECS 20 N April 2, 2001 Lecture 28: Continuous-Time Frequency Response (II) Laurent El Ghaoui 1 annoucements homework due on Wednesday 4/4 at 11 AM midterm: Friday, 4/6 includes all chapters until chapter

More information

Lecture 16 February 25, 2016

Lecture 16 February 25, 2016 MTH 262/CME 372: pplied Fourier nalysis and Winter 2016 Elements of Modern Signal Processing Lecture 16 February 25, 2016 Prof. Emmanuel Candes Scribe: Carlos. Sing-Long, Edited by E. Bates 1 Outline genda:

More information

Convolution and Linear Systems

Convolution and Linear Systems CS 450: Introduction to Digital Signal and Image Processing Bryan Morse BYU Computer Science Introduction Analyzing Systems Goal: analyze a device that turns one signal into another. Notation: f (t) g(t)

More information

Review of Frequency Domain Fourier Series: Continuous periodic frequency components

Review of Frequency Domain Fourier Series: Continuous periodic frequency components Today we will review: Review of Frequency Domain Fourier series why we use it trig form & exponential form how to get coefficients for each form Eigenfunctions what they are how they relate to LTI systems

More information

Fourier Series. Fourier Transform

Fourier Series. Fourier Transform Math Methods I Lia Vas Fourier Series. Fourier ransform Fourier Series. Recall that a function differentiable any number of times at x = a can be represented as a power series n= a n (x a) n where the

More information

Linear Operators and Fourier Transform

Linear Operators and Fourier Transform Linear Operators and Fourier Transform DD2423 Image Analysis and Computer Vision Mårten Björkman Computational Vision and Active Perception School of Computer Science and Communication November 13, 2013

More information

Fourier Series and Transforms. Revision Lecture

Fourier Series and Transforms. Revision Lecture E. (5-6) : / 3 Periodic signals can be written as a sum of sine and cosine waves: u(t) u(t) = a + n= (a ncosπnft+b n sinπnft) T = + T/3 T/ T +.65sin(πFt) -.6sin(πFt) +.6sin(πFt) + -.3cos(πFt) + T/ Fundamental

More information

Lecture 7 ELE 301: Signals and Systems

Lecture 7 ELE 301: Signals and Systems Lecture 7 ELE 30: Signals and Systems Prof. Paul Cuff Princeton University Fall 20-2 Cuff (Lecture 7) ELE 30: Signals and Systems Fall 20-2 / 22 Introduction to Fourier Transforms Fourier transform as

More information

Introduction to Fourier Transforms. Lecture 7 ELE 301: Signals and Systems. Fourier Series. Rect Example

Introduction to Fourier Transforms. Lecture 7 ELE 301: Signals and Systems. Fourier Series. Rect Example Introduction to Fourier ransforms Lecture 7 ELE 3: Signals and Systems Fourier transform as a limit of the Fourier series Inverse Fourier transform: he Fourier integral theorem Prof. Paul Cuff Princeton

More information

EE 3054: Signals, Systems, and Transforms Summer It is observed of some continuous-time LTI system that the input signal.

EE 3054: Signals, Systems, and Transforms Summer It is observed of some continuous-time LTI system that the input signal. EE 34: Signals, Systems, and Transforms Summer 7 Test No notes, closed book. Show your work. Simplify your answers. 3. It is observed of some continuous-time LTI system that the input signal = 3 u(t) produces

More information

Analysis III for D-BAUG, Fall 2017 Lecture 10

Analysis III for D-BAUG, Fall 2017 Lecture 10 Analysis III for D-BAUG, Fall 27 Lecture Lecturer: Alex Sisto (sisto@math.ethz.ch Convolution (Faltung We have already seen that the Laplace transform is not multiplicative, that is, L {f(tg(t} L {f(t}

More information

L2 gains and system approximation quality 1

L2 gains and system approximation quality 1 Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.242, Fall 24: MODEL REDUCTION L2 gains and system approximation quality 1 This lecture discusses the utility

More information

Linear Filters and Convolution. Ahmed Ashraf

Linear Filters and Convolution. Ahmed Ashraf Linear Filters and Convolution Ahmed Ashraf Linear Time(Shift) Invariant (LTI) Systems The Linear Filters that we are studying in the course belong to a class of systems known as Linear Time Invariant

More information

Continuous Time Signal Analysis: the Fourier Transform. Lathi Chapter 4

Continuous Time Signal Analysis: the Fourier Transform. Lathi Chapter 4 Continuous Time Signal Analysis: the Fourier Transform Lathi Chapter 4 Topics Aperiodic signal representation by the Fourier integral (CTFT) Continuous-time Fourier transform Transforms of some useful

More information

Fourier transforms, Generalised functions and Greens functions

Fourier transforms, Generalised functions and Greens functions Fourier transforms, Generalised functions and Greens functions T. Johnson 2015-01-23 Electromagnetic Processes In Dispersive Media, Lecture 2 - T. Johnson 1 Motivation A big part of this course concerns

More information

Time Series Analysis

Time Series Analysis Time Series Analysis Informatics and Mathematical Modelling Technical University of Denmark DK-2800 Kgs. Lyngby 1 Outline of todays lecture Descriptions of (deterministic) linear systems. Chapter 4: Linear

More information

Lecture 8 ELE 301: Signals and Systems

Lecture 8 ELE 301: Signals and Systems Lecture 8 ELE 30: Signals and Systems Prof. Paul Cuff Princeton University Fall 20-2 Cuff (Lecture 7) ELE 30: Signals and Systems Fall 20-2 / 37 Properties of the Fourier Transform Properties of the Fourier

More information

A sufficient condition for the existence of the Fourier transform of f : R C is. f(t) dt <. f(t) = 0 otherwise. dt =

A sufficient condition for the existence of the Fourier transform of f : R C is. f(t) dt <. f(t) = 0 otherwise. dt = Fourier transform Definition.. Let f : R C. F [ft)] = ˆf : R C defined by The Fourier transform of f is the function F [ft)]ω) = ˆfω) := ft)e iωt dt. The inverse Fourier transform of f is the function

More information

Systems Analysis and Control

Systems Analysis and Control Systems Analysis and Control Matthew M. Peet Arizona State University Lecture 5: Calculating the Laplace Transform of a Signal Introduction In this Lecture, you will learn: Laplace Transform of Simple

More information

2.161 Signal Processing: Continuous and Discrete Fall 2008

2.161 Signal Processing: Continuous and Discrete Fall 2008 MIT OpenCourseWare http://ocw.mit.edu 2.161 Signal Processing: Continuous and Discrete Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. Massachusetts

More information

ENSC327 Communications Systems 2: Fourier Representations. Jie Liang School of Engineering Science Simon Fraser University

ENSC327 Communications Systems 2: Fourier Representations. Jie Liang School of Engineering Science Simon Fraser University ENSC327 Communications Systems 2: Fourier Representations Jie Liang School of Engineering Science Simon Fraser University 1 Outline Chap 2.1 2.5: Signal Classifications Fourier Transform Dirac Delta Function

More information

Today s lecture. Local neighbourhood processing. The convolution. Removing uncorrelated noise from an image The Fourier transform

Today s lecture. Local neighbourhood processing. The convolution. Removing uncorrelated noise from an image The Fourier transform Cris Luengo TD396 fall 4 cris@cbuuse Today s lecture Local neighbourhood processing smoothing an image sharpening an image The convolution What is it? What is it useful for? How can I compute it? Removing

More information

Chapter 6: The Laplace Transform 6.3 Step Functions and

Chapter 6: The Laplace Transform 6.3 Step Functions and Chapter 6: The Laplace Transform 6.3 Step Functions and Dirac δ 2 April 2018 Step Function Definition: Suppose c is a fixed real number. The unit step function u c is defined as follows: u c (t) = { 0

More information

2 Fourier Transforms and Sampling

2 Fourier Transforms and Sampling 2 Fourier ransforms and Sampling 2.1 he Fourier ransform he Fourier ransform is an integral operator that transforms a continuous function into a continuous function H(ω) =F t ω [h(t)] := h(t)e iωt dt

More information

A6523 Linear, Shift-invariant Systems and Fourier Transforms

A6523 Linear, Shift-invariant Systems and Fourier Transforms A6523 Linear, Shift-invariant Systems and Fourier Transforms Linear systems underly much of what happens in nature and are used in instrumentation to make measurements of various kinds. We will define

More information

Representation of Signals and Systems. Lecturer: David Shiung

Representation of Signals and Systems. Lecturer: David Shiung Representation of Signals and Systems Lecturer: David Shiung 1 Abstract (1/2) Fourier analysis Properties of the Fourier transform Dirac delta function Fourier transform of periodic signals Fourier-transform

More information

Review of Linear System Theory

Review of Linear System Theory Review of Linear System Theory The following is a (very) brief review of linear system theory and Fourier analysis. I work primarily with discrete signals. I assume the reader is familiar with linear algebra

More information

2.161 Signal Processing: Continuous and Discrete Fall 2008

2.161 Signal Processing: Continuous and Discrete Fall 2008 MIT OpenCourseWare http://ocw.mit.edu 2.161 Signal Processing: Continuous and Discrete Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. Massachusetts

More information

ECE Digital Image Processing and Introduction to Computer Vision. Outline

ECE Digital Image Processing and Introduction to Computer Vision. Outline ECE592-064 Digital mage Processing and ntroduction to Computer Vision Depart. of ECE, NC State University nstructor: Tianfu (Matt) Wu Spring 2017 1. Recap Outline 2. Thinking in the frequency domain Convolution

More information

Introduction to Signals and Systems Lecture #4 - Input-output Representation of LTI Systems Guillaume Drion Academic year

Introduction to Signals and Systems Lecture #4 - Input-output Representation of LTI Systems Guillaume Drion Academic year Introduction to Signals and Systems Lecture #4 - Input-output Representation of LTI Systems Guillaume Drion Academic year 2017-2018 1 Outline Systems modeling: input/output approach of LTI systems. Convolution

More information

Series FOURIER SERIES. Graham S McDonald. A self-contained Tutorial Module for learning the technique of Fourier series analysis

Series FOURIER SERIES. Graham S McDonald. A self-contained Tutorial Module for learning the technique of Fourier series analysis Series FOURIER SERIES Graham S McDonald A self-contained Tutorial Module for learning the technique of Fourier series analysis Table of contents Begin Tutorial c 24 g.s.mcdonald@salford.ac.uk 1. Theory

More information

Lecture 34. Fourier Transforms

Lecture 34. Fourier Transforms Lecture 34 Fourier Transforms In this section, we introduce the Fourier transform, a method of analyzing the frequency content of functions that are no longer τ-periodic, but which are defined over the

More information

Module 4. Related web links and videos. 1. FT and ZT

Module 4. Related web links and videos. 1.  FT and ZT Module 4 Laplace transforms, ROC, rational systems, Z transform, properties of LT and ZT, rational functions, system properties from ROC, inverse transforms Related web links and videos Sl no Web link

More information

2.161 Signal Processing: Continuous and Discrete Fall 2008

2.161 Signal Processing: Continuous and Discrete Fall 2008 MIT OpenCourseWare http://ocw.mit.edu.6 Signal Processing: Continuous and Discrete Fall 008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. MASSACHUSETTS

More information

Introduction to Linear Systems

Introduction to Linear Systems cfl David J Fleet, 998 Introduction to Linear Systems David Fleet For operator T, input I, and response R = T [I], T satisfies: ffl homogeniety: iff T [ai] = at[i] 8a 2 C ffl additivity: iff T [I + I 2

More information

Lecture 3 January 23

Lecture 3 January 23 EE 123: Digital Signal Processing Spring 2007 Lecture 3 January 23 Lecturer: Prof. Anant Sahai Scribe: Dominic Antonelli 3.1 Outline These notes cover the following topics: Eigenvectors and Eigenvalues

More information

Modeling and Analysis of Systems Lecture #3 - Linear, Time-Invariant (LTI) Systems. Guillaume Drion Academic year

Modeling and Analysis of Systems Lecture #3 - Linear, Time-Invariant (LTI) Systems. Guillaume Drion Academic year Modeling and Analysis of Systems Lecture #3 - Linear, Time-Invariant (LTI) Systems Guillaume Drion Academic year 2015-2016 1 Outline Systems modeling: input/output approach and LTI systems. Convolution

More information

Fourier series. Complex Fourier series. Positive and negative frequencies. Fourier series demonstration. Notes. Notes. Notes.

Fourier series. Complex Fourier series. Positive and negative frequencies. Fourier series demonstration. Notes. Notes. Notes. Fourier series Fourier series of a periodic function f (t) with period T and corresponding angular frequency ω /T : f (t) a 0 + (a n cos(nωt) + b n sin(nωt)), n1 Fourier series is a linear sum of cosine

More information

Introduction to Image Processing #5/7

Introduction to Image Processing #5/7 Outline Introduction to Image Processing #5/7 Thierry Géraud EPITA Research and Development Laboratory (LRDE) 2006 Outline Outline 1 Introduction 2 About the Dirac Delta Function Some Useful Functions

More information

Signal and systems. Linear Systems. Luigi Palopoli. Signal and systems p. 1/5

Signal and systems. Linear Systems. Luigi Palopoli. Signal and systems p. 1/5 Signal and systems p. 1/5 Signal and systems Linear Systems Luigi Palopoli palopoli@dit.unitn.it Wrap-Up Signal and systems p. 2/5 Signal and systems p. 3/5 Fourier Series We have see that is a signal

More information

e iωt dt and explained why δ(ω) = 0 for ω 0 but δ(0) =. A crucial property of the delta function, however, is that

e iωt dt and explained why δ(ω) = 0 for ω 0 but δ(0) =. A crucial property of the delta function, however, is that Phys 53 Fourier Transforms In this handout, I will go through the derivations of some of the results I gave in class (Lecture 4, /). I won t reintroduce the concepts though, so if you haven t seen the

More information

LTI Systems (Continuous & Discrete) - Basics

LTI Systems (Continuous & Discrete) - Basics LTI Systems (Continuous & Discrete) - Basics 1. A system with an input x(t) and output y(t) is described by the relation: y(t) = t. x(t). This system is (a) linear and time-invariant (b) linear and time-varying

More information

Fourier Transform for Continuous Functions

Fourier Transform for Continuous Functions Fourier Transform for Continuous Functions Central goal: representing a signal by a set of orthogonal bases that are corresponding to frequencies or spectrum. Fourier series allows to find the spectrum

More information

Functions of a Complex Variable (S1) Lecture 11. VII. Integral Transforms. Integral transforms from application of complex calculus

Functions of a Complex Variable (S1) Lecture 11. VII. Integral Transforms. Integral transforms from application of complex calculus Functions of a Complex Variable (S1) Lecture 11 VII. Integral Transforms An introduction to Fourier and Laplace transformations Integral transforms from application of complex calculus Properties of Fourier

More information

Homework 4. May An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt

Homework 4. May An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt Homework 4 May 2017 1. An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt Determine the impulse response of the system. Rewriting as y(t) = t e (t

More information

e iωt dt and explained why δ(ω) = 0 for ω 0 but δ(0) =. A crucial property of the delta function, however, is that

e iωt dt and explained why δ(ω) = 0 for ω 0 but δ(0) =. A crucial property of the delta function, however, is that Phys 531 Fourier Transforms In this handout, I will go through the derivations of some of the results I gave in class (Lecture 14, 1/11). I won t reintroduce the concepts though, so you ll want to refer

More information

The formulas for derivatives are particularly useful because they reduce ODEs to algebraic expressions. Consider the following ODE d 2 dx + p d

The formulas for derivatives are particularly useful because they reduce ODEs to algebraic expressions. Consider the following ODE d 2 dx + p d Solving ODEs using Fourier Transforms The formulas for derivatives are particularly useful because they reduce ODEs to algebraic expressions. Consider the following ODE d 2 dx + p d 2 dx + q f (x) R(x)

More information

Special Mathematics Laplace Transform

Special Mathematics Laplace Transform Special Mathematics Laplace Transform March 28 ii Nature laughs at the difficulties of integration. Pierre-Simon Laplace 4 Laplace Transform Motivation Properties of the Laplace transform the Laplace transform

More information

Computational Methods for Astrophysics: Fourier Transforms

Computational Methods for Astrophysics: Fourier Transforms Computational Methods for Astrophysics: Fourier Transforms John T. Whelan (filling in for Joshua Faber) April 27, 2011 John T. Whelan April 27, 2011 Fourier Transforms 1/13 Fourier Analysis Outline: Fourier

More information

Mathematical Foundations of Signal Processing

Mathematical Foundations of Signal Processing Mathematical Foundations of Signal Processing Module 4: Continuous-Time Systems and Signals Benjamín Béjar Haro Mihailo Kolundžija Reza Parhizkar Adam Scholefield October 24, 2016 Continuous Time Signals

More information

Computational Data Analysis!

Computational Data Analysis! 12.714 Computational Data Analysis! Alan Chave (alan@whoi.edu)! Thomas Herring (tah@mit.edu),! http://geoweb.mit.edu/~tah/12.714! Concentration Problem:! Today s class! Signals that are near time and band

More information

Aspects of Continuous- and Discrete-Time Signals and Systems

Aspects of Continuous- and Discrete-Time Signals and Systems Aspects of Continuous- and Discrete-Time Signals and Systems C.S. Ramalingam Department of Electrical Engineering IIT Madras C.S. Ramalingam (EE Dept., IIT Madras) Networks and Systems 1 / 45 Scaling the

More information

06/12/ rws/jMc- modif SuFY10 (MPF) - Textbook Section IX 1

06/12/ rws/jMc- modif SuFY10 (MPF) - Textbook Section IX 1 IV. Continuous-Time Signals & LTI Systems [p. 3] Analog signal definition [p. 4] Periodic signal [p. 5] One-sided signal [p. 6] Finite length signal [p. 7] Impulse function [p. 9] Sampling property [p.11]

More information

e st f (t) dt = e st tf(t) dt = L {t f(t)} s

e st f (t) dt = e st tf(t) dt = L {t f(t)} s Additional operational properties How to find the Laplace transform of a function f (t) that is multiplied by a monomial t n, the transform of a special type of integral, and the transform of a periodic

More information

Fundamentals of the gravitational wave data analysis V

Fundamentals of the gravitational wave data analysis V Fundamentals of the gravitational wave data analysis V - Hilbert-Huang Transform - Ken-ichi Oohara Niigata University Introduction The Hilbert-Huang transform (HHT) l It is novel, adaptive approach to

More information

( ) f (k) = FT (R(x)) = R(k)

( ) f (k) = FT (R(x)) = R(k) Solving ODEs using Fourier Transforms The formulas for derivatives are particularly useful because they reduce ODEs to algebraic expressions. Consider the following ODE d 2 dx + p d 2 dx + q f (x) = R(x)

More information

Background LTI Systems (4A) Young Won Lim 4/20/15

Background LTI Systems (4A) Young Won Lim 4/20/15 Background LTI Systems (4A) Copyright (c) 2014-2015 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2

More information

1. Fourier Transform (Continuous time) A finite energy signal is a signal f(t) for which. f(t) 2 dt < Scalar product: f(t)g(t)dt

1. Fourier Transform (Continuous time) A finite energy signal is a signal f(t) for which. f(t) 2 dt < Scalar product: f(t)g(t)dt 1. Fourier Transform (Continuous time) 1.1. Signals with finite energy A finite energy signal is a signal f(t) for which Scalar product: f(t) 2 dt < f(t), g(t) = 1 2π f(t)g(t)dt The Hilbert space of all

More information

LAST Name FOURIER FIRST Name Jean Baptiste Joseph Lab Time 365/24/7

LAST Name FOURIER FIRST Name Jean Baptiste Joseph Lab Time 365/24/7 EECS 20N: Structure and Interpretation of Signals and Systems Final Exam Sol. Department of Electrical Engineering and Computer Sciences 13 December 2005 UNIVERSITY OF CALIFORNIA BERKELEY LAST Name FOURIER

More information

Convolution. Define a mathematical operation on discrete-time signals called convolution, represented by *. Given two discrete-time signals x 1, x 2,

Convolution. Define a mathematical operation on discrete-time signals called convolution, represented by *. Given two discrete-time signals x 1, x 2, Filters Filters So far: Sound signals, connection to Fourier Series, Introduction to Fourier Series and Transforms, Introduction to the FFT Today Filters Filters: Keep part of the signal we are interested

More information

5. THE CLASSES OF FOURIER TRANSFORMS

5. THE CLASSES OF FOURIER TRANSFORMS 5. THE CLASSES OF FOURIER TRANSFORMS There are four classes of Fourier transform, which are represented in the following table. So far, we have concentrated on the discrete Fourier transform. Table 1.

More information

The RC Circuit: An Approach with Fourier Transforms

The RC Circuit: An Approach with Fourier Transforms The RC Circuit: An Approach with Fourier Transforms In this article we shall mathematically analyse the Resistor- Capacitor RC) circuit with the help of Fourier transforms FT). This very general technique

More information

信號與系統 Signals and Systems

信號與系統 Signals and Systems Spring 2015 信號與系統 Signals and Systems Chapter SS-2 Linear Time-Invariant Systems Feng-Li Lian NTU-EE Feb15 Jun15 Figures and images used in these lecture notes are adopted from Signals & Systems by Alan

More information

Lecture 29. Convolution Integrals and Their Applications

Lecture 29. Convolution Integrals and Their Applications Math 245 - Mathematics of Physics and Engineering I Lecture 29. Convolution Integrals and Their Applications March 3, 212 Konstantin Zuev (USC) Math 245, Lecture 29 March 3, 212 1 / 13 Agenda Convolution

More information

Frequency Response (III) Lecture 26:

Frequency Response (III) Lecture 26: EECS 20 N March 21, 2001 Lecture 26: Frequency Response (III) Laurent El Ghaoui 1 outline reading assignment: Chapter 8 of Lee and Varaiya we ll concentrate on continuous-time systems: convolution integral

More information

Signals and Systems Spring 2004 Lecture #9

Signals and Systems Spring 2004 Lecture #9 Signals and Systems Spring 2004 Lecture #9 (3/4/04). The convolution Property of the CTFT 2. Frequency Response and LTI Systems Revisited 3. Multiplication Property and Parseval s Relation 4. The DT Fourier

More information

GATE EE Topic wise Questions SIGNALS & SYSTEMS

GATE EE Topic wise Questions SIGNALS & SYSTEMS www.gatehelp.com GATE EE Topic wise Questions YEAR 010 ONE MARK Question. 1 For the system /( s + 1), the approximate time taken for a step response to reach 98% of the final value is (A) 1 s (B) s (C)

More information

Damped Harmonic Oscillator

Damped Harmonic Oscillator Damped Harmonic Oscillator Wednesday, 23 October 213 A simple harmonic oscillator subject to linear damping may oscillate with exponential decay, or it may decay biexponentially without oscillating, or

More information

The structure of laser pulses

The structure of laser pulses 1 The structure of laser pulses 2 The structure of laser pulses Pulse characteristics Temporal and spectral representation Fourier transforms Temporal and spectral widths Instantaneous frequency Chirped

More information

1 Math 241A-B Homework Problem List for F2015 and W2016

1 Math 241A-B Homework Problem List for F2015 and W2016 1 Math 241A-B Homework Problem List for F2015 W2016 1.1 Homework 1. Due Wednesday, October 7, 2015 Notation 1.1 Let U be any set, g be a positive function on U, Y be a normed space. For any f : U Y let

More information

Review of Linear Time-Invariant Network Analysis

Review of Linear Time-Invariant Network Analysis D1 APPENDIX D Review of Linear Time-Invariant Network Analysis Consider a network with input x(t) and output y(t) as shown in Figure D-1. If an input x 1 (t) produces an output y 1 (t), and an input x

More information

Damped harmonic motion

Damped harmonic motion Damped harmonic motion March 3, 016 Harmonic motion is studied in the presence of a damping force proportional to the velocity. The complex method is introduced, and the different cases of under-damping,

More information

ECG782: Multidimensional Digital Signal Processing

ECG782: Multidimensional Digital Signal Processing Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu ECG782: Multidimensional Digital Signal Processing Filtering in the Frequency Domain http://www.ee.unlv.edu/~b1morris/ecg782/ 2 Outline Background

More information

Digital Image Processing

Digital Image Processing Digital Image Processing 2D SYSTEMS & PRELIMINARIES Hamid R. Rabiee Fall 2015 Outline 2 Two Dimensional Fourier & Z-transform Toeplitz & Circulant Matrices Orthogonal & Unitary Matrices Block Matrices

More information

1 otherwise. Note that the area of the pulse is one. The Dirac delta function (a.k.a. the impulse) can be defined using the pulse as follows:

1 otherwise. Note that the area of the pulse is one. The Dirac delta function (a.k.a. the impulse) can be defined using the pulse as follows: The Dirac delta function There is a function called the pulse: { if t > Π(t) = 2 otherwise. Note that the area of the pulse is one. The Dirac delta function (a.k.a. the impulse) can be defined using the

More information

EECE 3620: Linear Time-Invariant Systems: Chapter 2

EECE 3620: Linear Time-Invariant Systems: Chapter 2 EECE 3620: Linear Time-Invariant Systems: Chapter 2 Prof. K. Chandra ECE, UMASS Lowell September 7, 2016 1 Continuous Time Systems In the context of this course, a system can represent a simple or complex

More information

From Fourier to Wavelets in 60 Slides

From Fourier to Wavelets in 60 Slides From Fourier to Wavelets in 60 Slides Bernhard G. Bodmann Math Department, UH September 20, 2008 B. G. Bodmann (UH Math) From Fourier to Wavelets in 60 Slides September 20, 2008 1 / 62 Outline 1 From Fourier

More information

Signals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions

Signals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions 8-90 Signals and Systems Profs. Byron Yu and Pulkit Grover Fall 08 Midterm Solutions Name: Andrew ID: Problem Score Max 8 5 3 6 4 7 5 8 6 7 6 8 6 9 0 0 Total 00 Midterm Solutions. (8 points) Indicate whether

More information

Outline. Convolution. Filtering

Outline. Convolution. Filtering Filtering Outline Convolution Filtering Logistics HW1 HW2 - out tomorrow Recall: what is a digital (grayscale) image? Matrix of integer values Images as height fields Let s think of image as zero-padded

More information

EECS 20N: Midterm 2 Solutions

EECS 20N: Midterm 2 Solutions EECS 0N: Midterm Solutions (a) The LTI system is not causal because its impulse response isn t zero for all time less than zero. See Figure. Figure : The system s impulse response in (a). (b) Recall that

More information

Fourier Analysis and Power Spectral Density

Fourier Analysis and Power Spectral Density Chapter 4 Fourier Analysis and Power Spectral Density 4. Fourier Series and ransforms Recall Fourier series for periodic functions for x(t + ) = x(t), where x(t) = 2 a + a = 2 a n = 2 b n = 2 n= a n cos

More information

ECEN 420 LINEAR CONTROL SYSTEMS. Lecture 2 Laplace Transform I 1/52

ECEN 420 LINEAR CONTROL SYSTEMS. Lecture 2 Laplace Transform I 1/52 1/52 ECEN 420 LINEAR CONTROL SYSTEMS Lecture 2 Laplace Transform I Linear Time Invariant Systems A general LTI system may be described by the linear constant coefficient differential equation: a n d n

More information

Identification Methods for Structural Systems. Prof. Dr. Eleni Chatzi System Stability - 26 March, 2014

Identification Methods for Structural Systems. Prof. Dr. Eleni Chatzi System Stability - 26 March, 2014 Prof. Dr. Eleni Chatzi System Stability - 26 March, 24 Fundamentals Overview System Stability Assume given a dynamic system with input u(t) and output x(t). The stability property of a dynamic system can

More information

Laplace Transform Part 1: Introduction (I&N Chap 13)

Laplace Transform Part 1: Introduction (I&N Chap 13) Laplace Transform Part 1: Introduction (I&N Chap 13) Definition of the L.T. L.T. of Singularity Functions L.T. Pairs Properties of the L.T. Inverse L.T. Convolution IVT(initial value theorem) & FVT (final

More information

(f g)(t) = Example 4.5.1: Find f g the convolution of the functions f(t) = e t and g(t) = sin(t). Solution: The definition of convolution is,

(f g)(t) = Example 4.5.1: Find f g the convolution of the functions f(t) = e t and g(t) = sin(t). Solution: The definition of convolution is, .5. Convolutions and Solutions Solutions of initial value problems for linear nonhomogeneous differential equations can be decomposed in a nice way. The part of the solution coming from the initial data

More information

221B Lecture Notes on Resonances in Classical Mechanics

221B Lecture Notes on Resonances in Classical Mechanics 1B Lecture Notes on Resonances in Classical Mechanics 1 Harmonic Oscillators Harmonic oscillators appear in many different contexts in classical mechanics. Examples include: spring, pendulum (with a small

More information

Fourier transform. Stefano Ferrari. Università degli Studi di Milano Methods for Image Processing. academic year

Fourier transform. Stefano Ferrari. Università degli Studi di Milano Methods for Image Processing. academic year Fourier transform Stefano Ferrari Università degli Studi di Milano stefano.ferrari@unimi.it Methods for Image Processing academic year 27 28 Function transforms Sometimes, operating on a class of functions

More information

9.2 The Input-Output Description of a System

9.2 The Input-Output Description of a System Lecture Notes on Control Systems/D. Ghose/212 22 9.2 The Input-Output Description of a System The input-output description of a system can be obtained by first defining a delta function, the representation

More information

Differential Equations

Differential Equations Differential Equations Math 341 Fall 21 MWF 2:3-3:25pm Fowler 37 c 21 Ron Buckmire http://faculty.oxy.edu/ron/math/341/1/ Worksheet 29: Wednesday December 1 TITLE Laplace Transforms and Introduction to

More information

Notes 07 largely plagiarized by %khc

Notes 07 largely plagiarized by %khc Notes 07 largely plagiarized by %khc Warning This set of notes covers the Fourier transform. However, i probably won t talk about everything here in section; instead i will highlight important properties

More information

Chapter 2: Linear systems & sinusoids OVE EDFORS DEPT. OF EIT, LUND UNIVERSITY

Chapter 2: Linear systems & sinusoids OVE EDFORS DEPT. OF EIT, LUND UNIVERSITY Chapter 2: Linear systems & sinusoids OVE EDFORS DEPT. OF EIT, LUND UNIVERSITY Learning outcomes After this lecture, the student should understand what a linear system is, including linearity conditions,

More information

Identification Methods for Structural Systems

Identification Methods for Structural Systems Prof. Dr. Eleni Chatzi System Stability Fundamentals Overview System Stability Assume given a dynamic system with input u(t) and output x(t). The stability property of a dynamic system can be defined from

More information

93 Analytical solution of differential equations

93 Analytical solution of differential equations 1 93 Analytical solution of differential equations 1. Nonlinear differential equation The only kind of nonlinear differential equations that we solve analytically is the so-called separable differential

More information

Review of Discrete-Time System

Review of Discrete-Time System Review of Discrete-Time System Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides were based on class notes developed by Profs. K.J. Ray Liu and Min Wu.

More information