MATH 414 Lecture 18

From Notes
Jump to navigation Jump to search

« previous | Wednesday, February 26, 2014 | next »

Begin Exam 2 content


Convolution Theorem

By definition, the convolution of two functions f(t) and g(t) is

(f*g)(t)=∫−∞∞f(τ)g(t−τ)dτ


Theorem.
ℱ[f*g](λ)=2πf^(λ)g^(λ)

Proof. (omitted)

quod erat demonstrandum


Plancheral (Parseval) Theorem

Given f, f^, g, and g^ in L2 [1],

⟨f,g⟩L2=∫−∞∞f(t)g(t)dt

Show that ⟨f,g⟩L2=⟨f^,g^⟩L2

What does this mean?

let f=g

‖f‖L22=∫−∞∞|f(t)|2dt‖f^‖L22=∫−∞∞|f^(t)|2dtf^(λ)=12π∫−∞∞f(t)e−iλtdtf(t)=12π∫−∞∞f^(λ)e+iλtdλ


Note that eiλt is a "pure tone frequency" for fixed λ.

Then f^(λ) represents the amplitude and phase.

When we compute the synthesis

f(t)=12π∫−∞∞f^(λ)eiλtdλ

We are expressing f(t) as a "linear combination" of "pure" tones. In Fourier Series, we do the same thing (synthesis of "pure" tones)

f(t)=∑n=−∞∞cneint


Parseval States that ∫−∞∞|f(t)|2dt is the total energy in f.


Theorem. [Plancheral / Parseval].

Proof.

∫−∞∞f(t)g(t)‾dt=∫−∞∞f(t)(12π∫−∞∞g^(λ)e+iλtdλ)‾dt=∫−∞∞f(t)(12π∫−∞∞g^(λ)‾e−iλtdλ)dtfubini=∫−∞∞g^(λ)‾(12π∫−∞∞f(t)e−iλtdt)dλ=∫−∞∞f^(λ)g^(λ)‾dλ=⟨f^,g^⟩L2
quod erat demonstrandum

Linear Filters

space of signals: L2 (work with piecewise continuous)

A Linear Filter l is a linear transformation from the space of signals into the space of signals (L2). This means L[αf+βg]=αL[f]+βL[g], where α and β are constants, and f and g are signals.

We shall use the notation L[f](t)=f~(t)

Time invariance

f(t), start at 12 noon, but we perform a shift (time translation) by a and apply again, we'll get the same signal back.

Define fa(t):=f(t−a)

When a>0, then the signal shifts to the right; and when a<0, the signal shifts to the left.

A linear filter is said to be time-invariant if and only if L[fa]=(L[f])a=f~(t−a) Intuitively, when we shift a function and filter, we should get the same thing as if we would have applied the filter and then shifted.


All time-invariant filters look like convolutions


Example: Running Filter

Take some time d>0 and a function f, we define

L[f](t)=1d∫t−dtf(τ)dτ

This is the average of f over the interval from t−d to d. This has the effect of smoothing a "rough" function.


Footnotes

  1. ↑ For any f∈L2, f^∈L2 as well