Lecture 1 January 5, 2016

Similar documents
Lecture 6 January 21, 2016

Lecture 9 February 2, 2016

Lecture 7 January 26, 2016

Math Fall Linear Filters

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).

2 The Fourier Transform

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

Lecture 16 February 25, 2016

Convolution and Linear Systems

Review of Frequency Domain Fourier Series: Continuous periodic frequency components

Fourier Series. Fourier Transform

Linear Operators and Fourier Transform

Fourier Series and Transforms. Revision Lecture

Lecture 7 ELE 301: Signals and Systems

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

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

Analysis III for D-BAUG, Fall 2017 Lecture 10

L2 gains and system approximation quality 1

Linear Filters and Convolution. Ahmed Ashraf

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

Fourier transforms, Generalised functions and Greens functions

Time Series Analysis

Lecture 8 ELE 301: Signals and Systems

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

Systems Analysis and Control

2.161 Signal Processing: Continuous and Discrete Fall 2008

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

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

Chapter 6: The Laplace Transform 6.3 Step Functions and

2 Fourier Transforms and Sampling

A6523 Linear, Shift-invariant Systems and Fourier Transforms

Representation of Signals and Systems. Lecturer: David Shiung

Review of Linear System Theory

2.161 Signal Processing: Continuous and Discrete Fall 2008

ECE Digital Image Processing and Introduction to Computer Vision. Outline

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

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

Lecture 34. Fourier Transforms

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

2.161 Signal Processing: Continuous and Discrete Fall 2008

Introduction to Linear Systems

Lecture 3 January 23

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

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

Introduction to Image Processing #5/7

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

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

LTI Systems (Continuous & Discrete) - Basics

Fourier Transform for Continuous Functions

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

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

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

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

Special Mathematics Laplace Transform

Computational Methods for Astrophysics: Fourier Transforms

Mathematical Foundations of Signal Processing

Computational Data Analysis!

Aspects of Continuous- and Discrete-Time Signals and Systems

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

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

Fundamentals of the gravitational wave data analysis V

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

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

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

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

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

5. THE CLASSES OF FOURIER TRANSFORMS

The RC Circuit: An Approach with Fourier Transforms

信號與系統 Signals and Systems

Lecture 29. Convolution Integrals and Their Applications

Frequency Response (III) Lecture 26:

Signals and Systems Spring 2004 Lecture #9

GATE EE Topic wise Questions SIGNALS & SYSTEMS

Damped Harmonic Oscillator

The structure of laser pulses

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

Review of Linear Time-Invariant Network Analysis

Damped harmonic motion

ECG782: Multidimensional Digital Signal Processing

Digital Image Processing

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:

EECE 3620: Linear Time-Invariant Systems: Chapter 2

From Fourier to Wavelets in 60 Slides

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

Outline. Convolution. Filtering

EECS 20N: Midterm 2 Solutions

Fourier Analysis and Power Spectral Density

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

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

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

(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,

221B Lecture Notes on Resonances in Classical Mechanics

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

9.2 The Input-Output Description of a System

Differential Equations

Notes 07 largely plagiarized by %khc

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

Identification Methods for Structural Systems

93 Analytical solution of differential equations

Review of Discrete-Time System

Transcription:

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 )

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

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

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.5.5 2 2 f(t).5 8 4 4 8 ˆ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

.5.5.5 4 2 2 4 f(t).5 8 4 4 8 ˆ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

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

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