Professional Documents
Culture Documents
3.1 Introduction
Let gδ (t ) denote the ideal sampled signal
∞
gδ ( t ) = ∑ g (nT ) δ (t − nT )
n = −∞
s s (3.1)
If G ( f ) = 0 for f ≥ W and Ts = 1
2W
∞
n jπ n f
Gδ ( f ) = ∑ g ( ) exp( − ) (3.4)
n = −∞ 2W W
2
With
1.G ( f ) = 0 for f ≥W
2. f s = 2W
we find from Equation (3.5) that
1
G( f ) = Gδ ( f ) , − W < f < W (3.6)
2W
Substituting (3.4) into (3.6) we may rewrite G ( f ) as
1 ∞
n jπnf
G( f ) =
2W
∑
n = −∞
g(
2W
) exp( −
W
) , − W < f < W (3.7)
n
g (t ) is uniquely determined by g ( ) for − ∞ < n < ∞
2W
n
or g ( ) contains all information of g (t )
2W
3
n
To reconstruct g (t ) from g ( ) , we may have
2W
∞
g (t ) = ∫ G ( f ) exp( j 2πft )df
−∞
1 ∞
n jπ n f
∑
W
=∫ g( ) exp( − ) exp( j 2π f t )df
−W 2W 2W W
n = −∞
∞
n 1 n
= ∑ g(
W
n = −∞
)
2W 2W ∫−W exp j 2π f (t − 2W )df (3.8)
∞
n sin(2π Wt − nπ )
= ∑ g( )
n = −∞ 2W 2π Wt − nπ
∞
n
= ∑ g( ) sin c( 2Wt − n ) , - ∞ < t < ∞ (3.9)
n = −∞ 2W
(3.9) is an interpolation formula of g (t ) 4
Sampling Theorem for strictly band - limited signals
1.a signal which is limited to − W < f < W , can be completely
n
described by g ( ) .
2W
n
2.The signal can be completely recovered from g ( )
2W
Nyquist rate = 2W
Nyquist interval = 1
2W
When the signal is not band - limited (under sampling)
aliasing occurs .To avoid aliasing, we may limit the
signal bandwidth or have higher sampling rate.
5
Figure 3.3 (a) Spectrum of a signal. (b) Spectrum of an undersampled version
of the signal exhibiting the aliasing phenomenon.
6
Figure 3.4 (a) Anti-alias filtered spectrum of an information-bearing signal. (b)
Spectrum of instantaneously sampled version of the signal, assuming the use of a
sampling rate greater than the Nyquist rate. (c) Magnitude response of reconstruction
7
filter.
3.3 Pulse-Amplitude Modulation
1, 0< t< T
1
h(t ) = , t = 0, t = T (3.11)
2
0,
otherwise
The instantaneously sampled version of m(t ) is
∞
mδ ( t ) = ∑ m(nT )δ (t − nT )
n = −∞
s s (3.12)
∞
mδ (t ) ∗ h(t ) = ∫ mδ (τ )h(t − τ )dτ
−∞
∞ ∞
=∫
−∞
∑ m(nT )δ (τ − nT )h(t − τ )dτ
n = −∞
s s
∞ ∞
= ∑ m(nTs) ∫ δ (τ − nTs)h(t − τ )dτ (3.13)
n = −∞
−∞
11
Pulse Width and Pulse Position Modulation
analog 比較大時
m1= -A
mL+1=A
mk ≤ mk+1 for k=1,2,…., L
The kth partition cell is defined as
Jk: mk< m ≤ mk+1 for k=1,2,…., L
d(m,vk): distortion measure for using vk to represent values inside Jk .
Find the two sets {ν k }k =1 and {J k }k =1 , that minimize
L L
−A m∈J k
k =1
∑∫
2
D ( m − ν k ) f M ( m )dm, (3.43)
m∈J k
k =1
∂D L
−2∑ ∫
= ( m − ν k ) f M ( m )dm =
0 (3.44)
∂ν k k =1
m∈J k
ν k , opt =
∫ m∈J k
m f M ( m )dm
(3.45)
∫ m∈J k
f M ( m )dm
Probability Pk (given)
= E M mk 〈 m ≤ mk + 1 (3.47)
Figure 3.15 Line codes for the electrical representations of binary data.
(a) Unipolar NRZ signaling. (b) Polar NRZ signaling.
(c) Unipolar RZ signaling. (d) Bipolar RZ signaling.
(e) Split-phase or Manchester code.
Page 49
Fig 1.11
Differential Encoding (encode information in terms of signal
transition; a transition is used to designate Symbol 0)
Synchronization
Example 2.2 The T1 System
3.10 Digital Multiplexers
[ ]
p
J = E x 2 [n ] − 2∑ wk E [x[n ]x[n − k ]]
k =1
p p
+ ∑∑ w j wk E [x[n − j ]x[n − k ]] (3.62)
j =1 k =1
Assume X (t ) is stationary process with zero mean ( E[ x[n ]] = 0)
σ X2 = E [x 2 [n ]] − ( E [x[n ]]) 2
[
= E x 2 [n ] ]
The autocorrelation
RX (τ = kTs ) = RX [k ] = E [x[n ]x[n − k ]]
We may simplify J as
p p p
J = σ X2 − 2∑ wk RX [k ] + ∑∑ w j wk RX [k − j ] (3.63)
k =1 j =1 k =1
∂J p
= −2 RX [k ] + 2∑ w j RX [k − j ] = 0
∂wk j =1
p
∑ w R [k − j ] = R [k ] = R [− k ] , k = 1,2, ,p (3.64)
j =1
j X X X
wk [n + 1] = wk [n ] − µg k , k = 1,2 , ,p (3.69)
1
2
1
where µ is a step - size parameter and is for convenience
2
of presentation.
Differentiating (3.63), we have
∂J P
gk = = −2 R X [k ] + 2 ∑ w j R X [k − j ]
∂wk j =1
p
= −2 E [x [n ]x [n − k ]] + 2 ∑ w j E [x[n − j ]x[n − k ]] , k = 1,2, , p (3.70)
j =1