Lecture 4:sampling and Reconstruction: - Sampling - Data Reconstruction (Hold) - Reading: Chapter 3 of The Textbook
Lecture 4:sampling and Reconstruction: - Sampling - Data Reconstruction (Hold) - Reading: Chapter 3 of The Textbook
• Sampling
H(s)
Continuous-time Discrete-time
Signals Signals
Data reconstruction
1
Sampler
• A sampler obtains from a continuous-time signal a
discrete-time signal by sampling every T seconds
– Input is a continuous-time signal
– Output is a discrete-time signal e(kT), k=0,1,…
– Both signals have identical values at sampling moments
– Not a lossless procedure in general
– Not a time-invariant procedure
2
Sampled-Data Control System
e(kT ) u(kT )
e(t) Digital u(t) y(t)
Sampler Data hold Plant
controller
3
Sampler and Zero-Order Hold
Laplace transform of
Z-transform of e(kT):
Laplace transform of
ē(t) = e(0)[u(t) − u(t − T )] + e(T )[u(t − T ) − u(t − 2T )] + · · ·
e−T s −T s −2T s
Ē(s) = e(0)[ 1s − s
] + e(T )[ e s − e s ] + ···
−T s
= [e(0) + e(T )e −T s
+ e(2T )e −2T s
+ · · ·] 1−es
∞ −T s
= [ k=0 e(kT )e −kT s
] 1−es
T
where
e∗ (t) = L−1 [E ∗ (s)] = e(0)δ(t) + e(T )δ(t − T ) + e(2T )δ(t − 2T ) + · · ·
is a string of impulses whose amplitudes are modulated by e(t)
∞
E ∗ (s) = k=0 e(kT )e−kT s
4
Ideal Sampler
e(t) T e∗ (t)
δT (t) δT (t)
δT (t) is a string of unit impulses T second apart:
T 2T 3T 4T 5T
δT (t)
Remarks
• Ideal sampler is introduced for theoretical convenience and does not
correspond to physical entity
• Ideal sampler is linear but not time-invariant; can map different e(t)
to the same e*(t)
• Thus ideal sampler cannot be described by a transfer function
5
Summary: First Perspectives of Sampler and Hold
In the time domain:
T
Ideal sampler Data hold
∞
E ∗(s) = k=0 e(kT )e
−kT s
is called the star-transform of E(s)
6
Relating the Two Perspectives
e(kT )
E(z)
e(t)
E(s) ē(t)
Ē(s)
s
−T
e
1− s
=
e∗(t) (s)
G h0
E ∗(s)
Finding Star-Transform
∞
• Given E(s), find E ∗ (s) = k=0 e(kT )e
−kT s
• Approach I: E ∗ (s) = [residues of E(λ) 1−e−T1 (s−λ) ]
where the summation is over all poles of E(λ)
(Note: E(λ) needs to be a rational function and ….)
∞ e(0)
• Approach II: E ∗(s) = T1 k=−∞ E(s + jkωs ) + 2
where ωs = 2π
T is the radian sampling frequency
(Derivations can be found in the Appendix III)
• Approach III: find E(z) either from the table on pp. 676,
1
or by E(z) = [residues of E(λ) 1−z−1 eT λ , then
]
E ∗ (s) = E(z)|z=eT s
7
Examples
z 1 1
E(s) = 1
s
E(z) = z−1 = 1−z −1 E ∗ (s) = 1−e−T s
z 1 1
E(s) = 1
s+1
E(z) = z−e−T = 1−e−T z−1 E ∗ (s) = 1−e−(1+s)T
Example
1 T ze−aT
E(s) = (s+a)2 E(z) = (z−e−aT )2 E ∗ (s) =
8
More Examples
1
E(s) = (s+1)(s+2) E ∗ (s) =
ω z sin(ωT )
E(s) = s2 +ω 2 E(z) = z 2 −2z cos(ωT )+1
9
Property I of E*(s)
E*(s) is periodic in s with period jωs = j 2π
T
E ∗ (s + jmωs ) = E ∗ (s)
Example:
1 1
E(s) = s
E ∗ (s) = 1−e−T s
1
E(s) = 1
s+1
E ∗ (s) = 1−e−(1+s)T
Or from
Property II of E*(s)
If E(s) has a pole at p, then E*(s) has poles at p ± jmωs
E(s) E ∗(s)
×
× Primary strip
×
Example:
1
E (s) = 1
s
E ∗ (s) = 1−e−T s
1
E (s) = 1
s+1
E ∗ (s) = 1−e−(1+s)T
10
Data Reconstruction
T
Ideal sampler Data hold
11
Shannon’s Sampling Theorem
When is the ideal sampler an invertible procedure: from the
sampled signal e*(t) we can uniquely reconstruct e(t)?
∞
E ∗ (s) = T1 k =−∞ E (s + jkωs ) + e(0)
2
Thus, the Fourier transform of e*(t) can be obtained from the Fourier transform
of e(t) as:
1
∞ e(0)
E ∗ (jω) = T k=−∞ E(jω + jkωs ) + 2
• Or equivalently, one has to sample the signal twice as fast as the fastest
changing part in e(t) in order to be able to reconstruct it uniquely
∞ e(0)
E ∗ (jω) = 1
T k=−∞ E(jω + jkωs ) + 2 Ē(jω) = Gh0 (jω)E ∗ (jω)
(periodic extension in freq. domain) (data hold transfer function)
12
Zero-Order Hold
• A physically feasible (causal) data hold transfer function is given by
−T s
Gh0 (s) = 1−es
with unit impulse response 1
T
• Frequency response
Gh0 (jω) = 1−e−jωT
jω
|Gh0 (jω)| = T | sin(πω/ω
|πω/ωs |
s )|
Example
Time Doman Frequency Doman
E(jω)
e(t) = 2 cos(ω1 t)
−ω1 ω1
Ideal sampling
E ∗ (jω)
−ωs −ω1 ω1 ωs
Zero-order hold
Ē(jω)
−ωs −ω1 ω1 ωs
13
First-Order Hold
Idea: Given a sequence of sampled data e(kT ), k = 0, 1, . . .
reconstruct the signal between sampling times approximately by first order Euler
expansion
eo (t) ≃ e(kT ) + e′ (kT )(t − kT ), kT ≤ t < (k + 1)T
e(kT )−e((k−1)T )
≃ e(kT ) + T (t − kT )
T 2T
1
2T
0
T
−1
1 2
eo (t) = u(t) + T tu(t) − 2u(t − T ) − T (t − T )u(t − T )
1
+u(t − 2T ) + T
(t − 2T )u(t − 2T )
2
1+T s 1−e−T s
Gh1 (s) = T s
14
Fractional-Order Holds
Idea: Given a sequence of sampled data reconstruct the signal between
sampling times approximately as follows
eo (t) ≃ e(kT ) + ηe′ (kT )(t − kT ), kT ≤ t < (k + 1)T
1
2T
0
T
−1
−T s
η
Ghη (s) = (1 − ηe−T s ) 1−es + T s2 (1 − e−T s )2
15