Professional Documents
Culture Documents
Chapter 4:
Sampling of Continuous-Time Signals
Content and Figures are from Discrete-Time Signal Processing, 2e by Oppenheim, Shafer and Buck, 1999-2000 Prentice Hall Inc.
4.1 Periodic Sampling
In this method x[n] obtained
from xc(t) according to the
relation :
x [n ] x c (nT ) n
T sampling period f s 1/T sampling frequency
2
S ( j)
T
( k )
k
s where s 2 / T is the sampling rate in radians/s.
1 1
X s ( j )
2
X c ( j ) * S ( j )
T
X j ( k )
k
c s
consequently
1 2k
j
X s ( j ) X (e ) X (e j T
) X (e ) X c j
j
T
T k T T
(b) represents a
periodic impulse train
with S frequency.
=
Chapter 4: Sampling of Continuous-Time Signals 6
Aliasing Distortion
(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.
X C ( j ) 0 for N
N 0 N
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 2N
Chapter 4: Sampling of Continuous-Time Signals 11
Critically Sampled
Critically sampled: N T S or S 2N
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 )
Chapter 4: Sampling of Continuous-Time Signals 12
Undersampled (aliased)
If sampling theorem condition is not satisfied N T S or S 2N
A
X (e j )
Ts
2 0 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.
we choice C S / 2 /T.
This choice is appropriate for
any relationship between S
and N .
sin( t /T )
hr (t )
t /T
sin( (t nT ) /T )
x r (t ) x [n ]
n (t nT ) /T
The properties of the ideal D/C converter are most easily seen in the
frequency domain.
x r (t )
n
x [n ]hr (t nT ) X r ( j )
n
x [n ]H r ( j )e j Tn
X r ( j ) H r ( j ) x [n ]e j Tn
n
X r ( j ) H r ( j )X (e j T )
Chapter 4: Sampling of Continuous-Time Signals 17
4.4 Discrete-Time Processing of
Continuous-Time Signals
A major application of discrete-time systems is in the processing of
continuous-time signals.
IF X C ( j ) 0 for /T then
H (e j T )X C ( j ), /T
Y r ( j )
0, /T
H (e j T )X C ( j ), /T
Y r ( j ) H eff ( j )X C ( j )
0, /T
H (e j T ), /T
H eff ( j )
0, /T
j
1, C
H (e )
0, C
C
1,
H eff ( j ) T
0, C
T
H (e j ) j /T with period 2
0, n 0
n cos( n ) sin( n )
h [n ] cos( n )
n T2
nT , n 0
X (e j ) ( 0 ) ( 0 ) 0 0T
j j jj
Y (e ) H (e )X (e ) [ ( 0 ) ( 0 )]
T
j 0 j
Y (e j ) ( 0 ) 0 ( 0 )
T T
Y r ( j ) TY (e j T ) j 0 ( 0 ) j 0 ( 0 )
d
y r (t ) 0 sin(0t ) [x c (t )]
dt
Chapter 4: Sampling of Continuous-Time Signals 24
4.4.2 Impulse Invariance
If the desired continuous-time system has bandlimited frequency
response H C ( j ) then how to choose H (e j ) so that
H eff ( j ) H c ( j )
H (e j T ), /T
H eff ( j )
0, /T
H (e j ) H c ( j /T ),
T be choosen such that H c ( j ) 0 /T
h [n ] Thc (nT )
In this case the discrete-time system is said to be an impulse-
invariant version of the continuous time system.
1, c
H c ( j )
0, c
sin(c t )
hc (t )
t
sin(c nT ) sin(c n )
h [n ] Thc (nT ) T
nT n
1
2 k
x [n ] x c (nT ) X (e j
)
T
k
X C ( j (
T
T
))
1 2 r
x d [n ] x c (nMT ) X d (e )
j
MT r
X C ( j (
MT MT
))
r i kM k , 0 i M 1
1 M 1
1
2 k 2 i
X d (e j
)
M
i 0 T
k
XC(j(
MT
T
))
MT
1 M 1
j
X d (e )
M i 0
X (e j ( / M 2 i / M )
)
sin( n / L )
h i [n ]
n /L
sin( (n kL ) / L )
x i [n ] x [k ]
k (n kL ) / L
therefore x i [n ] x [n / L ] x c (nT / L ) x c (nT ) n 0, L , 2L ,...
If the input sequence x [n ] x c (nT ) was obtained by sampling
without aliasing then x i [n ] x c (nT ) is correct for all n, And x i [n ]
is obtained by oversampling of x c (t ) .