Documente Academic
Documente Profesional
Documente Cultură
BiS351: i 2009
Bio--Signal
Bio g Processingg
(Part D: Discrete Time Fourier Transform (DTFT)
Discrete Fourier Transform (DFT) )
8 Fourier Series
2
R
Review: R
Road
d Map
M to Fourier
F Kingdom
K d
Periodic ÅÆ Discrete
h(u) Non-Periodic
Non Periodic Periodic
H(ω)
Non-Periodic (
(Continuous Time)) Fourier Series
Fourier Transform
3
P
Poisson Formula
F l
4
S
Sampling
l Th Theory
5
S
Sampling
l Th Theory ((cont))
6
P f
Perfect Reconstruction
R Condition
C d
7
Al
Aliasing in C
Camera/Video
/V d
8
MRI System
S
• The static field (B0 field)
– Strong magnetic field (1.5~7T) to align
the nuclei.
• Radio waves (RF)
– Transforms the magnetisation so that
we can measure
• Gradient fields (Gx, Gy, Gz)
– SSo that
h we know
k where
h the
h signall
comes from
– So that we can create an image
• Image characteristics:
– Density of nuclei
– Structure surrounding nuclei; T1 & T2
– Chemical characteristics
9
MRI Fourier
MRI: F i Transform
T f FFormula
l
10
Al
Aliasing in MRI
11
D ff
Diffusion off Single
S l M Molecule:
l l T Temporall Resolution
R l
12
A k i S
Ankyrin-Spectrin
i NNetworkk off Cytoplasmic
C l i Surface
S f off Neuron
N
13
D
Discrete Time
T Fourier
F Transform
T f (DTFT)
14
E
Example
l 55.1
1
15
E
Example
l 55.3
3
16
D
Derivation off DTFT
17
D
Derivation off DTFT ((cont.))
Nyquist sampling
18
DTFT vs Fourier
F Series
S
19
20
21
T
Time EExpansion
22
D ff
Difference EEquation Systems
S
23
E
Example
l 55.18
18
• Frequency
F response
• Impulse response
24
E
Example
l 55.19
19
25
Summary
• Derivation of DTFT
• Properties of DTFT
• Linear Difference Equation
26
Week Topics Contents
1 Introduction Course Overview
2 Signal Basics Type of Signals, Elementary Signals
3 Linear Time Invariant Systems Continuous- and Discrete LTI Systems, Properties
4
Fourier Transform of Continuous-Time Signals
5
C
Continuous-Time S
Signal Analysis
6
Fourier Transform Properties
7
8 Fourier Series
27
R d
Roadmap to Fourier
F Kingdom
K d
28
P
Periodic
d Discrete
D Signal
S l (pp.
( 211-226,p.
211 226 367-372)
367 372)
• Example:
E l
29
D
Discrete Periodic
P d Signal
S l (cont.)
( )
30
D
Discrete Periodic
P d Signal
S l (cont.)
( )
31
D
Derivation off Discrete
D Fourier
F Series
S
32
D
Derivation off Inversion
I Formula
F l
• Therefore,
Th f the
h inverse fformula
l bbecomes
33
D
Derivation off Forward
F d Formula
F l
34
D
Discrete Fourier
F T
Transform
f
35
D
Discrete Fourier
F T
Transform
f (T
(Two Forms)
F )
• DFT in
i MATLAB and
d Oppenheim,
O h i Schafer
S h f is
i defined
d fi d by
b
• Normalized Notation
36
E
Example:
l DFT computation
• Q1: Compute
• Q2:
Q2 Compute
C X[k]
• Q3: Relationship in between ? Plot it.
37
P
Properties off DFT
38
C
Circular
l C Convolution
l
39
E
Example:
l C Circular
l C Convolution
l
S
Suppose x[n],
[ ] h[
h[n]] iis given
i as ffollowing
ll i
Show that
Sh h
1. using DFT
2 using circular convolution
2.
40
C
Computation off DTFT convolution
l using DFT
41
F Fourier
Fast F T
Transform
f
42
D i
Decimation-in-Time
i i Ti FFT Al
Algorithm
i h (C
(Cooley
l &TTukey
k AlAlgorithm)
ih )
44
8P
8-Point FFT
T l complexity
Total l i iis O(Nl
O(Nlog2 N)
45
H
Homework
k
46
Summary
47