Professional Documents
Culture Documents
Lecture 3 Sampling of Continuous-Time Signals
Lecture 3 Sampling of Continuous-Time Signals
Dheeraj Kumar
dheeraj.kumar@ece.iitr.ac.in
1 Periodic sampling
5 Impulse invariance
2 / 59
Introduction
3 / 59
Table of Contents
1 Periodic sampling
5 Impulse invariance
4 / 59
Mathematical representation of sampling
5 / 59
Ambiguity in sampling
6 / 59
Ambiguity in sampling
7 / 59
The sampling process
8 / 59
The sampling process
1 Periodic sampling
5 Impulse invariance
10 / 59
Time-domain representation of modulation
11 / 59
Frequency-domain representation of modulation
12 / 59
Frequency-domain representation of modulation
13 / 59
Frequency-domain representation of modulation
14 / 59
Frequency-domain representation of modulation
15 / 59
How to recover xc (t) from xs (t)
16 / 59
Exact recovery of xc (t) from xs (t)
17 / 59
Imperfect recovery of xc (t) from xs (t)
❑ If Ωs < 2ΩN
❑ Copies of Xc (jΩ) overlap
❑ When added together, Xc (jΩ) is no longer recoverable by lowpass
filtering
❑ Input signal: xc (t) = cos(Ω0 t)
Ω0
❑ Sampling frequency Ωs < 2
Ωs
❑ Low pass filter cutoff frequency Ωc = 2
18 / 59
Imperfect recovery of xc (t) from xs (t)
19 / 59
Nyquist Sampling Theorem
20 / 59
Relationship between F{x[n]} and Xc (jΩ)
21 / 59
Relationship between F{x[n]} and Xc (jΩ)
24 / 59
Aliasing example
25 / 59
Aliasing example
26 / 59
Table of Contents
1 Periodic sampling
5 Impulse invariance
27 / 59
Time-domain representation of reconstruction
❑ The output
P of this filter will be:
xr (t) = ∞
n=−∞ x[n]hr (t − nT )
28 / 59
Time-domain representation of reconstruction
29 / 59
Time-domain representation of reconstruction
30 / 59
Ideal discrete-to-continuous-time (D/C) converter
P∞ −jΩTn
❑ Xr (jΩ) = n=−∞ x[n]Hr (jΩ)e = Hr (jΩ)X (ejΩt )
❑ Output of ideal D/C converter is always bandlimited
❑ Maximum frequency = cutoff frequency of the lowpass filter (Ωc ),
typically taken to be Ω2s
31 / 59
Table of Contents
1 Periodic sampling
5 Impulse invariance
32 / 59
Introduction
34 / 59
The overall system
❑ The relation between y [n] and x[n] (or equivalently, Y (ejω ) and
X (ejω )) is given by the properties of the discrete time system
❑ A very simple example: identity system (y [n] = x[n])
❑ if xc (t) has a bandlimited Fourier transform
π
❑ Xc (jΩ) = 0 for |Ω| ≥ T
❑ y [n] = x[n] = xc (nT )
❑ Output: yr (t) = xc (t)
35 / 59
Linear time-invariant discrete-time system
36 / 59
Linear time-invariant discrete-time system
π
❑ If Xc (jΩ) = 0 for |Ω| ≥ T (Band-limited signal, no aliasing)
1
❑ The ideal lowpass reconstruction filter Hr (jΩ) cancels the factor T
and selects only the term for k = 0
❑
(
π
H(ejΩT )Xc (jΩ), |Ω| < T
Yr (jΩ) = π
0, |Ω| ≥ T
= Heff (jΩ)Xc (jΩ)
(
π
H(ejΩT ), |Ω| < T
❑ Heff (jΩ) = π
0, |Ω| ≥ T
37 / 59
Overall linear time-invariant continuous-time
system
38 / 59
Table of Contents
1 Periodic sampling
5 Impulse invariance
39 / 59
Problem formulation
40 / 59
Problem formulation
41 / 59
Steps 1 and 2
42 / 59
Step 3
43 / 59
Step 4
44 / 59
Step 5
45 / 59
Step 6
46 / 59
Discussion
47 / 59
Table of Contents
1 Periodic sampling
5 Impulse invariance
48 / 59
Problem formulation
49 / 59
Discrete-time implementation
50 / 59
Sinusoidal input
51 / 59
Output for sinusoidal input
53 / 59
Table of Contents
1 Periodic sampling
5 Impulse invariance
54 / 59
Impulse response of equivalent system
55 / 59
Impulse response of equivalent system
56 / 59
Impulse response of equivalent system
57 / 59
Discrete-time lowpass filter obtained by impulse
invariance
0, |Ω| ≥ Ωc
❑ We can define the impulse response of the discrete-time system
to be:
❑ h[n] = Thc (nT ) = T sin(Ωc nT )
πnT = sin(ωc n)
πn
❑ Where, ωc = Ωc T
❑ This sequence
( corresponds to discrete-time Fourier transform
1, |ω| < ωc
H(ejω ) = = Hc (j Tω )
0, ωc < |ω| ≤ π
58 / 59
Thanks.