Lecture 09 Sampling of CTS
Lecture 09 Sampling of CTS
Arbab Latif
Spring 2024
Resources:
Discrete Time Signal Processing, A. V. Oppenheim and R. W. Schaffer, 3rd Edition, 2010 (Chapter 4.1-4.3)
2 Overview:
• Periodic Sampling
-3 -2 -1 0 1 2 3 4
𝑥 𝑛 = 𝑥𝑐 𝑛𝑇 −∞ < 𝑛 < ∞
0.5
-0.5
-1
0 20 40 60 80 100
∞
2𝜋
𝑆(𝑗Ω) = 𝛿(Ω − 𝑘Ω𝑠 ) where Ω𝑠 = 2𝜋/𝑇 is the sampling rate in radians/s.
𝑇
𝑘=−∞
∞
1 1
𝑋𝑠 (𝑗Ω) = 𝑋𝑐 (𝑗Ω) ∗ 𝑆(𝑗Ω) = 𝑋𝑐 𝑗(Ω − 𝑘Ω𝑠 )
2𝜋 𝑇
𝑘=−∞
10
Frequency Domain Representation
of Sampling
• By applying the continuous-time Fourier transform to
equation +∞
consequently
∞
1 𝜔 2𝜋𝑘
𝑋𝑠 (𝑗Ω) = 𝑋(𝑒 𝑗𝜔 )ቚ = 𝑋(𝑒 𝑗Ω𝑇 ) ⇒ 𝑋(𝑒 𝑗𝜔 ) = 𝑋𝑐 𝑗 −
𝜔=Ω𝑇 𝑇 𝑇 𝑇
𝑘=−∞
11
Exact Recovery of Continuous-Time
from Its Samples
• (a) represents a band
limited Fourier
transform of xc(t)
Whose highest nonzero
frequency is N .
• (b) represents a
periodic impulse train
with S frequency.
=
13 Aliasing Distortion
• (b) represents a
periodic impulse train
with S frequency.
𝑋𝐶 (𝑗Ω) = 0 for Ω ≥ Ω𝑁
Ω
−Ω𝑁 0 Ω𝑁
0
− N N
• Then if T S is sufficiently small, X (e j
) appears as:
A X (e j )
Ts
− N T S N T S
− 2 −
0
2
• Condition: 2 − N T S N T S or N T S or S 2 N
18 Critically Sampled
Critically sampled: N T S = or S = 2 N
A X (e j )
Ts
− 2 − 0 2
According to the Sampling Theorem, in general the signal cannot be
reconstructed from samples at the rate T S = / N .
This is because of errors will occur if X c ( N ) 0 , the folded
frequencies will add at = .
Consider the case: x c (t ) = A sin( N t ) Aj ( − N ) − ( + N )
and note that for T S = / N .
x (nT s ) = A sin(c nT s ) = A sin(n ) = 0 (for all n )
19 Undersampled (aliased)
0
−2𝜋 −𝜋 𝜋 2𝜋
• The frequencies are folded - summed. This changes the shape of the
spectrum. There is no process whereby the added frequencies can be
discriminated - so the process is not reversible.
• Thus, the original (continuous) signal cannot be reconstructed exactly.
Information is lost, and false (alias) information is created.
• If a signal is not strictly band-limited, sampling can still be done at twice the
effective band-limited.