Académique Documents
Professionnel Documents
Culture Documents
1
(a)
E 2T
P0
(b)
E 10T1 2T2
P0
(c)
E
1
P
2
(d)
E
P
A2
2
(e)
E
3
P
8
(f)
E T
P0
(g)
1
4a
P0
(h)
A2T 3
E
4
P0
(i)
E
1
P lim
T T
3 T
t
3
33 T 3 3 3
1/3
2/3t
dt lim
3 T
3 lim
1/3
2.2
(a)
(b)
(c)
2
(d)
2.3
(a)
X ( s)
5
s 1
(b)
x(t ) 5t eln(5
1
X ( s)
s ln(5)
(c)
5
s 1
(d)
5
s 1
e t ln(5)
2.4
(a)
X (s)
(b)
2 4 4 2 4s 4s
s3 s 2 s
s3
x(t ) t 2 e 3t u (t ) t 2 4t 4 e 3t u (t )
2
X ( s)
(c)
x(t ) t 2 u (t ) t 2 4t 4 u (t )
s 3
s 3
4
26 20 s 4 s 2
3
s3
s 3
x(t ) cos 0t u (t )
4
cos cos 0t sin sin 0t u (t )
4
4
1
1
cos 0t
sin 0t u (t )
2
2
0
s
1
1
1 s 0
X (s)
2
2
2
2
2
2
2 s 0
2 s 0
2 s 0
(d)
x(t ) e 3t cos 0t u (t )
3
e 3t cos cos 0t sin sin 0t u (t )
3
3
3
sin 0t u (t )
e 3t cos 0t
2
2
X ( s)
0
1
3
1 s 3 30
s3
2
2
2
2
2 s 3 0
2 s 3 0 2 s 32 02
2.5
(a)
1
1
j
j
X (s) 2
2
s2 j s2 j
1
x(t ) j e (2 j ) t j e (2 j ) t u (t )
2
1
1
e 2t e jt je jt e jt je jt u (t )
2
2
e 2t cos(t ) 2sin(t ) u (t )
5e 2t cos t 63.4 u (t )
(b)
X ( s)
4
4
4
s 2 s 1 s 12
X ( s)
4
4
4
2
s 2 s 2
s 1
2.6
(a)
(b)
3
2
1
s 3 s 2 s 1
x(t ) 3e 3t 2e 2t e t u (t )
X ( s)
X (s)
229
54
216
108
135
13
2
3
2
s 3 s 3 s 3 s 2 s 2
s 1
(c)
X (s)
32
31
30
21
20
1
2
3
2
s 3 s 3 s 3 s 2 s 2
s 1
2.7
(a)
(b)
For real and distinct poles, we require a12 4a0 . In this case, the poles
For real and repeated poles, we require a12 4a0 . In this case, the poles
are s a1 , s a1 .
(iii)
For complex conjugate poles, we require a12 4a0 . In this case, the poles are
s a1 j 4a0 a12
(c)
(i)
n a0
a1
2 a0
For real and distinct poles, we require 1 . In this case, the poles
are s n n 2 1
(iii)
For real and repeated poles, we require 1 . In this case, the poles
are s n , s n .
(iv)
(v)
This form is preferred because the nature of the poles is determined by a single
parameter.
(d)
(i)
b0
H (s)
h(t )
(ii)
H ( s)
b0
s 2 2n s n2
2n 1
n
e
2 1
n
e
2 1
b0 ent
2n
b0
n 1
2
s n 2 1
b0
2n
b0
2
2 1 t
2 1 t
2n 2 1
s n 2 1
u (t )
n 2 1 t
u (t )
n 2 1 t
e n t sinh n 2 1 t u (t )
b0
s n
h(t ) b0te nt u (t )
(iii)
b0
H (s)
h(t )
(e)
b0
j 2n 1
s n j 1 2
b0
j 2n
e n t e jn
2
1
b0 e n t
n 1
j 2n 1 2
s n j 1 2
1 2 t
e n t e jn
1 2 t
u (t )
sin n 1 2 t u (t )
An overdamped system does not display any oscillations in its impulse response, whereas
the underdamped system does display oscillations. Hence, the term damped refers to
oscillations: if oscillations are present, the oscillations have not been damped; if there are
no oscillations, the oscillations have been damped.
2.8
(a)
6
6 5 5
5
X ( s)
s6
s6 s s s6
6 t
y (t ) 5 1 e u (t )
Y (s)
(b)
x(t)
y(t)
6
4
2
0
(c)
(d)
0.1
0.2
0.3
0.4
0.5
t
0.6
0.7
0.8
0.9
6s
6s 5
30
X (s)
s6
s6 s s6
6 t
v(t ) 30e u (t )
V ( s)
30
v(t)
20
10
0.1
0.2
0.3
0.4
0.5
t
0.6
0.7
0.8
0.9
2.9
(a)
6
6 5
5 5/6 5/6
X (s)
2
2
s6
s6 s
s
s
s6
5
y (t ) 5t 1 e6t u (t )
6
Y (s)
(b)
x(t)
y(t)
6
4
2
0
(c)
V ( s)
0.1
0.2
0.3
0.4
0.5
t
0.6
0.7
0.8
0.9
6s
6s 5
30
5
5
X (s)
2
s6
s6 s
s ( s 6) s s 6
v(t ) 5 1 e 6t u (t )
(d)
5
v(t)
4
3
2
1
0
0.1
0.2
0.3
0.4
0.5
t
0.6
0.7
0.8
0.9
2.10
(a)
6
6
5 5 15
10
X ( s) 2
s 5s 6
s 5s 6 s s s 2 s 3
2 t
3t
y (t ) 5 1 3e 2e u (t )
Y (s)
(b)
6
5
4
3
2
x(t)
y(t)
1
0
(c)
(d)
0.5
1.5
2.5
t
3.5
4.5
6s
6s
5
30
30
X ( s) 2
s 5s 6
s 5s 6 s s 2 s 3
2 t
3t
v(t ) 30 e e u (t )
V ( s)
5
v(t)
4
3
2
1
0
0.5
1.5
2.5
t
3.5
4.5
2.11
(a)
25 15
10
6
6
5
5
Y (s) 2
X (s) 2
2 6 2 3
2
s 5s 6
s 5s 6 s
s
s s2 s3
2
5 3
y (t ) 5 t e 2t e 3t u (t )
3
6 2
(b)
25
20
15
10
5
0
(c)
(d)
x(t)
y(t)
0
0.5
1.5
2.5
t
3.5
4.5
6s
6s
5 5 15
10
X ( s) 2
2
s 5s 6
s 5s 6 s
s s2 s3
v(t ) 5 1 3e 2t 2e 3t u (t )
V ( s)
5
v(t)
4
3
2
1
0
0.5
1.5
2.5
t
3.5
4.5
2.12
(a)
10 j 5
10 j 5
125
125
5 5
4
4
Y (s) 2
X (s) 2
s 10 s 125
s 10 s 125 s s s 5 j10 s 5 j10
10 j 5 j10t 10 j 5 j10t
y (t ) 5 e 5t
e
e
u (t )
4
4
5 5t
1
(b)
6
5
4
3
2
x(t)
y(t)
1
0
(c)
(d)
0.2
0.4
0.6
0.8
1
t
1.2
1.4
1.6
1.8
125
125
125s
125s
5
j4
j4
V ( s) 2
X ( s) 2
s 10s 125
s 10s 125 s s 5 j10 s 5 j10
125 5t j10t j10t
125 5t
u (t )
v(t )
e e e
e sin 10t u (t )
2
j4
40
v(t)
30
20
10
0
-10
0.2
0.4
0.6
0.8
1
t
1.2
1.4
1.6
1.8
2.13
(a)
2
4 j3
4 j3
125
5
5
125
20
20
X (s) 2
5 2
Y (s) 2
s 10 s 125
s 10 s 125 s 2
s
s
s 5 j10 s 5 j10
2
4 j 3 j10t 4 j 3 j10t
y (t ) 5t e 5t
e
e
u (t )
5
20
20
2
3
2 1
10
(b)
10
8
6
4
2
0
(c)
x(t)
y(t)
0
0.2
0.4
0.6
0.8
1
t
1.2
1.4
1.6
1.8
10 j 5
10 j 5
125s
125s
5 5
4
4
V (s) 2
X ( s) 2
2
s 10s 125
s 10s 125 s
s s 5 j10 s 5 j10
10 j 5 j10t 10 j 5 j10t
v(t ) 5 e 5t
e
e
u (t )
4
4
5 5t
1
(d)
8
v(t)
6
4
2
0
0.2
0.4
0.6
0.8
1
t
1.2
1.4
1.6
1.8
2.14
Y ( s)
k
2.15
The system transfer function is H ( s )
Y (s)
1
a a 2 4
2
. The poles are s
.
X ( s ) s as 1
2
(a)
The system is stable when the poles are in the left-half plane. The poles are in the left-half
plane for a 0 .
(b)
The system impulse response exhibits oscillations when the poles have a non-zero
imaginary part. The poles have a non-zero imaginary part when a 2 4 0 , which implies
2 a 2 . (Note that the system response is oscillatory and stable only for 0 a 2 .)
These results are summarized by the plot below. This plot, known as a root-locus plot, plots
the location of the poles as a function of a.
p1
1
p2
1
a=0
0.5
a -> infinity
a -> -infinity
-0.5
Imag(s)
Imag(s)
0.5
a -> -infinity
0
a -> infinity
-0.5
a=0
-1
-10
-5
0
Real(s)
10
-1
-10
-5
0
Real(s)
10
2.16
The system transfer function is H ( s )
a a a 4
Y ( s)
a
2
. The poles are s
.
2
X ( s ) s as a
(a)
The system is stable when the poles are in the left-half plane. The poles are in the left-half
plane for a 0 .
(b)
The system impulse response exhibits oscillations when the poles have a non-zero
imaginary part. The poles have a non-zero imaginary part when a 4 0 and a 0 ,
which implies 0 a 4 . (Note that the system response is oscillatory and stable for these
values of a.)
These results are summarized by the plot below. This plot, known as a root-locus plot, plots
the location of the poles as a function of a.
p2
1
0.8
0.8
0.6
0.6
0.4
0.4
0.2
0.2
a -> infinity
a=0
a -> -infinity
-0.2
Imag(s)
Imag(s)
p1
1
a -> -infinity
0
-0.4
-0.6
-0.6
-0.8
-0.8
-5
0
Real(s)
10
a -> infinity
-0.2
-0.4
-1
-10
a=0
-1
-10
-5
0
Real(s)
10
2.17
x t A cos 0t
(a)
X j
(b)
Xf
A j 0t A j 0t A j j0t A j j0t
e
e e e e
e
2
2
2
2
A j
A
e 2 0 e j 2 0
2
2
j
A e 0 A e j 0
A j
A
e f f 0 e j f f 0
2
2
2.18
Xf
at j 2 ft
dt e at e j 2 ft dt
0
j 2 f a
2a
2
a 4 2 f 2
X
at jt
1
j 2 f a
dt e at e jt dt
0
j a
2a
2
a 2
1
j a
2.19
The easiest way to compute the Fourier transform is to recognize that x t , plotted below
T
2
T
2
Fourier transform
sin fT
fT
Thus, the Fourier transform may be computed as follows:
Xf T
sin fT
fT
sin fT
fT
sin 2 fT
2 f 2T 2
Similarly,
T
T
sin
sin
2 T
2 T
X j T
T
T
2
2
T
sin 2
2
2
T
2
2.20
The easiest way to compute the Fourier transform is to recognize that x t is produced by the
convolution of the two functions shown below.
A
T2 T1
T2 T1
2
T2 T1
2
T2 T1
2
Fourier transform
T2 T1
T2 T1
2
Fourier transform
sin f T2 T1
T2 T1
f T2 T1
sin f T2 T1
f T2 T1
sin f T2 T1 sin f T2 T1
f T2 T1
f T2 T1
Similarly
T T
T T
sin 2 1 sin 2 1
2
2
X j A T2 T1
T T
T T
2 1
2 1
2
2
2.21
(a)
X f 1 e j 2 f
(b)
Let e j . Then X f 1 e j 2 f
X f X f X f 1 e j 2 f e j 2 f
2
1 2 cos 2 f
2
(c)
Xf
2.22
j
1 j
(a)
Y j 3e j 5
(b)
Y j e j 3 5
(c)
(d)
j 5
1 j 5
j
1 j
Y j
2
1 j
2.23
(a)
x t j 5e j 2 1000t 3e 6 e j 2 60t 16 3e
e j 2 60t j 5e j 2 1000t
j 2 60t 6
j 2 60 t
6
16 3 e
e
j 5 e j 2 1000t e j 2 1000t
(b)
1 1
1
Yes, x t is periodic. The period is LCM ,
.
60 1000 10
2.24
Using the identity
1
e 2t u (t ) and the property e j 2 ft0 X f x t t0 for the last
2 j 2 f
term, we have
1 j 2 2 t 1 j 2 2 t
e
e
e 2( t 2)u t 2
2
2
cos 2 2t e 2( t 2)u t 2
x t
2.25
(a)
Xf
B3
(b)
Xf
B3
(c)
1
a j 2 f
a 2 2 f
a
2
2a
a 2 2 f
a
2
X f e f
B3
Xf
2a
a 2 2 B3
1 2
2 a
2 1
ln(2)
2
X f e 2 f
2
e 2 B3
1
2
1
a 2 2 B3
1
2a 2
2.26
Using the transform pair
2T
set T
sin 2 fT
2 fT
1 T t T
,
0 otherwise
1
and apply Parsevals theorem:
2
sin 2 f
df
1
2
dt 1
2.27
(a)
Xf
x 2 (t )dt e 2 at dt
0
1
a j 2 f
2 at
2 at
e dt e dt
x 2 (t )dt
Xf
2a
a 2 2 f
B90
x 2 (t )dt
Xf e
Xf
t 2
df
Now, using e
0.45
u2
B90
2 f 2
2 2
2 B90
2 tan 1
du
df
1
4
1
df
4
u2
e 2 f df e 2 f df
2
du
u2
2
4 B90
1
4
1
du
2
2
1
and Q z
2
2
B90
2 f
a 2 2 B90
dt 1
2 f 2
4 B90
X f e 2 f
B90
4a 2
f 2
0.9 2 e 2 f df
1
a
0.9
4a
2
2
a
0
a 2 2 f
(c)
a
0.9
tan
2
a
a 2 2 f
2 B90
tan 1
0.9
df
2 2
2
2a
0 a 2 f
(b)
Xf
B90
B90
1
2a
u2
2 f 2
df
B90
2
1
2
2 2
1
2
4 B90
u2
2
du
1
Q
2
4 B90
4 B90
2.28
(a)
A2
A3
cos 2 0t
cos3 0t
2
3
2
3
2
A
A
A
A3
cos
t
cos
2
t
cos 30t
0
0
4
4
4
12
y t A cos 0t
(b)
Yf
A
576
3000
(c)
A3
4 f 1000 f 1000
A
f
4
A2
A3
f 2000 f 2000
f 3000 f 3000
8
24
A4
64
2000
A3
A
A3
A
4
4
A
16
1000
1000
A4
64
2000
A6
576
3000
A6
A6 A4 A4
1
9 A 4 A6
576
576
64
64
THD
100
100
2
2
9 16 A2 8 A4 A6
A3
A3
A
A
4
4
4
4
A plot of the THD is shown below. Note that the THD increases as the amplitude of the
sinusoid increases.
10
THD (%)
10
-2
10
-4
10
2
A
2.29
(a)
A
cos 0t A cos 1t
4
17 A2 A2
A2
A2
A2
x2 t
cos 20t
cos 21t
cos 1 0 t
cos 1 0 t
32
32
32
4
4
A3
A3
99 A3
27 A3
x3 t
cos 0t
cos 1t
cos 30t
cos 31t
256
32
256
4
3 A3
3 A3
cos 1 20 t
cos 1 20 t
64
64
3 A3
3 A3
cos 21 0 t
cos 21 0 t
16
16
17 A2 A 99 A3
3 A3
A2
A2
cos
t
A
cos
t
cos
2
t
cos 21t
y t
0
1
0
64 4 768
32
64
4
x t
A3
A3
A2
A2
cos 30t
cos 31t
cos 1 0 t
cos 1 0 t
768
12
8
8
A3
A3
cos 1 20 t
cos 1 20 t
64
64
A3
A3
cos 21 0 t
cos 21 0 t
16
16
(b)
Yf
A 99 A3
17 A2
f
f 60 f 60
64
8 1536
A 3 A3
f 7000 f 7000
2 64
A2
A2
f 120 f 120
f 14000 f 14000
128
8
A3
A3
f 180 f 180
f 21000 f 21000
1538
24
A2
A2
f 6740 f 6740
f 7060 f 7060
16
16
A3
A3
f 6880 f 6880
f 7120 f 7120
128
128
A3
A3
f 13940 f 13940
f 14060 f 14060
32
32
A3
24
21000
0
60 60
14000
14060 13940
7000
7060 6880
120
6740
7120
180
120
180
7000
6880
7060
6740
7120
13940
A2 A3
A3
A2
A3 A2
2
2
128 1538
128
16
32 8
2
2
A 99 A2 A 3 A2
8 1536 2 64
10
-2
10
-4
10
-6
10
3
A
21000
14060
A2
A3
A3
A2
A2
A3
A3
A2
A3
2
2
2
2
2
2
2 2
2
128
1538
128
16
16
128
32
8
32
ID
2 2
2 2
A 99 A
A 3A
2
2
8 1536
2 64
2
A3
24
14000
ID
(c)
A 99 A3 A 99 A3
2 2
8 1536 8 1536 A 3 A
2 2
17 A
2 64
2
2
2
A3 A2 2 64 A2 2 A3 2
A2
A2
2
2
2
2
2
A2 A3 2 8 A3 2
A3 8 A3 A 128 128
128 128
2
2
16
3
3
A
A
16 32
32
32
32
2
3 2
A3
1538
1538
A
128
128
2.30
x(t )
ce
ck
1
T0
T0
2
2 k
t
T0
sin
2 k
2
k
j
t
A
2 j 2
T0
0
Ae
dt
e
k
2
A
k
2
j
k
Xf
k
ck f
T0
5
T0
Xf
A
3
A
5
A
7
7
T0
k , odd
A
2
k , even
c f T
Xf
k 0
3
T0
A
3
1
T0
1
T0
3
T0
A
5
5
T0
A
7
7
T0
2.31
x(t )
ce
1
ck
T0
Xf
T0
2
Ae
2 k
t
T0
2 k
t
T0
T0
1
dt
T0
T0
2
0
sin
2 k
k
t
j
j
k
2
T0
2
0
Ae
dt A
1 e
k
2A
k
2
j
k
k 0
k , even
k , odd
c f T
Xf
k
ck f
T0
Xf
7
T0
5
T0
2A
2A
3
2A
5
2A
7
2A
3
T0
2A
3
1
T0
1
T0
3
T0
2A
5
5
T0
2A
7
7
T0
2.32
x(t )
ce
ck
T1
1
T0
Ae
2 k
t
T0
2 k
t
j
T0
Xf
j k T1
e T0
c f T
Xf
k T1
sin
T
2 T0
dt A 1
k T1
T0
2 T0
k
ck f
T0
T1
T0
Xf
T
A 1
T0
fT1
sin
2
fT1
2
8
T0
7
T0
6
T0
5
T0
4
T0
3
T0
2
T0
1
T0
1
T0
2
T0
3
T0
4
T0
5
T0
6
T0
7
T0
8
T0
2.33
x(t )
ce
ck
1
T0
Xf
T0
2
2 k
t
T0
A
2
2 k
2 k
T
2 A j T0 t
1 0
2 A j T0 t
A
k
dt 2 2 1 1 0
te
dt 2 A
t e
T0
T0 T0
T0
k
2A
2
2 2
k
2A
49 2
7
T0
k , even
k , odd
k
ck f
T0
A
2
k 0
c f T
Xf
2A
25 2
5
T0
Xf
2A
2A
2A
9 2
3
T0
2A
9 2
1
T0
1
T0
3
T0
2A
25 2
5
T0
2A
49 2
7
T0
2.34
x(t )
ce
k
1
ck
T0
T0
4
T0
4
2 k
t
T0
4A
te
T0
2 k
t
T0
1
dt
T0
3T0
4
T0
4
4A j
2
A
t e
T0
2 k
t
T0
dt j
4A
k
sin
2 2
k
2
0
k 0
0
k , even
k
4A
j 2 2 sin
k , odd
k
2
Xf
c f T
Xf
k
ck f
T0
Xf
4A
49 2
7
T0
4A
25 2
5
T0
4A
4A
4A
9 2
3
T0
4A
9 2
1
T0
1
T0
3
T0
4A
25 2
5
T0
4A
49 2
7
T0
2.35
x(t )
ce
k
1
ck
T0
Xf
2 k
t
T0
T0
A
0 T0 te
2 k
t
T0
A
2
dt
j A
2 k
k 0
k 0
c f T
Xf
k
ck f
T0
A
2
A
2
A
14
7
T0
A
12
6
T0
5
T0
4
T0
3
T0
A
2
A
4
A
6
A
8
A
10
Xf
2
T0
A
4
1
T0
1
T0
2
T0
A
6
3
T0
A
8
4
T0
A
10
5
T0
A
12
6
T0
A
14
7
T0
2.36
x(t )
ce
k
ck
1
T0
2 k
t
T0
T0
2
t e
0
A sin T
0
j A
2A
k2 1
Xf
k 1
k , odd, k 1
k , even
c f T
Xf
A
k
k 2 1 1 1 k 1
dt
A
j
k 1
k 0
2 k
j
t
T0
k
ck f
T0
2A
A
4
Xf
A
4
2A
3
2A
35
6
T0
2A
3
2A
15
4
T0
2A
15
2
T0
1
T0
1
T0
2
T0
4
T0
2A
35
6
T0
2.37
x(t )
ce
k
2
ck
T0
Xf
4 k
t
T0
T0
2
0 A sin T0
j
t e
4 k
t
T0
dt
2A
4k 2 1
2k
cf T
Xf
2k
ck f
T0
2A
Xf
2A
3
2A
35
6
T0
2A
3
2A
15
4
T0
2A
15
2
T0
2
T0
4
T0
2A
35
6
T0
2.38
p t
p t
ce
1
ck
T
T
2
2 k
t
T
t nT e
T n
2
1 j
Thus, p t e
T k
2 k
t
T
1
dt
T
2
T
t e
T
2
2 k
t
T
dt
1
T
2 k
t
T
P j
T
2
2 k
.
T
2 k
t
T
2 k
2
we have
T
2.39
The key to solving this problem is to understand what H f does to cos 2 f1t . The Fourier
1
1
f f1 f f1 . When this is the input, the Fourier
2
2
j
j
transform of the output of H f is f f1 f f1 whose inverse Fourier
2
2
j
j
transform is e j 2 f1t e j 2 f1t sin 2 f1t . Armed with this relationship, we may now
2
2
compute y t :
transform of cos 2 f1t is
Yf
1
2
1
2
1
2
1
2
1162
1161
1161
1162
f (kHz)
2.40
The Fourier transform of the upper input to the adder is
1165
1160
1155
1155
1160
1165
f (kHz)
f (kHz)
z t sin 2 f 0t
1165
1160
1155
1155
1160
1165
f (kHz)
The result is
Yf
1165
1160
1160
1165
f (kHz)
2.41
The key to solving this problem is to understand what H f does to cos 2 f1t . The Fourier
1
1
f f1 f f1 . When this is the input, the Fourier
2
2
j
j
transform of the output of H f is f f1 f f1 whose inverse Fourier
2
2
j
j
transform is e j 2 f1t e j 2 f1t sin 2 f1t . Armed with this relationship, we may now
2
2
compute y t :
transform of cos 2 f1t is
Yf
1
2
1
2
1
2
1
2
1159
1158
1158
1159
f (kHz)
2.42
The Fourier transform of the upper input to the adder is
1165
1160
1155
1155
1160
1165
f (kHz)
f (kHz)
z t sin 2 f 0t
1165
1160
1155
1155
1160
1165
f (kHz)
The result is
Yf
1160
1155
1155
1160
f (kHz)
2.43
Xf
(a)
3
3
2
3
2
1000
1000
2000
3000
1000
2000
3000
f
3000
2000
Hf
f
3000
2000
1000
Yf
1
2000
1000
1000
2000
f
3000
3000
(b)
f
3000
2000
1000
1000
2000
3000
1000
2000
3000
Hf
f
3000
2000
1000
Yf
2
2
3
2
3
f
3000
2000
1000
1000
2000
3000
2.44
Xf
(a)
1
1
1
2
1
2
440
440
f
3000
2000
2000
3000
Hf
2
1
f
3000
2000
1000
1000
2000
3000
Yf
1
2000
440
440
2000
f
3000
3000
(b)
1
4
1
2
1
2
1
4
f
3000
880 440
440 880
3000
Hf
2
1
f
3000
2000
1000
1000
2000
3000
Yf
1
2
1
2
f
3000
880 440
440
880
3000
Xf
(c)
1
1
1
2
1
2
600
600
f
2600
2600
Hf
2
1
f
3000
2000
1000
1000
2000
3000
Yf
1
2600
600
600
2600
(d)
Xf
A
2
A
8
A
8
60
60
A
2
f
7000
7000
Hf
2
1
f
3000
2000
1000
1000
2000
3000
Yf
A
4
A
4
60
60
f
3000
y t
A
cos 2 60t
2
3000
Xf
(e)
3
4
3
4
3
4
3
4
3600
1800
1800
3600
f
Hf
2
1
f
3000
2000
1000
1000
2000
3000
Yf
3
4
3
4
1800
1800
y t
3
cos 2 1800t
2
2.45
H f
xt
y t
cos2 70t
cos2 70t
1
4
1
4
1
2
Hf
4
f
1
f
1
Yf
1
71 70 69
69
70
71
2.46
H f
xt
G f
y t
cos2 3930t
cos2 5930t
1
2
1
2
1
2
1
2
f
11930
120
70
20
20
70
120
11930
Hf
2
f
100 70 40
40
70 100
f
100 70 40
1
2
1
2
40
70 100
1
2
1
2
f
4030 4000 3970
3860
3860
G f
f
4050 4000 3950
3950
Yf
4000
4050
f
4030 4000 3970
2.47
H f
xt
G f
y t
cos2 3930t
cos2 5930t
1
2
1
2
1
2
1
2
f
11930
120
70
20
20
70
120
11930
Hf
2
f
120
70
20
20
70
120
1
f
120
1
2
1
2
70
20
20
70
120
1
2
1
2
f
4050 4000 3950
3860
3860
G f
3950
4000 4050
f
4050 4000 3950
3950
Yf
4000
4050
1
f
4050 4000 3950
3950
4000 4050
2.48
Yf
(a)
5
4
71
70
69
69
70
71
f (MHz)
71
f (MHz)
Yf
(b)
5
4
71
(c)
70
69
69
70
I t
2
y t
cos 2 f1 f 0 t
Q t
I t
I t
2
sin 2 f1 f 0 t
cos 2 f1 f 0 t
2
In part (a), f 0 930 so that
y t
In part (b), f 0 1070 so that
y t
I t
2
I t
cos 2 f1 f 0 t
Q t
Q t
2
cos 2 70t
cos 2 70t
sin 2 f1 f 0 t
sin 2 f1 f 0 t
Q t
2
Q t
sin 2 70t
sin 2 70t
2
2
The difference is the sign of the quadrature term (the term involving sin 2 ft ).
2.49
(a)
Xf
9
0.1
(b)
0.1
Yf
0.1
0.1
2.50
(a)
Fourier transform of input to H(f)
H(f)
G(f)
f
sum of house and half-ellipse
Hf
f2
455
f1
G f
f1
455
f2
0 f1 450
460 f 2 1850
(b)
Fourier transform of input to H(f)
r t
image
rejection
BPF
H f
G f
cos2f 0t
cos2f1t
f 0 705 kHz
f1 455 kHz
xt
2.51
(a)
Fourier transform of input to H(f)
H(f)
G(f)
f
sum of house and half-ellipse
Hf
f2
455
f1
G f
f1
455
f2
0 f1 450
460 f 2 1850
(b)
Fourier transform of input to H(f)
r t
image
rejection
BPF
Hf
G f
cos2f 0t
cos2f1t
f 0 705 kHz
f1 455 kHz
xt
2.52
(a)
Xf
15 19 23
38
(b)
l t r t
LPF 1
x t
BPF 1
2r t
l t r t
cos 4 f 0t
LPF 1
LPF 2
1
15
2l t
LPF 2
BPF 2
53
15
15
15
BPF 1
1
f
53
38
23
23
38
53
BPF 2
1
f
21
17
17
21
2.53
(a)
1
1
x t e j 2 f 0 t x t e j 2 f 0 t
2
2
1
1
X f f0 X f f0
2
2
(b)
Ac
2
Ac
2
f
fc B
(c)
(d)
fc fc B
fc B
fc
fc B
fc B
The minimum theoretical approach would be to space the carriers 2B Hz apart. But, this
would require ideal low-pass filters. Real filters require a transition band thus
necessitating a larger spacing. In commercial broadcast AM, for example, the channel
assignments are every 2B = 10 kHz, but broadcast stations are not assigned to adjacent
channels in any given geographical area. Instead, the closest spacing is every other
channel slot.
2.54
Mf
(a)
Am
2
Am
2
fm
(b)
fm
s t Am cos 2 f m t Ac cos 2 f c t
Am Ac
A A
cos 2 f c f m t m c cos 2 f c f m t
2
2
Am Ac
f f c f m f f c f m f f c f m f f c f m
S f
4
S f
(c)
Ac Am
4
Ac Am
4
Ac Am
4
Ac Am
4
f
fc f m fc fc fm
fc f m
fc
fc fm
2.55
(a)
i.
R f
Ac
2
Ac
2
f
fc B
fc fc B
fc B
fc
fc B
Xf
Ac2
2
Ac2
4
2 f c B
ii.
2 f c
2 f c B
Ac2
4
2 fc B
2 fc
f
2 fc B
(b)
i.
ii.
A2
A2
x t
m t
cos 4 f c t
2
2
The filter removes the double frequency term and scales the baseband term by
Thus the filter output is
y t m t
(c)
i.
Ac2
Ac2
x t
m t cos
m t cos 4 f c t
2
2
y t m t cos
2
.
A2
ii.
The phase offset scales the output by the constant cos . This does not cause
any distortion, especially when is small. As
2.56
(a)
(b)
envelope output
(c)
The envelope detector does not preserve sign information. The solution is to reformat the
signal so that the envelope is never negative.
2.57
(a)
Ac
2
AAc
2
S f
AAc
2
Ac
2
f
fc B
(b)
fc fc B
fc B
fc
fc B
(c)
2.58
(a)
A Am
(b)
A f Ac A f
(c)
S f
Ac Am
AA
f fm c m f fm
2
2
1
1
A f fc A f fc
2
2
AA
AA
AA
c f fc c m f fc f m c m f fc f m
2
2
2
Ac A
AA
AA
f fc c m f fc f m c m f fc f m
2
2
2
(d)
S f
Ac A
2
Ac Am
4
Ac Am
4
Ac A
2
Ac Am
4
Ac Am
4
f
fc f m fc fc fm
fc f m
fc
fc fm
2.59
s t Ac Am cos 2 f m t cos 2 f c t
(a)
Ac Am
AA
cos 2 f c f m t c m cos 2 f c f m t
2
2
2 2
2 2
A A
A A
s 2 t c m c m cos 4 f c f m t
8
8
2 2
A A
A 2 A2
c m cos 4 f c t c m cos 4 f m t
4
4
2 2
2 2
A A
A A
c m c m cos 4 f c f m t
8
8
1
Pm
Tm
Tm
Ac2 Am2
0 s t dt 4
2
Ptot Pm
power ratio
(b)
Pm
1
Ptot
Ac Am
AA
cos 2 f c f m t c m cos 2 f c f m t
2
2
Ac2 A2 Ac2 A2
cos 4 f c t
2
2
A 2 A2 A 2 A2
A 2 A2 A 2 A2
c m c m cos 4 f c f m t c m c m cos 4 f c f m t
8
8
8
8
2
2
A AA
A AA
c m cos 2 2 f c f m t c m cos 4 f m t
2
2
2
2
A AA
A AA
c m cos 2 2 f c f m t c m cos 4 f m t
2
2
2 2
2 2
A A
A A
c m cos 4 f c t c m cos 4 f m t
4
4
Pm
Ac Am
4
1
Ptot
Tm
Tm
2
s t dt
0
2
4
Ac2 Am2
P
1
power ratio m 2 2 4 2 2
2
Ptot
Ac A
A A
c m 2 A 1
4
2
Am
A Am power ratio
1
3
2.60
(a)
1
s(t)
0.5
-0.5
-1
0.5
1.5
2
t
2.5
3.5
0.5
1.5
2
t
2.5
3.5
(b)
1
s(t)
0.5
-0.5
-1
2.61
(a)
(t ) 2f Am cos 2 f m d
0
Am f
, then (t ) sin 2 f m t and s (t ) Ac cos 2 f c t sin 2 f m t .
fm
Let
(b)
Am f
sin 2 f m t
fm
Ac cos 2 f c t (t ) Ac Re e
j 2 f c t ( t )
A Ree
c
j ( t )
e j 2 fct . Substitute
1
ck
T0
T0
s(t )e
j 2 kf m t
1
dt
T0
T0
j sin 2 f m t j 2 kf m t
dt
1
2
j sin x kx
dx J k
Thus s (t ) Ac
J cos 2 f
kf m t
(d)
Ac
J k f fc kf m f fc kf m
2 k
The bandwidth is infinite.
(e)
The power at the carrier frequency is determined by the k 0 in the answer to part (d).
The k 0 term is
Ac
J 0 f f c f f c
2
The condition of zero power at the carrier frequency occurs when J 0 0 . Thus the
S f
curious and interesting situation occurs at the values of corresponding to the zeros of
J 0 . The first five zeros are 2.4048, 5.5201, 8.6537,11.7915,14.9309 .
2.62
(a)
S f
S f
2
Ac
2
Ac2
4
J f f
J f f
2
k
S f df
2
2
c
A
4
Ac2
4
kf m f f c kf m
kf m f f c kf m
J k2 f f c kf m f f c kf m df
2
c
A
J 2 2 J
2
k
2
k
R J 02 2 J k2
k 1
| K=0
K=1
K=2
K=3
K=4
K=5
K=6
K=7
K=8
------+-------------------------------------------------------------------------------B = 1 | 0.58553 0.97282 0.99922 0.99999 1.00000 1.00000 1.00000 1.00000 1.00000
------+-------------------------------------------------------------------------------B = 2 | 0.05013 0.71535 0.96433 0.99759 0.99990 1.00000 1.00000 1.00000 1.00000
------+-------------------------------------------------------------------------------B = 5 | 0.03154 0.24616 0.25049 0.51670 0.82282 0.95921 0.99356 0.99926 0.99993
------+--------------------------------------------------------------------------------
The bold numbers indicate the smallest value of K which captures 98% of the power. The values
are
K 98 2 for 1
K 98 3
for
K 98 6
for
2
5
2.63
(a)
d
Ac cos 2 f c t (t ) Ac 2 f c (t ) sin 2 f c t (t )
dt
Ac 2 f c 2fm(t ) sin 2 f c t (t )
(b)
(c)
Ac 2 f c fAm
envelope
detector
output
Ac 2 f c
Ac 2 f c fAm
Ac 2fAm
y t
Ac 2fAm
2.64
(a)
(b)
(c)
H FM ( s)
sk p F ( s)
s k0 k p F ( s )
V ( s) H FM ( s)( s) s( s ) v(t )
sk p F ( s)
s F ( s)
s k0 k p F ( s )
The filter is a differentiator.
k0 1 should be avoided.
d
(t ) which is the desired result.
dt
s
k p 1 k0
2.65
(a)
1 1
1
h( n) u ( n)
2 2
2
(b)
1 1
1
h( n) u ( n)
3 2
2
(c)
1
h( n)
2
(d)
h(n) (n 1) 2 (n 2) 3 (n 3) 4 (n 4)
n 1
1
u (n 1) (n) 1
2
n
n 1
u (n 1)
n2
u (n 2)
n 1
u (n 1)
2.66
(a)
(b)
1
h( n) 2
2
H z
n 1
1
u (n 1) u (n 1)
2
3 j 4 z 1
1
1
1 j z 1
4
3
1
1
h( n) 3 j 4 j
4
3
1 5 j
1
j e
4 12
3
3 j 4 z 1
1
1
1 j z 1
4
3
n 1
1
1
u (n 1) 3 j 4 j
4
3
3 j 4 5e
1 5 j
1
j e
4 12
3
j
2
3 j 4 5e
j
2
n 1
u (n 1)
j 5e j
j 5e j
tan 1
4
5
h(n) 10
12
(c)
n 1
sin n u (n 1)
3 1
3 1
1 j z
1 j z
4
4
H z
1
1
1
1
1 j z 1 1 j z 1
3
3
4
4
3 1
1
h( n) 1 j j
4 4
3
n 1
3 1
1
u (n 1) 1 j j
4 4
3
1 5 j
1
j e
3 12
4
3 5 j
5
1 j e 2 j e j
4 4
4
1 5 j
1
j e
3 12
4
3 5 j
5
1 j e 2 j e j
4 4
4
tan 1
3
5 5
h( n)
2 12
n 1
sin n u (n 1)
n 1
u (n 1)
(d)
H z
2 z 2
2
2 z 1
1
1 z 1
4
1 1
1 z
2
n 1
n 1
1
1
h n 4 n 1 2 u n 1
2
4
2.67
(a)
Y ( z ) z 1Y ( z ) z 2Y ( z ) z 1
(b)
z 1
Y ( z)
1 z 1 z 2
(c)
Y ( z)
z
z
z z 1
1 5
1 5
z
z
2
2
5 5
5 5
10
10
1 5
1 5
z
z
2
2
5 5 1
5 5 1
z
z
10
10
1 5 1
1 5 1
z
z
1
1
2
2
5 5 1 5 n 1 5 5 1 5 n 1
y ( n)
u (n 1)
10 2
10 2
n
n
1 1 5 1 5
u (n 1)
5 2 2
2.68
(a)
3 2 1
(b)
X z z
n 0
(c)
1 z 6
1 z 1
3 2 1
(d)
G z 1 z 6
(e)
G z X z z 1 X z 1 z 1 X z 1 z 1
This answer is the same as that from part (d).
(f)
1
1 z 6
G
z
1 z 1
1 z 1
This answer is the same as that from part (b).
X z
1 z 6
1 z 6
1
1 z
2.69
(a)
H z
1
1
1 z 1
3
(b)
Imaginary Part
1
0.5
0
-0.5
-1
-1
(c)
-0.5
0
0.5
Real Part
1
h n u n
3
y n h n x n
h n n n 1 n 2
h n h n 1 h n 2
0
13 1 n 2
9 3
n0
n0
n 1
n2
2.70
(a)
H z
1
1
1 z 1
4
(b)
Imaginary Part
1
0.5
0
-0.5
-1
-1
(c)
-0.5
0
0.5
Real Part
1
h n u n
4
y n h n x n
h n n n 1 n 2
h n h n 1 h n 2
0
13 1 n 2
16 4
n0
n0
n 1
n2
2.71
(a)
IIR
(b)
FIR
(c)
H z H1 z H 2 z
(e)
(f)
1 1 1
z z 2
6
7 3
z
3
1
z 3
6
IIR
y ( n)
11
1
7
y (n 1) y (n 2) y (n 3) 6 x(n 1) 8 x(n 2) x(n 3)
6
6
3
2
2 1 2
2 1
z 1 1
z
1
3 6 3 6
H z
1 1
1 z 1 1 12 z 1
1 z
3
0.5
Imaginary Part
(d)
6 z 1 8 z 2
-0.5
-1
-1
-0.5
0
Real Part
0.5
(g)
H z
(h)
y ( n) h( n) x ( n)
z 1
1 z 1
2 z 1
3 z 1
1
1
1 z 1 1 z 1
2
3
n 1
n 1
1
1
h n 1 2 3 u (n 1)
2
3
h(n) (n) (n 1) (n 2)
h(n) h(n 1) h(n 2)
0
n4
n4
3 7 1 13 1
4 2
9 3
n0
n 1
n2
n3
12
10
y(n)
8
6
4
2
0
10
n
15
20
2.72
(a)
H z 1 z 8
1
H z has 8 zeros equally spaced on a circle of radius 8 and 8 poles at the origin as
shown below.
Imaginary Part
1
0.5
8
0
-0.5
-1
-1
-0.5
0
0.5
Real Part
G z
H z
1
1 z 8
1
8
G z has 8 poles equally spaced on a circle of radius and 8 zeros at the origin as
1
8
Imaginary Part
1
0.5
8
0
-0.5
-1
-1
(c)
n
g n
0
-0.5
0
0.5
Real Part
n a multiple of 8
otherwise
2.73
(a)
(b)
y n a1 y n 1 a2 y n 2 b0 x n b1 x n 1 b2 x n 2
a2
a1
1 1 4 2
2
a1
a22
a
a
. The poles are z 1 1 1 4 22
4
2
a1
ab a
a1b0
a
a
2 2 b0 1 0 2 b0 1 4 22
a1
a1
2
a1 1
2
z
a2
1 4 2
a1
H z b0
a
a
1 1 1 1 4 22 z 1
2
a1
h n b0 n
ii.
ab a
a1b0
a
a
2 2 b0 1 0 2 b0 1 4 22
a1
a1
2
a1 1
2
z
a2
1 4 2
a1
a
a
1 1 1 1 4 22 z 1
2
a1
a1b0
ab a
a
a
2 2 b0 1 0 2 b0 1 4 22
a1
a1
2
a1
2
a
1 4 22
a1
a1 1 1 4 a2
2
a12
n 1
a1b0
ab a
a
a
2 2 b0 1 0 2 b0 1 4 22
2
a1
a1
a1
2
a
1 4 22
a1
a1 1 1 4 a2
2
a12
n 1
For real, repeated poles, we require a12 4a2 . The poles are z
a1 a1
,
2 2
u n 1
u n 1
1
b0 a1 z 1 b0 a12 z 2
4
b0 2b0
H z b0
2
a1 1
1 2 z
a1 1
a1 1
z
z
a1 1
2
2
b0 z
2
2
2
a1 1
a1 1
1
1
z
z
2
2
a
a
a
h n b0 n 2b0 n 1 u n b0 1 n 1 1
2
2
2
iii.
n 1
u n 1
For complex conjugate poles, we require a12 4a2 0 . Let 2 a12 4a2 , then the
a
poles are z 1 j .
2
2
a1b0
a12 b0 a2 b0 1 a1b0
a12 b0 a2 b0 1
j
z
z
2
2
2
2
H z b0
1
a1
a
1 j z
1 1 j z 1
2
2
2
2
n 1
a1b0
a12 b0 a2 b0 a1
j u n 1
h n b0 n
2
2
2
2
n 1
a1b0
a12 b0 a2 b0 a1
j u n 1
2
2
2
2
(c)
i.
a1
1
j
a12 4a2 re j from which we obtain
2
2
r a2
tan 1 1 4
ii.
a2
a12
B z 1 2r cos z 1 r 2 z 2
iii.
r cos
1
times the coefficient of z 1 .
2
The distance from the origin is the square root of the coefficient of z 2 .
iv.
H z b0 b0
jre j 2 1
z
2sin
jre j 2 1
z
2sin
b0
1 re j z 1
1 re j z 1
rn
h n b0 n b0
sin n 1 u n 1
sin
(d)
sin n 1
h n b0 n b0
sin
rn
sin n 1 u n 1
sin
b0 n b0 n 1 r n u n 1
b0 n b0 n 1 2 r n u n 1
b0 n 2b0 r n u n b0 r n 1 r n 1u n 1
Using r
a1
gives the answer from part (c)-iv.
2
a12 a1
.
4
2
2.74
(a) F ( z ) 0.5
0.5 z 1
0.5 z 1
1
z 1
z 1
Y ( z)
X ( z)
1 0.5 z 1
1 0.5 z 1 1 z 1 1 z 1 1 0.5 z 1
y (n) 1 (0.5) n 1 u (n 1)
2
u(n)
y(n)
1
-1
10
(b) F ( z ) 1
Y ( z ) z 1 X ( z )
z 1
1 z 1
y (n) u (n 1)
2
u(n)
y(n)
1
-1
6
n
10
(c) F ( z ) 1.5
1.5 z 1
1.5 z 1
1
z 1
0.5 z 1
Y ( z)
X ( z)
1 0.5 z 1
1 0.5 z 1 1 z 1 1 z 1 1 0.5 z 1
y (n) 1 0.5(0.5) n 1 u (n 1)
2
u(n)
y(n)
1
-1
10
(d) Unlike the case with continuous-time systems, a first-order system can show an oscillatory
transient reponse.
2.75
(a)
1
1
1 z 1
1
2
V z 2
1
1
1 z
1
1 z 1
1 1 z 1
2
2
11
v n u n
22
2
u(n)
y(n)
1.5
1
0.5
0
-0.5
-1
10
(b)
V z
1 1 z 1
1 1 1 z
1
1
1 z 1
v n n
2
u(n)
y(n)
1.5
1
0.5
0
-0.5
-1
6
n
10
(c)
3
3
1 z 1
1
2
V z 2
1
1
1 z
3
1 z 1
1 1 z 1
2
2
v n
3 1
u n
2 2
2
u(n)
y(n)
1.5
1
0.5
0
-0.5
-1
(d)
10
2.76
(a)
1 1
z
4
H z
1
1
1 z 1 z 2
4
8
1
(b)
1
Imaginary Part
0.5
-0.5
-1
-1
(c)
-0.5
0
Real Part
0.5
7
9 7 1 7
9 7 1
6 1
j
j
z
z
z
308
308
308
308
11
Y z 1
1 z 1
1
1
7 1
7 1
1 j
1 j
z
z
8
8
8
8
n 1
7
9 7 1
7
j
j
308
8
8
308
n 1
1
7
9 7
j
y n (n)
j
u n 1
308
8
308
8
11
2.77
The closed loop transfer function is
1 0.25 z 1
Y ( z)
X ( z ) 1 0.75 K z 1 0.25 Kz 2
z z 0.25
z 0.75 K z 0.125K
2
0.75 K
0.75 K
The goal is to find the values of K for which both poles are inside the unit circle. That is, find the
values of K for which | p1 | 1 and | p2 | 1 . The following Matlab script plots the poles for
0 K 3:
%% ex2_77
K = 0:0.001:3;
p1 = 0.5*(K-0.75 + sqrt((0.75-K).^2-K));
p2 = 0.5*(K-0.75 - sqrt((0.75-K).^2-K));
plot(real(p1),imag(p1),'b-',real(p2),imag(p2),'r.-',...
real(p1(1)),imag(p1(1)),'bo',...
real(p1(end)),imag(p1(end)),'bs',...
real(p2(1)),imag(p2(1)),'ro',...
real(p2(end)),imag(p2(end)),'rs','LineWidth',2);
legend('p_1','p_2');
grid on;
%% plot unit circle for reference
hold on; plot(exp(j*2*pi*[0:0.01:1]),'k:'); hold off;
0.5
-0.5
-1
-1
-0.5
0.5
1.5
From this plot, we see that p2 is always inside the unit circle and that p1 is outside the unit circle
when K is too large. Using the data vector p1 produced by the script, we see that p1 is outside the
unit circle for K 2.334 .
Repeating the same script for K 0 produces the following plot
1
p1
0.5
p2
-0.5
-1
-3
-2.5
-2
-1.5
-1
-0.5
0.5
Form this plot, we see that p1 is always inside the unit circle and that p2 is outside the unit
circle when K gets too negative. Using the data vector p2 produced by the script we see that p2
is outside the unit circle for K 0.2
Putting this all together, the system is stable for 0.2 K 2.334
2.78
(a)
H z
(b)
1 1
z
2
1 1 1 2
z z
2
4
1
3
j
4
4
Imaginary Part
1
0.5
0
-0.5
-1
-1
(c)
-0.5
0
0.5
Real Part
2 1
1 j 3 1
1 j 3 1
z
z
z
3
12
12
Y z
1
1
1
3 1
3 1 1 z
1 j
1 j
z
z
4
4
4
4
n 1
n 1
1 j 3 1
1 j 3 1
3
3
2
y n
j
j
u n 1
4
4
3
12
4
12
4
n 1
1 1
2
cos n 1 u n 1
3
3 2
3
tan 3
tan 1
2.79
H z
Y z
X z
Kz 1
1 K 1 z 1
1 K
K 2
z
2
1 K
2K
The position of the poles in the z-plane (as a function of K) is illustrated below.
pole 1
1
imag. part
0.5
K
K -
-0.5
-1
-1.5
-1
-0.5
0
0.5
real part
1.5
pole 2
1
imag. part
0.5
K -
-0.5
-1
-2
-1.5
-1
-0.5
real part
0.5
1 K
1 K
2K
2
1 K
1 K
2
2K
2.80
(a)
2
z 1
H z 3
2
1 z 1
3
(b)
2
Imaginary Part
-1
-2
-2
-1
0
Real Part
(c)
2
e j
H e j 3
2
1 e j
3
(d)
2
2
4 2 j 2 j
e j e j
e e 1
j
3
3
9
3
3
H e
1
2
2
2
2
4
1 e j 1 e j
1 e j e j
3
3
3
3
9
The system is an all pass filter!
2.81
(a)
(b)
(c)
X e j e j
X e
e j e j 4
1 e j
1 1 j n j
x n e 8 e 4
2 2
n
e j
j 8
4
j n j
e
e
e 8 e 4
2 2
X e j
e j
1
2 j
cos cos
e
4 2
8
1
1 cos e j e j 2
4
8
(d)
9
sin
2
X e j
sin
2
(e)
X e j 1 2 l 1 2 l
(f)
X e j
j j
4
e e 8
2 2
5
5
3 2 l 3 2 l
7
7
l
2 l j
2 l
j
3
3
2.82
(a)
3 n
sin
3
8
x n
8 3 n
8
(b)
1
sin n
2
x n
1
n
2
(c)
x n 10 n n 1 2 n 2 3 n 3
2.83
The DTFT of the sequence x n is
X e j
j 2
0.5
Y e j
j
1
2
1
2
1
2
Y e j
Y e j
1
2
0.5
1
2
0.5
j2
j2
0.5
Y e j
1
2
(d)
0.5
1
2
0.5
j2
0.5
j2
(c)
1
2
0.5
(b)
0.5
(a)
j
j 2
0.5
(e)
1
2
Y e j
1
2
j2
1
2
0.5
Y e j
j2
1
2
0.5
(f)
0.5
0.5
2.84
(a)
Y e j
1
2
0.5
0.5
0.5
(b)
Y e j
0.5
(c)
Y e j
1
2
1
2
0.5
0.5
Y e j
(d)
0.5
0.5
Y e j
(e)
1
2
0.5
0.5
Y e j
(f)
0.5
0.5
2.85
From the input/output relation we have
12Y e j 7e jY e j e j 2 Y e j 12 X e j 5e j X e j
from which we obtain
12 5e
X e 12 7e e
Y e j
j 2
H e H e
X e
Y e j
1
3
.
1 j 3 e j
1 e
3
H 2 e j
j
j 2
j
12 7e e
3e
4 e j
1
h2 n 2 u n
4
2
1
1 e j
4
2.86
1
1
1 z 1
3
1
1 z 1
4
X z
1
1 z 1
2
Y z
2
3 1
1 1
z 1
z
z
2
H z
1 3
4
1
1
X z 1 1 1 1
1 z 1 1 z 1
1 z 1 z
3
4
3 4
Y z
21
h n n
33
n 1
31
u n 1
44
n 1
u n 1
H e j
H e j
1
1 e j
2
1 j 1 j
1 e 1 e
3
4
5
cos
4
97 91
1
cos cos 2
72 72
6
2.87
(a)
1
a
H e j
a re j
1 j 1 j
1
e e 2
a
a
a
1 a e j ae j a
1 1 j
e
a r
1 2
cos
2
r
r
1
2
1 r 2r cos
1
1 1
z
a
H z
1 az 1
1
(b)
1
a
H e
a re j
1 1 j
e
a r
1 r 2 2r cos
1 a e j ae j a
1
1 j 1 j
1
1 2
1 e e 2 1 2 cos
a
r
a
r
a
H z
1 a z 1
1
1 z 1
a
(c)
1
a
H e
| a |
a re j
1 j 1 j
1
e e 2
a
a
a
1 a e j ae j a
1 1 j
e
a r
1 r 2 2r cos
1 r 2 2r cos
1 1
z
a
H z a
1 az 1
1
(d)
1
a
H e
H z
a re j
| a |2 a e j ae j 1
1 a e j ae j a
1 1 j
e
a r
1 r 2 2r cos
1 r 2 2r cos
a z 1
1 az 1
Both the systems of parts (c) and (d) are all-pass systems. However, only the system in part (d)
has a z-transform in the standard form.
2.88
(a)
8
which means the frequency response
9
has a large amplitude in the vicinity of . Hence this is a high-pass filter as shown.
The pole-zero plot (below) shows a pole at z
100
2
80
|H(ej |2
Imaginary Part
60
40
-1
20
-2
-2
0
Real Part
0
-0.5
0
0.5
normalized frequency (cycles/sample)
8
8
and a zero at z which means
9
9
the frequency response has a large amplitude in the vicinity of 0 and a small
amplitude at . Hence this is a low-pass filter as shown.
2.5
x 10
2
2
|H(ej |2
1
Imaginary Part
(b)
-1
1.5
1
-1
0.5
-2
-2
-1
0
Real Part
0
-0.5
0
0.5
normalized frequency (cycles/sample)
8
The pole-zero plot (below) shows complex-conjugate poles at z j and a zero at the
9
origin, which means the frequency response has a large amplitude in the vicinity of
25
2
20
1
|H(ej |2
Imaginary Part
(c)
15
10
-1
5
-2
-2
-1
0
Real Part
0
-0.5
0
0.5
normalized frequency (cycles/sample)
2.89
(a)
x(n)
1.5
1
0.5
0
-4
(b)
-2
2
n
X e 6 4 cos 2 cos 2 4 cos 3
X e j 2 e j e j 3
j
20
|X(ej |2
15
10
5
0
-0.5
(c)
-0.4
-0.3
-0.2
-0.1
0
0.1
0.2
frequency (cycles/sample)
x(n)
1.5
1
0.5
0
-4
(d)
-2
2
n
X [0] 2 1 1 4
X [1] 2 e j /2 e j 3 /2 2
X [2] 2 e j 3 j 3 0
X [3] 2 e j 3 /2 e j 9 /2 2
0.3
0.4
0.5
(e)
X e 2 e
X e 2 e
X e
2e
X e0 2 1 1 4
j /2
j
j 3 /2
j /2
j
e j 3 /2 2
3 j 3 0
j 3 / 2
e j 9 / 2 2
x(n)
1.5
1
0.5
0
-10
-5
5
n
(g)
X [0] 2 1 1 4
X [1] 2 e j /4 e j 3 /4 2 j 2
X [2] 2 e j /2 e j 3 /2 2
X [3] 2 e j 3 /4 e j 9 /4 2 j 2
X [4] 2 e j 3 j 3 0
X [5] 2 e j 5 /4 e j15 /4 2 j 2
X [6] 2 e j 3 /2 e j 9 /2 2
X [7] 2 e j 7 /4 e j 21 /4 2 j 2
10
15
(h)
X e 2 e
X e
2e
X e
2e
X e
2e
X e
2e
X e
2e
X e
2e
X e j0 2 1 1 4
j /4
j /4
e j 3 /4 2 j 2
j 2 /4
j /2
e j 3 /2 2
j 3 /4
j 3 /4
j 4 /4
j 5 /4
j 5 /4
e j15 /4 2 j 2
j 6 /4
j 3 /2
e j 9 /2 2
j 7 /4
j 7 /4
e j 21 /4 2 j 2
e j 9 /4 2 j 2
3 j 3 0
The values obtained in part (d) are a subset of those obtained in part (g). This is because
the DFT length of part (g) is divisible by the length of the DFT length of part (d).
2.90
Start with the sequence x1 n
x1 n
2
1
0 1 2 3
4 5
7 8
Draw the length-4 periodic extension of x1 n call it x1,4 n and delay it by 3. This
produces the sequence
x1,4 n 3
2
1
0 1 2 3 4 5
6 7 8
Note that the samples at n 0,1, 2,3 are the same as those of x2 n .
Now the DTFT of x1,4 n 3 is e
X 1,4 [k ] e
3
j k
2
j3
2
4
X 1 [k ]
and
3
k
2
X 1 [k ] X 2 [k ]
Thus, X 2 [k ] e
3
k
2
X 1[k ] X 1 [k ]
2.91
(a)
decimal
numbers
3-bit
binary
equivalent
3-bit binary
equivalent
index of input
000
000
001
100
010
010
011
110
100
001
101
101
110
011
111
111
(b) The 3-binary equivalent of the indexes of the inputs are reversed (bit reversed) versions of the
indexes associated with the natural (temporal) order.
2.92
(a)
X d e j
100
(b)
9 8
10 10
8
10
9
10
2.93
(a)
X d e j
102
(b)
51
51
51
51
42
51
42
51
The negative and positive frequency components of X c f are preserved on the negative
2.94
(a)
X d e j
52
(b)
9
13
4
13
4
13
9
13
2.95
1 0 n 7
Write x n w n cos n where w n
.
4
0 otherwise
Then
W e j
2
4
4
7
1 sin 4 j 2
2
4
4
sin
2
sin 4 7
sin 4 7
4 j 2 4 1
4 j 2 4
1
e
e
2
2
1
1
sin
sin
4
4
2
2
X e j
5
4
|X(ej )|
(a)
3
2
1
0
-0.5 -0.375 -0.25 -0.125 0 0.125 0.25 0.375 0.5
/2 (cycles/sample)
(b)
|X(ej )|
4
3
2
1
0
-0.5 -0.375 -0.25 -0.125 0 0.125 0.25 0.375 0.5
/2 (cycles/sample)
(c)
|X(ej )|
4
3
2
1
0
-0.5 -0.375 -0.25 -0.125 0 0.125 0.25 0.375 0.5
/2 (cycles/sample)
2.96
(a)
4
3.5
|X(ej k)|
3
2.5
2
1.5
1
0.5
0
-0.5 -0.375 -0.25 -0.125 0 0.125 0.25 0.375 0.5
/2 (cycles/sample)
(b)
4
3.5
|Y(ej k)|
3
2.5
2
1.5
1
0.5
0
-0.5 -0.375 -0.25 -0.125 0 0.125 0.25 0.375 0.5
/2 (cycles/sample)
(c)
The DTFT of x n is
sin 4 7
sin 4 7
j
4 2 4 1
4 j 2 4
1
X e j
e
e
2
2
1
1
sin
sin
4
4
2
2
which has zero-crossings at l 1 for l 0 . The length-8 DFT samples X e j at
k
which corresponds to the zero-crossings. On the other hand, the DTFT of y n is
4
sin 4 7
sin 4 7
3 j 2 3 1
3 j 2 3
1
Y e j
e
e
2
2
1
1
sin
sin
3
3
2
2
3l 4
for l 0 . The length-8 DFT samples X e j at
which has zero-crossings at
12
k
which does not correspond to any of the zero-crossings.
2.97
X e j
80, 000
3.3
3.3
2.98
(a)
S d e j
96000
1 12
5
12
1
2
normalized frequency
(cycles/sample)
(b)
S d e j
88200
1
2
200
441
200
441
1
2
normalized frequency
(cycles/sample)
(c)
The DTFT in part (b) is wider than the DTFT in part (a). This is due to the fact that the sample
rate used in part (b) is closer to the minimum sample rate defined in the sampling theorem than
the sample rate used in part (a).
2.99
S d e j
500
400
1
4
3
2
2
10 10 10
2
10
3
10
4
10
1
2
normalized frequency
(cycles/sample)
2.100
(a)
S d e j
280
224
1
2
24
56
14
56
56
4
56
24
56
14
56
1
2
normalized frequency
(cycles/sample)
(b)
S d e j
200
160
1
2
1
4
1
4
1
2
normalized frequency
(cycles/sample)
(c)
There are two key differences between the spectra in parts (a) and (b).The first difference is the
bandwidth: the spectrum in part (a) is the spectrum of an oversampled signal whereas the
spectrum in part (b) is the spectrum of a critically sampled signal (that is, it is sampled at the
minimum sample rate defined by the sampling theorem). The second difference is the fact that
the two spectra are flipped relative to each other. In part (a) the positive frequency component
of the continuous-time signal shows up on the positive frequency axis in the DTFT domain. In
part (b) the negative frequency component of the continuous-time signals shows up on the
positive frequency axis in the DTFT domain.
2.101
(a)
Y f
12
10
Y e j
120
100
1
2
1
10
1
10
normalized frequency
(cycles/sample)
1
2
(b)
Z p f
120
100
20
10
10
1
10
1
2
20
Z e j
120
100
10
normalized frequency
(cycles/sample)
(c)
Zp f
120
100
20
10
10
20
Z e j
120
100
1
2
1
10
1
10
1
2
normalized frequency
(cycles/sample)
The fundamental problem with this approach is that the positive- and negative-frequency
components of the z(t) overlap when sampled. This was not a problem when using the complexvalued version of the signal. This problem illustrates one of the advantages of signal-processing
using complex-valued signals: one does not have to worry about negative- and positivefrequency components aliasing on top of each other. The disadvantage is complexity: a complexvalued signal is a two-dimensional signal. Consequently, addition and multiplication require
more resources.
2.102
The DTFT of the sampled sequence is
S e j
500
400
0.2
0.4
0.6
0.8
Neglecting scaling constants, the sampled sequence may be written as (see Exericse 2.48)
s nT I nT cos 0.6 n Q nT sin 0.6 n .
Hence the system must be modified either by changing the sign on y nT or by changing the
sign on sin 0 n -- that is, use sin 0 n in place of sin 0 n on the lower mixer.
2.103
Hf
(a)
H j
1
10
(b)
H e j
H e j
1
5T
(c)
10
1
/ 2
cycles/sample
5T
10 T
10 T
rads/sample
Xf
Xf
T
1
T
20
Hf
1
20
T
Xf
T
20
1
T
From this diagram, we see that the minimum sampling rate is determined from relation
1
1
20 5 from which we obtain 25 .
T
T
2.104
(a)
H c j e jT
(b)
Hd e
j T T
e
0
(c)
hd (n)
(d)
W
1
2
T
sin n
W
T
W
j n
e d
T
n
W
T
T
sin n
T
hd (n)
T
(e)
W ,
j T
T
W W
otherwise
T 1
T
2
1
sin n
2
hd (n)
1
n
2
3.1
(a)
X 2 e j
4
5
2
5
2
5
4
5
(b)
X 4 e j
3.75
2.5
4
5
2
5
2
5
4
5
3.2
(a)
X 2 e j
5
3
4
3
5
5
3
5
4
5
(b)
X 4 e j
2.5
1.5
4
5
2
5
4
5
3.3
(a)
X 2 e j
5
3
4
3
5
5
(b)
3
5
4
5
X 4 e j
2.5
1.5
4
5
2
5
4
5
3.4
(a)
X 2 e j
5
3
4
3
5
5
3
5
4
5
3
5
4
5
(b)
X 2 e j
5
3
4
3
5
5
(c)
4
5
3.5
(a)
X 4 e j
2.5
1.5
4
5
2
5
2
5
4
5
(b)
X 4 e j
2.5
1.5
(c)
4
5
2
5
2
5
2
5
4
5
3.6
(a)
X 2 e j
5
3
3
5
4
5
(b)
X 4 e j
2.5
1.5
4
5
2
5
3.7
(a)
X 2 e j
5
3
4
3
5
5
(b)
X 4 e j
2.5
1.5
2
5
4
5
3.8
(a)
X 2 e j
5
3
3
5
(b)
4
5
X 2 e j
5
3
4
3
5
5
(c)
4
whereas the signal in part (b) is centered at
5
4
. The two are almost frequency-domain reversed versions of each other.
5
3.9
(a)
X 4 e j
2.5
1.5
4
5
2
5
(b)
X 4 e j
2.5
1.5
(c)
2
5
4
5
2
whereas the signal in part (b) is centered at
5
2
. The two are almost frequency-domain reversed versions of each other.
5
3.10
(a)
H e j
10
X e
2
5
2
5
X 2 e j
5
4
5
4
5
(b)
H e j
10
X e j
10
3
2
5
2
5
X 3 e j
10
3
10
9
3
5
(c)
H e j
10
7.5
X e j
2
5
X 4 e j
2.5
1.875
4
5
4
5
(d)
H e j
10
X e j
2
5
2
5
X 5 e j
2
3.11
(a)
X 2 e j
8
4
5
(b)
X 4 e j
4
2
5
3.12
(a)
X 2 e j
5
3
4
5
(b)
X 4 e j
2.5
1.5
2
5
3.13
(a)
X 2 e j
8
4
5
(b)
X 2 e j
5
3
(c)
4
5
The spectrum in part (a) exhibits aliasing due to overlap by the positive and negative
frequency components of the signal. The spectrum in part (b) does not show this aliasing
because it does not have a negative-frequency component.
3.14
(a)
X 4 e j
4
2
5
(b)
X 4 e j
2.5
1.5
(c)
2
5
The spectrum in part (a) exhibits aliasing due to overlap by the positive and negative
frequency components of the signal. The spectrum in part (b) does not show this aliasing
because it does not have a negative-frequency component.
3.15
(a)
X 4 e j
2.5
1.5
(b)
2
5
10
10
X 4 e j
2.5
1.5
(c)
2
5
The answers to (a) and (b) are identical. This means these two systems perform equivalent
operations. In general, resampling a bandpass signal produces frequency translations for
free.
3.16
The system illustrated in the block diagram translates the spectrum of x(n) directly to baseband
prior to downsampling. The DTFT of y m is
Y e j
10
N
6
N
10
N
10
X 5 e j
2
6
5
X 10 e j
3
5
3.17
(a)
y n
s n
H e j
z m
n
2
The DTFT of x n is
X e j
8
10
10
H e j
10
10
In this ideal case Y e j X e j so that the lowest possible sample rate for z m
corresponds to the maximum downsample factor N. The maximum downsample factor is
N 10 . The DTFT of the output of the downsample block is
Y10 e j Z e j
1
3
5
(b)
y1 m
x2 m
y2 m
H1 e j
H 2 e j
z k
e j1m
X 1 e j
5
3
4
5
From this, it is seen the first filter H1 e j must be an ideal high-pass filter:
H 1 e j
4
5
Now, the spectrum should be translated to baseband. This requires 1 . (Note that
e j1n e j n 1, 1,1, 1, ). The resulting spectrum is
X 2 e j
5
3
3
5
(c)
y1 m
x2 m
y2 m
H1 e j
H 2 e j
e j1m
z k
X 1 e j
2.5
1.5
2
5
From this, it is seen the first filter H1 e j must be an ideal low-pass filter:
H 1 e j
2
5
Note that no frequency translation is needed here. Hence the multiplier involving the
complex exponential is not needed. Consequently the second filter H 2 e j , is not
needed and may be removed from the block diagram. The lowest possible sample rate for
z m corresponds to the maximum downsample factor N. The maximum downsample
factor at this point is N 2.5 . (Fractional downsample factors are covered in Chapter 9. It
is performed using a polyphase partition of H1 ( z ) .) The DTFT of the output of the
downsample block is
Z e j
1
3
5
3.18
(a)
X 2 e j
4
5
(b)
X 4 e j
9
10
6
5
4
10
10
10
10
10
4
10
5
10
6
10
9
10
3.19
(a)
X 2 e j
4
5
(b)
X 4 e j
9
10
10
10
10
10
4
10
6
10
9
10
3.20
(a)
X 2 e j
10
10
3
10
7
10
(b)
X 4 e j
17
20
13
20
20
20
3
20
7
20
13
20
17
20
3.21
(a)
X 2 e j
4
5
(b)
X 2 e j
(c)
10
10
3
10
7
10
Both have two spectral copies in the first Nyquist zone. The copies are located at slightly
different frequencies, as expected. But the copies closest to baseband are frequencyreversed versions.
3.22
(a)
X 4 e j
9
10
6
10
4
10
10
10
4
10
6
10
9
10
(b)
X 4 e j
(c)
17
20
13
20
20
20
3
20
7
20
13
20
17
20
Both have four spectral copies in the first Nyquist zone. The copies are located at slightly
different frequencies, as expected. But the copies closest to baseband are identical (other
than the center frequency).
3.23
(a)
X 2 e j
4
5
(b)
X 4 e j
9
10
10
10
10
10
4
10
6
10
9
10
3.24
(a)
X 2 e j
10
10
3
10
7
10
(b)
X 4 e j
17
20
13
20
20
20
3
20
7
20
13
20
17
20
3.25
(a)
X 2 e j
4
5
(b)
X 2 e j
(c)
10
10
3
10
7
10
The two are identical except for the center frequencies of the spectral copies.
3.26
(a)
X 4 e j
9
10
6
10
4
10
10
10
4
10
6
10
9
10
(b)
X 4 e j
(c)
17
20
13
20
20
20
3
20
7
20
13
20
The two are identical except for the center frequencies of the spectral copies.
17
20
3.27
(a)
X 10 e j
4
5
3
5
2
5
25
25
2
5
3
5
4
5
The goal of the low-pass filter is to remove all the spectral copies except the one at
baseband. The generic filter requirements are
H e j
10
10
But, because we know more about the spectral properties of the signal, we can generate
more specific filter requirements:
This filter is defined by the following intervals on
the frequency axis (these intervals are usually
called frequency bands):
H e j
passband: 0,
25
4
transition band: ,
25 25
4
stop band: ,
25
25
25
25
4
25
4
5
3
5
2
5
25
25
2
5
3
5
4
5
Y e j
(b)
4
5
3
5
2
5
25
25
2
5
3
5
4
5
A system such as the one illustrated can produce the desired signal. This fact follows from
the observation that after upsampling, X 10 e j has a spectral copy centered at the
3
. There simply is no need to eliminate the spectral copy at 0 ,
5
keep the copy at 0 , then consume resources to translate the copy at 0 up to the
spot on the frequency axis where there originally was a spectral copy.
desired frequency 0
G e j
5
10
3
5
7
10
G e j
11
25
3
5
14
25
19
25
16
25
Note that after filtering X 10 e j (shown above) with G e j , the desired spectrum
results.
3.28
H e j
Y e j
3.29
H e j
Y e j
2
3
3.30
(a)
20000 5
X e j
5
6
(b)
5
6
44100 147
X e j
X e j
5
6 147
2
147
7
6 147
5
2
6 147
160
241
35280
.
147 6 147 6 147 6 147
The transition band required by the downsample operation is
241
5
41
The filter length estimates based on the Kaiser and Harris formulae are
Kaiser Estimate: 6407
Harris Estimate: 7510
clock rate = 7056 kHz
(c)
160 222225
and perform the resampling operation in two steps. There are a number of options here.
The thing to keep in mind is that the first resampling ratio must be greater than 5/6.
(Otherwise the resampling filter will distort the signal.)
Proceeding as outlined in part (b), except doing it twice, the following are some
representative examples:
U1 = 21 D1 = 20
Kaiser Estimate: 469
Harris Estimate: 550
clock rate = 1008 kHz
U2 = 7 D2 = 8
Kaiser Estimate: 320
Harris Estimate: 375
clock rate = 352.8 kHz
U1 = 7 D1 = 4
Kaiser Estimate: 156
Harris Estimate: 183
clock rate = 336 kHz
U2 = 21 D2 = 40
Kaiser Estimate: 1602
Harris Estimate: 1877
clock rate = 1764 kHz
U1 = 7 D1 = 8
Kaiser Estimate: 625
Harris Estimate: 733
clock rate = 336 kHz
U2 = 21 D2 = 20
Kaiser Estimate: 1642
Harris Estimate: 1924
clock rate = 882 kHz
U1 = 3 D1 = 2
Kaiser Estimate: 67
Harris Estimate: 79
clock rate = 144 kHz
U2 = 49 D2 = 80
Kaiser Estimate: 3204
Harris Estimate: 3755
clock rate = 3528 kHz
U1 = 49 D1 = 40
Kaiser Estimate: 1095
Harris Estimate: 1283
clock rate = 2352 kHz
U2 = 3 D2 = 4
Kaiser Estimate: 160
Harris Estimate: 188
clock rate = 176.4 kHz
(d)
The starting point here is to factor the downsample rate: 160 222225 In this part, the
downsample operation can be performed in three steps where D1 D2 D3 160 . As an
example, suppose D1 40, D2 2, and D3 2 . The first filter has a transition band as
determined below. Note that as a result of the downsample-by-40 operation, the signal
100
now has a bandwidth of
as shown.
441
X e j
X e j
transition band
40
5
2
6 147 7 147
6 147
100
441
The transition band for the second filter, and the corresponding spectrum after
downsampling by D2 2 is shown below.
X e j
X e j
transition band
100
441
341
441
200
441
The transition band for the third filter, and the corresponding spectrum after
downsampling by D3 2 is shown below.
X e j
X e j
transition band
200
441
241
441
400
441
The lengths of the three filters and their clock rates is summarized as follows:
U = 147 D1 = 40 D2 = 2 D3 = 2
Kaiser Estimate for filter 1: 3284
Harris Estimate for filter 1: 3849
clock rate for filter 1 = 7056 kHz
Kaiser Estimate for filter 2: 14
Harris Estimate for filter 2: 16
clock rate for filter 2 = 176.4 kHz
Kaiser Estimate for filter 3: 80
Harris Estimate for filter 3: 94
clock rate for filter 3 = 88.2 kHz
Some other options are summarized as follows:
(f)
U = 147 D1 = 2 D2 = 2 D3 = 40
Kaiser Estimate for filter 1: 3284
Harris Estimate for filter 1: 3849
clock rate for filter 1 = 7056 kHz
Kaiser Estimate for filter 2: 8
Harris Estimate for filter 2: 9
clock rate for filter 2 = 3528 kHz
Kaiser Estimate for filter 3: 1602
Harris Estimate for filter 3: 1877
clock rate for filter 3 = 1764 kHz
U = 147 D1 = 20 D2 = 4 D3 = 2
Kaiser Estimate for filter 1: 3284
Harris Estimate for filter 1: 3849
clock rate for filter 1 = 7056 kHz
Kaiser Estimate for filter 2: 27
Harris Estimate for filter 2: 32
clock rate for filter 2 = 352.8 kHz
Kaiser Estimate for filter 3: 80
Harris Estimate for filter 3: 94
clock rate for filter 3 = 88.2 kHz
U = 147 D1 = 20 D2 = 2 D3 = 4
Kaiser Estimate for filter 1: 3284
Harris Estimate for filter 1: 3849
clock rate for filter 1 = 7056 kHz
Kaiser Estimate for filter 2: 10
Harris Estimate for filter 2: 11
clock rate for filter 2 = 352.8 kHz
Kaiser Estimate for filter 3: 160
Harris Estimate for filter 3: 188
clock rate for filter 3 = 176.4 kHz
U = 147 D1 = 10 D2 = 4 D3 = 4
Kaiser Estimate for filter 1: 3284
Harris Estimate for filter 1: 3849
clock rate for filter 1 = 7056 kHz
Kaiser Estimate for filter 2: 19
Harris Estimate for filter 2: 23
clock rate for filter 2 = 705.6 kHz
Kaiser Estimate for filter 3: 160
Harris Estimate for filter 3: 188
clock rate for filter 3 = 176.4 kHz
A polyphase partition of the filter designed in part (b) may be used. The polyphase
filterbank consists of 147 subfilters. (Note: using the estimates from the first problem,
each subfilter requires approximately 100 coefficients.) The filterbank presents an
upsampled and filtered version of the input signal in parallel as shown in the block
diagram below. The output commutator strides through the available output samples by
160 (the downsample rate). As only one filter in the filter bank has be active to produce
each output sample, this approach is an efficient method for resamping the signal.
H0(z)
H1(z)
stride = 160
H146(z)
3.31
(a)
(b)
hd n Thc nT
s1Tn
AT
A2Te s2Tn AN Te sN Tn u n
1 e
AT
e s1T
1
(c)
(d)
Hd z
AT
1
1 e
s1T
A2T e s2T
AN T e sN T
A2T
1 e
s2T
u n
AN T
1 e s N T z 1
The poles are e s1T , e s2T , , e s N T Thus a pole at s p maps to a pole at z e pT in the
discrete-time system generated using the impulse invariance technique.
3.32
(a)
H c j e jT
xc t
xc t T
(b)
(c)
hd (n)
1
2
T
T
e jn d
T
sin n
W
T
W
n
W
T
(d)
T
sin n
hd (n)
T
(e)
T 1
T
2
1
sin n
2
hd (n)
1
n 2
1
2
j TT
e
0
| | W
W | |
T
j n TT W
j n
W
e T
e
T
jn
3.33
(a)
(b)
(c)
hc (t ) ae at u (t )
hd (n) Thc (nT )
aT
1 e aT e j
3.34
(a)
1
a 1 1
1
Sc ( s ) H c s
s sa s s sa
at
sc (t ) 1 e u (t )
(b)
(c)
u(n)
1 1e
S d e j H d e j
e jn e aT
n 0
n 0
e jn
e jn n e jn
n 0
Hd e
(d)
n 0
1
1
j
1 e
1 e j
1 e j
1 e 1 e
j
1 e j
1 e j
3.35
(a)
(b)
(c)
1 z 1
a
aT
1
Hd z
where
1
1
2 1 z
2
z 1
a 1
1
1
T 1 z
n
n 1
1
1
hd (n)
u (n)
u (n 1)
1 1
1 1
1
2 1 n
2
1 1
n0
n0
n0
3.36
1
hd (n)
2
WcT
WcT
j
j e jn d
T
2 T
WcT
e jn d
WcT
WcT
The integral
WcT
WcT
j n
WcT
d e jn
jn
WcT
WcT
WcT
WcT
1 jn
1
j n
e d e jn
e
2
jn
jn
W T
jn
c
W jWcTn jWcTn
1
e
e
2 e jWcTn e jWcTn
jn
n
2W
cos WcTn
hd (n)
WcT
jn
j2
sin WcTn
n2
j
times the integral. Putting this together gives
2 T
T
n
T
n2
3.37
The length-3 differentiator is
1
T
hd (0) 0
hd (1)
hd (1)
1
T
0.5
T
hd ,FIR (0) 0
hd ,FIR (1)
hd ,FIR (1)
0.5
T
The DTFT is
H d ,FIR e j
0.5 j 0.5 j j
e
e sin
T
T
T
.
T
3.38
j 2 sin
2
The series expansions for the exponential and the sine are
e
1 1
1 j j j
2 2! 2 3! 2
3
1 1
sin
2 2 3! 2 5! 2
For small , e
1
1
so that H I T
1 and sin
2 2
j2
j
2
T
3.39
cos
T
2 .
j2
sin
2
The series expansions for the cosine and the sine are
2
1
1
cos 1
2! 2 4! 4
2
3
1 1
sin
2 2 3! 2 5! 2
T 1
1
For small , cos 1 and sin
so that H I
j2 j
2
2 2
2
T
3.40
(a)
Use the identity cos( A B) cos( A) cos( B) sin( A) sin( B) with A c n and B nT .
(b)
S e j
2W
c W
c W
c W
c W
1 1
cos 2 c n
2 2
1
sin 2 c n
2
1
1
1
cos nT cos nT cos 2 c n sin nT sin 2 c n
2
2
2
H e j
W
W
then the double-frequency terms are eliminated and x nT cos nT .
1
sin 2 c n
2
1 1
cos 2 c n
2 2
1
1
1
cos nT sin 2c n sin nT sin nT cos 2 c n
2
2
Using the same low-pass filter described above, the double frequency terms are eliminated
so that y nT sin nT .
(c)
(d)
y nT
y nT sin nT
nT
d y nT
dt x nT
y 2 nT
1 2
x nT
x nT y ' nT x ' nT y nT
x 2 nT
x nT y ' nT x ' nT y nT
2
y nT
x 2 nT y 2 nT
1 2
x nT
(e)
x nT
D z
x ' nT
zL
x ' nT y nT
y nT
scale to a
point on the
unit circle
' nT
D z
y ' nT
x nT y ' nT
Note: the length of the derivative filter is assumed to be 2L+1. The delay by L samples is
required to align the input samples with the outputs of the derivative filters.
(f)
0.2
0.004 . Figure 3.3.18 shows that a length-3 (L = 1)
50
derivative filter is more than adequate.
The bandwidth of x nT is
4.1
(a) Q A
(b) Q A
(c) 1 Q A
(d) 1 2Q A
4.2
1
1
1
t 2
x e dt x e dt
t2
t 2
dt
substitute u x
u
e du
2
0
x
e
0
t 2
dt
e
0
t 2
dt
4.3
x
2
1
1
et dt
u2
du
substitute u x
thus
1
1
e dt
t 2
1
x e dt
t 2
e
x
u2
1
du
2
x e dt
t 2
e
x
t 2
dt
4.4
1 t 2 /2
1 u2
1
2 u 2
1
x
Q x
e dt
e du
e du erfc
2 x/ 2
2
2
2
x
x/ 2
substitute u t / 2
4.5
(a) 1 2Q 1 1 2 0.1587 0.6827
(b) 1 2Q 2 1 2 0.0228 0.9545
(c) 1 2Q 3 1 2 0.0013 0.9973
(d) 1 2Q 4 1 2 3.1533 105 0.9999
4.6
(a) 1 2Q 1 1 2 0.1587 0.6827
(b) 1 2Q 2 1 2 0.0228 0.9545
(c) 1 2Q 3 1 2 0.0013 0.9973
(d) 1 2Q 4 1 2 3.1533 105 0.9999
4.7
6
1 2Q 1 2Q 2 1 2 0.0228 0.9545
3
4.8 Let be a random variable with pdf f X ( x) and let Z u ( X ) X 2 . The pdf of Z may be
1
1
fX z
fX z .
expressed in terms of f X ( x) using the relationship f Z ( z )
2 z
2 z
f Z1 ( z )
2 z
2 2
2 2
2 z
2 2
z
2 2
1
2 2
z 1/2 e
z
2 2
f Z2 ( z )
1/2
z
2 2
z e
2 2
Because X and Y are independent, Z1 and Z2 are independent. Hence the pdf of Z Z1 Z 2 is
f Z ( z ) f Z1 ( z ) f Z2 ( z )
f Z1 ( z x) f Z2 ( x)dx
z
2 2
2
1
e 2
zx
z
2
e 2
2 2
zx
dx
( z x) x
z
2
2
2 2
z
1 2 2
e
2 2
z0
1
2 2
1 2 2
e
dx
x
4.9 Let be a random variable with pdf f X ( x) and let Z u ( X ) X 2 . The pdf of Z may be
1
1
fX z
fX z .
expressed in terms of f X ( x) using the relationship f Z ( z )
2 z
2 z
2 z
2 2 2 z
e
e
z X
2 2
z X2
2 2
2 z
X z
2
z
X2
z X
2 2
2 z
2 2
2 2 2 z
e
e
z Y
2 2
2 2
z Y2
2 z
2 2
z Y
2 2
z
Y 2 z
Y2
e e
Because X and Y are independent, Z1 and Z2 are independent. Hence the pdf of Z Z1 Z 2 is
f Z ( z ) f Z1 ( z ) f Z2 ( z )
f Z1 ( z x) f Z 2 ( x)dx
1
z X2 Y2
2 2
8
e
z X2
2
Y2
2
8 2
e
z x X2
e 2
e
2 2 2 z x
z X2 Y2
2 2
8 2
X z x
2
1
x( z x)
X
e
zx
X 2
z x Y
x Y2
2
x
x
1
Y 2
e 2 Y 2
e dx
e
2
2
x
2
X z x Y x
2
X z x Y x
2
X z x Y x
2
dx
z X2 Y2
z X2 Y2
z X2 Y2
z X2 Y2
cos( )
cos( )
cos( )
cos( )
1
1
1
1
2
2
2
2
e
d e
d e
d e
d
0
0
0
0
z 2 2
X
Y
4I0
2
z X2 Y2
2 2
2 2
z 2 2
X
Y
I0
2
z 0
4.10
Let Y be a random variable with pdf fY ( y ) and let Z u (Y ) Y . The pdf of Z may be
1 2 2
fY ( y )
e
2 2
Substituting produces
z2
z2
2 z 2 2
z 2
fZ ( z)
e
2 e 2
2
2
4.11
Let Y be a random variable with pdf fY ( y ) and let Z u (Y ) Y . The pdf of Z may be
1 2 2
s
fY ( y )
e
I0 y 2
2
2
Substituting produces
2z
fZ ( z)
e
2 2
z 2 s2
2 2
s z
I0 z 2 2 2 e
z 2 s2
2 2
s
I0 z 2
4.12
This transformation is defined by two functions
R u1 ( X , Y ) X 2 Y 2
Y
u2 ( X , Y ) tan 1
X
and their inverses
X 1 v1 ( R, ) R cos
X 2 v2 ( R, ) R sin
The joint pdf f R , (r , ) may be expressed in terms of the joint pdf f X ,Y ( x, y ) using the
relationship
f R , (r , ) J f X ,Y v1 r , , v2 r ,
r
J
v2 r ,
v1 r ,
cos
v2 r , sin
r sin
r cos
Starting with
1
f X ,Y ( x, y )
e
2 2
r
f R , ( r , )
e
2
2
e
2 2
e
2 2
r cos X 2 r sin Y 2
2 2
r 2 cos2 2 r X cos X2 r 2 sin 2 2 r Y sin Y2
2 2
r 2 X2 Y2 2 r X cos 2 r Y sin
2 2
x X 2 y Y 2
2 2
4.13
Because the covariance matrix M is diagonal, X1 and X2 are uncorrelated and therefore
independent random variables. To see that this is so, observe that the joint pdf can be factored:
x
fX 1
x2
1
2
5 0
1/2
5 0 x 1
1
x1 1 x2 20 5 x 1 2
2
0 5
1
e
2 5
1
x1 1 x2 2 5
2
0
0
x 1
1
1 x2 2
5
1 ( x1 1)2 ( x2 2)2
5
5
1 2
e
2 5
( x 1)2
( x 2)2
1
2
1
1
e 25
e 25
2 5
2 5
Thus we see that X1 ~ N(1,5) and X2 ~ N(2,5).
3 1 3 2
(a) P X 1 3 and X 2 3 P X 1 3 P X 2 3 Q
Q
0.0607
5 5
11
2 2 1
(b) P X 1 1 and X 2 2 P X 1 1 P X 2 2 Q
1 Q
5
5 4
4.14
P( X 1 X 2 ) P( X 1 X 2 0) Let Z X 1 X 2 . Then the desired probability is P ( Z 0) .
Z is a Gaussian random variable because it was obtained through a linear operation on the
T
Gaussian random vector X X 1 X 2 . The pdf of X is (4.44) with
2
10 0
and M
5
0 10
The random variable Z is related X through Z = AX where A 1 1 . The mean and variance
of Z are
Z A 3
10 0 1
Z2 AMAT 1 1
20
0 10 1
Thus,
03
P( Z 0) Q
0.2512
20
4.15
P( X 1 X 2 ) P( X 1 X 2 0) Let Z X 1 X 2 . Then the desired probability is P ( Z 0) .
Z is a Gaussian random variable because it was obtained through a linear operation on the
T
Gaussian random vector X X 1 X 2 . The pdf of X is (4.44) with
2
10 2
and M
5
2 10
The random variable Z is related X through Z = AX where A 1 1 . The mean and variance
of Z are
Z A 3
10 2 1
Z2 AMAT 1 1
16
2 10 1
Thus,
03
P( Z 0) Q
0.2266
4
4.16
(a)
0.25
f X 5
2
1
1
3/2
0.5 0.1
0.5
1/2
0.0403
0.5
0.1 0.5
(b)
Let Z X 1 X 2 X 3 . Then the desired probability is P ( Z 5) . Z is a Gaussian random
variable because it was obtained through a linear operation on the Gaussian random vector
T
X X 1 X 2 X 3 . The pdf of X is (4.44) with
0
1 0.5 0.1
Z A 6
1 0.5 0.1 1
4.17
Because the covariance matrix M is diagonal, X1, X2, and X3 are uncorrelated and therefore
independent random variables. To see that this is so, observe that the joint pdf can be factored:
x1
f X x2
x
3
3/2
1 0 0
0 1 0
1/2
1 0 0 x1 1
1
x1 1 x2 1 x3 1 0 1 0 x2 1
2
0 0 1 x3 1
0 0 1
e
2
1
( x1 1)2
2
( x2 1)2
2
( x3 1)2
2
e
e
e
2
2
2
Thus we see that X1 ~ N(1,1), X2~N(1,1), and X3 ~ N(1,1).
(a)
0.25
f X 5
2
1
2
(0.25 1)2
2
1
2
(5 1)2
2
1
2
(2 1)2
2
9.7517 10 6
(b)
P( X 1 2 and X 2 2 and X 3 2) P( X 1 2) P( X 2 2) P( X 3 2)
2 1 2 1 2 1
Q
Q
Q
1 1 1
0.004
4.18
(a) The vector Y consists of 2 jointly Gaussian random variables because Y was obtained from X
via a linear operation. Consequently, the pdf of Y is
f Y (y )
1
T
y Y M Y1 y Y
1
2
e
2 | M y |1/2
and all that remains is to compute the mean vector and the covariance matrix:
2
1
5 1 2 4 3 24
Y E Y E AX AE X
1
2 4 6 1 2 18
2
1
M Y E YYT E AX RA
1
0.3
5 1 2 4 3
0.4
2 4 6 1 2
0.2
0.1
AE XX A
0.3
1
0.3
0.4
0.2
0.4
0.3
1
0.3
0.4
0.2
0.4
0.3
1
0.3
AMAT
0.1 5
0.2 1
0.4 2
0.3 4
1 3
2
4
99.4 94.1
6
94.1 112.2
1
2
24 0.0488 0.0410 24
y
0.0410 0.0433 18
y
1
18
2
f Y (y )
e
2 47.9361
0.5
The value of the pdf at the point Y is
0.5
T
0.5
1
2 0.5 18
fY
e
0.5 2 47.9361
1.2678 104
1
2 Z2
z Z 2
2 Z2
24
Z E Z E BY BE{Y} B Y 1 1 6
18
Z2 E ZZ T E BY BY
BE{YY }B
T
99.4 94.1 1
1 1
94.1 112.2 1
23.4
0 Z
P( Z 0) Q
Z
6
Q
0.8926
23.4
BM Y BT
4.19
xT x
2
1
The pdf of the vector X is f X (x)
e 2
2
2
The vector Y consists of 2 jointly-Gaussian random variables because Y is obtained from X via a
linear operation. Consequently, the pdf of Y is
f Y (y )
1
T
y Y M Y1 y Y
1
2
e
2 | M y |1/2
and all that remains is to compute the mean vector and covariance matrix:
0 0
Y E Y E RX RE X R
0 0
M Y E YYT E RX RX
RE XX R
T
R 2 IRT 2 RRT
cos 2 ( ) sin 2 ( )
cos( ) sin( ) cos( )sin( )
2
cos 2 ( ) sin 2 ( )
cos( ) sin( ) cos( ) sin( )
2
I
Because the pdf of Y is the form of two uncorrelated Gaussian random variables with zero mean
and common variance 2 .
4.20
The pdf of the vector X is f X (x)
xT x
2 2 N
e
N
The vector Y consists of N jointly-Gaussian random variables because Y is obtained from X via
a linear operation. Consequently, the pdf of Y is
f Y (y )
N /2
N /2
| M y |1/2
1
y Y T M Y1 y Y
2
and all that remains is to compute the mean vector and covariance matrix:
0 0
0 0
Y E Y E UX UE X U
0 0
M Y E YYT E UX UX
UE XX U
T
U 2IUT 2 UUT 2I
Because the pdf of Y is the form of N uncorrelated Gaussian random variables with zero mean
and common variance 2 .
4.21
C XX (n, k ) E X (n) (n) X (k ) (k )
E X (n) X (k ) (k ) X (n) (n) X (k ) (n) (k )
E X (n) X (k ) (k ) E X (n) (n) E X (k ) (n) (k )
RXX (n, k ) (k ) (n) (n) (k ) (n) (k )
RXX (n, k ) (n) (k )
4.22
From the covariance matrix, we obtain the following:
RXX (0) 1
RXX (1) RXX (1) 0.35
RXX (2) RXX (2) 0.13
RXX (3) RXX (3) 0.04
S X e j
XX
( k ) e j k
4.23
The autocorrelation function is obtained by computing the inverse DTFT of S X e j :
1
1
1
1
1
1
RXX (k ) (k 3) (k 2) (k 1) (k ) (k 1) (k 2) (k 3)
8
4
2
2
4
8
1
1
2
1
8
RXX (k )
1
2
1
4
-4 -3 -2
1
4
-1
1
8
3 4
(a) The vector X consists of four jointly Gaussian random variables. The form of the pdf is given
by (4.44). Consequently, all the remains to be found are the mean vector and the covariance
matrix M.
X 1 0
X 0
E X E 2
X 3 0
X 4 0
X 1
X 1 X 1 X 1 X 2 X1 X 3 X 1 X 4
X 2
X 2 X1 X 2 X 2 X 2 X 3 X 2 X 4
T
M E XX E
X 1 X 2 X 3 X 4 E X X X X X X X X
3 2
3 3
3 4
X 3
3 1
X 4
X 4 X 1 X 4 X 2 X 4 X 3 X 4 X 4
1 1 1
1 2 4 8
1
R (1) R (0) R (1) R (2)
2
2 4
XX
XX
XX
XX
2
RXX (1)
RXX (0) 4 2
RXX (3) RXX (2)
1 1 1
8 4 2
1/2
4
3
2
3
2
3
4
3
2
0
2
3
4
3
2
.
2
3
4
X1
X
Z 1 1 1 1 2
X3
X4
which we write as Z = AX (where A = [1 1 1 1].) Z is a Gaussian random variable because it is
the result of a linear operation on a sequence of jointly Gaussian random variables. The mean
and variance of Z are
Z E Z AE X 0
Z2 E ZZ T AMAT
1 1 1 1 2
1
4
1
8
33
1
2
1
1
2
1
4
1
4
1
2
1
1
2
1
8
1 1
4 1
1 1
2 1
Hence
1 Z
1
P( Z 1) Q
Q
0.3639
33
/
4
4.24
(a)
M E XXT
X1
X
E 2 X1
X 3
X 4
X 1 X 1
X X
E 2 1
X 3 X1
X 4 X 1
X1 X 2
X2X2
X3 X2
X4X2
X1 X 3
X2 X3
X3X3
X4 X3
X2
X3
X 4
X1 X 4
X 2 X 4
X3 X 4
X 4 X 4
1
RXX (0) RXX (1) RXX (2) RXX (3) 1
R (1) R (0) R (1) R (2)
XX
XX
XX
2
XX
RXX (2) RXX (1)
RXX (0) RXX (1) 1
RXX (1)
RXX (0) 4
RXX (3) RXX (2)
1
1
2
1
1
2
1
4
1
4
1
2
1
1
2
1
8
1
4
1
2
(b)
1
0.5
fX
0.25
1
1
0.5 0.25 0.125
0.5
1
0.5 0.25
0.25 0.5
1
0.5
0.125 0.25 0.5
1
1/2
0.5 0 0.25 1
0.25 0.5
1
2
0.5 0.25
1 1
0.125 0.25 0.5
0.0136
(c) Let Z X 1 X 2 X 3 X 4 . Then the desired probability is P ( Z 1) . The random variable Z
is related to the random vector X through the transformation
X1
X
Z 1 1 1 1 2
X3
X4
which we write as Z = AX (where A = [1 1 1 1].) Z is a Gaussian random variable because it is
the result of a linear operation on a sequence of jointly Gaussian random variables. The mean
and variance of Z are
Z E Z AE X 0
Z2 E ZZ T AMAT
1 1 1 1 2
1
4
1
8
1.75
1
2
1
1
2
1
4
1
4
1
2
1
1
2
1
8
1 1
4 1
1 1
2 1
Hence
1 Z
1
P( Z 1) Q
Q
0.2248
1.75
Z
(d)
SX e
1
e jm
2
m
m
1
1
e jm e jm
2
2
m
m 0
1
1
1
1
1
1 e j
1 e j
2
2
3
4
5
cos
4
4.25
(a)
1
1 1
H e j e j e j
3
3 3
1
1 2 cos
3
2
1
H e j 3 4 cos 2 cos 2
9
SY e j 2 H e j
2
3 4 cos 2 cos 2
9
2
2 2
2
2 2
2
(k 2)
(k 1) (k )
(k 1) (k 2)
9
9
3
9
9
The autocorrelation function is plotted below.
(b) RYY (k )
2
9
-3 -2
2 2
9
-1
3 2
9
2 2
9 2
9
RYY (k )
(c) The averages are correlated one with another and the span of the correlation is determined by
the length of the filter. This makes sense, as the averages computed 1 or 2 samples before the
current sample are based, in part, on the same data.
4.26
(a)
1 W W
H e j
otherwise
0
2
1 W W
H e j
otherwise
0
SY e
W W
otherwise
(b)
RYY (k ) 2
sin Wk
4.27
(a)
H e j (n 1)a n e jn
H e j
n0
SY e j
1 ae
j 2
1 ae 1 ae
j
1
1 a 4a(a 1) cos() 2a 2 cos(2)
4
2
1 a 4 4a(a 2 1) cos() 2a 2 cos(2)
2a 4
a2
1
2
(2 k )
(1 k ) a k
2 3
2 2
2
(1 a )
1 a
(1 a )
For k 0
2a 2
2a 4
1
2k
2k
a k (k 1)
a k
a 2 k k (2 k )
2
2 2
2 3
2
1 a
(1 a )
(1 a ) 1 a
ak
2
2
a
1
2k
2k
a
a
k
(
2
)
(1
)
2 2
1 a2
(1 a )
4.28
(a)
H e j
H e j
SY e j
1
sin N1
2
e j n
n N1
sin
2
1
sin 2 N1
2
2
sin 2
2
N1
1
sin 2 N1
2
2
sin 2
2
2 2 N1 1 | n | 2 N1 | n |
(b) RYY (n) h(n) h(n)
0
2 N1 | n |
4.29
(a)
H e 1
S e
H e j e jn0
j
(b)
RYY (k ) 2 (k )
4.30
hf k T
hf
1
kT
Thus,
hf
hf 1 hf 1 hf
kT 2 kT 6 kT
hf
1
kT
e kT 1
Substituting gives
hf
SV ( f )
e
hf
kT
hf
hf
kT
hf
hf
1
1 1
kT
kT
5.1
E=
T2
[r (t ) r(t )]
T1
K 1
dt = r (t ) xl l (t ) dt
l =0
T1
T2
2
K 1
E = 2 r (t ) xl l (t ) k (t )dt
x k
l =0
T1
T2
K 1
T2
T1
l =0
T1
= 2 r (t ) k (t )dt + 2 xl l (t ) k (t )dt
l k
T2
= 2 r (t ) k (t )dt + 2 x k
T1
E = 0 x k = r (t ) k (t )dt
x k
T1
5.2
E=
T2
[r (t ) r(t )]
T1
K 1
dt = r (t ) xl l (t ) dt
l =0
T1
T2
0=
E = 2 r (t ) xl l (t ) k (t )dt
x k
l =0
T1
e (t )
T2
5.3
The set is orthogonal (but not orthonormal) means
l=k
lk
E
(t ) (t )dt = 0
T2
T1
T2
[r (t ) r(t )]
T1
K 1
dt = r (t ) xl l (t ) dt
l =0
T1
T2
2
K 1
(
)
E = 2 r t xl l (t ) k (t )dt
x k
l =0
T1
T2
K 1
T2
T1
l =0
T1
= 2 r (t ) k (t )dt + 2 xl l (t ) k (t )dt
Ek when l = k
T2
= 2 r (t ) k (t )dt + 2 x k E k
T1
T2
1
E = 0 xk =
x k
Ek
T2
r (t ) (t )dt =
k
T1
r (t ) (t )dt
k
T1
T2
(t )dt
2
k
T1
T2
[r (t ) r(t )]
T1
K 1
dt = r (t ) xl l (t ) dt
l =0
T1
T2
2
K 1
E = 2 r (t ) xl l (t ) k (t )dt
x k
l =0
T1
T2
K 1
T2
T1
l =0
T1
= 2 r (t ) k (t )dt + 2 xl l (t ) k (t )dt
2
K 1
E = 0 r (t ) k (t )dt = xl l (t ) k (t )dt
x k
l =0
T1
T1
T2
k = 0,1, , K 1
This defines a set of K equations in the K unknowns xk (for k = 0,1, , K 1 ). To see this, Let
T2
T2
T1
T1
E = 0 Pk = x k Rl ,k for k = 0,1, , K 1 .
x k
l =0
As is customary with systems of equations, this system of equations may also be expressed in
matrix form as follows:
P0 R0,0
P R
1 = 1,0
PK 1 RK 1, 0
P
R0, K 1 x0
R1, K 1 x1
RK 1, K 1 x K 1
R0,1
R1,1
RK 1,1
R
Note that if the set of basis functions is orthogonal, then R is the diagonal matrix
E0
R=
E1
E K 1
1
E
0
1
E1
1
E K 1
T2
1
Pk
Ek
which is the solution to Exercise 5.3. Furthermore, when the set of basis functions is
orthonormal, Ek = 1 for k = 0,1, , K 1 . As a consequence, R = I, so that R 1 = I . The solution
for xk is
xk =
x k = Pk
which is the solution to Exercise 5.1.
T2
E
(t ) (t )dt = 0
T2
T1
l=k
.
lk
E s = s (t )dt = a k k (t ) a l l (t ) dt
l =0
T1
T1 k = 0
T2
T2
K 1 K 1
T2
k =0 l =0
T1
= a k al k (t )l (t )dt
K 1
= a k2 E k
k =0
The interpretation is that Es is a scaled squared Euclidean distance from the origin of the signal
space. Alternatively, the expression can be interpreted as the squared Euclidean distance in a
Cartesian coordinate system whose axes do not have the same length.
5.6
+A
1
t
+A
5.7
+A
1
t
(0,+ A)
A
+A
1
(+ A,0)
5.8
+2A
+2A
1
t
2A
2A
( A,+ A)
( A, A)
+2A
2A
(+ A,+ A)
(+ A, A)
+2A
t
1
t
2A
5.9
+A
1
t
(0,+ A)
+A
1
t
-A
( A,0)
(+ A,0)
(0, A)
+A
t
A
5.10
3 1
A
2
3 +1
A
2
1
t
3 +1
A
2
3 1
A
2
A 3 A
,+
2
2
A 3 A
+
,+
2
2
(0,0)
+2A
(0, A)
t
2A
1
+A
t
A
4A
2A
4A
4A
2A
2A
2A
4A
( A,+ A)
( 3 A,+ A)
( A,+ A)
( 3 A,+ A)
+4A
+2A
(+ A,+ A) (+ 3 A,+ A)
(+ A,+ A) (+ 3 A,+ A)
+4A
+2A
+2A
+2A
t
+4A
+4A
5.11
5.12
1
x 0 = r (t ) 0 (t )dt =
0
1
2
x1 = r (t )1 (t )dt = 0
0
1
r(t ) = x 0 0 (t ) + x11 (t ) = 0 (t )
2
r (t )
r(t )
+1
+
5.13
1
x 0 = r (t ) 0 (t )dt =
0
1
2
x1 = r (t )1 (t )dt = 0
0
1
r(t ) = x 0 0 (t ) + x11 (t ) = 0 (t )
2
r (t )
+1
r(t )
+
t
5.14
1
x 0 = r (t ) 0 (t )dt =0
0
x1 = r (t )1 (t )dt =
0
1
2
1
r(t ) = x 0 0 (t ) + x11 (t ) = 1 (t )
2
r (t )
+1
+
r(t )
t
1
5.15
1
x 0 = r (t ) 0 (t )dt =0
0
x1 = r (t )1 (t )dt =
0
1
2
1
r(t ) = x0 0 (t ) + x11 (t ) = 1 (t )
2
r (t )
+1
+
r(t )
5.16
(a)
30 (t ) + 1 (t )
+4
+2
t
(b)
1
x 0 = r (t ) 0 (t )dt =3
0
x1 = r (t )1 (t )dt =1
0
r(t ) = x 0 0 (t ) + x11 (t ) = 3 0 (t ) + 1 (t )
r(t )
r (t )
+4
+2
5.17
+A 2
1
t
A 2
+A
5.18
+A 2
(0,+ A)
+A 2
(+ A,0)
5.19
+A 2
A 2
+A 2
( A,+ A)
( A, A)
1
A 2
(+ A,+ A)
(+ A, A)
+A 2
A 2
5.20
+A 2
t
A 2
(0,+ A)
+A 2
A 2
+A 2
( A,0)
(+ A,0)
(0, A)
+A 2
1
t
A 2
A 2
5.21
3
A
2
1
+
A
2
+
1
A
2
3
A
2
A 3 A
+
,+
2
2
A 3 A
,+
2
2
(0,0)
+2A
t
2A
(0, A)
A 2
A3 2
A 2
A3 2
A 2
A 2
A 2
A 2
A 2
( A,+ A)
( 3 A,+ A)
( A,+ A)
( 3 A,+ A)
A 2
A 2
(+ A,+ A) (+ 3 A,+ A)
(+ A,+ A) (+ 3 A,+ A)
A 2
A3 2
A 2
A 2
A3 2
A 2
A3 2
5.22
5.23
(a)
0(t)
-1
0
0.1
0.2
0.3
0.4
0.5
t
0.6
0.7
0.8
0.9
0.1
0.2
0.3
0.4
0.5
t
0.6
0.7
0.8
0.9
1(t)
-1
dimension K = 2
(b)
2
1.5
s1
0.5
0
s2
s0
-0.5
-1
s3
-1.5
-2
-2
-1.5
-1
-0.5
0.5
1.5
5.24
(a)
0(t)
-1
0
0.1
0.2
0.3
0.4
0.5
t
0.6
0.7
0.8
0.9
0.1
0.2
0.3
0.4
0.5
t
0.6
0.7
0.8
0.9
1(t)
-1
dimension: K =2
(b)
2
1.5
s2
0.5
0
s1
s3
-0.5
-1
s0
-1.5
-2
-2
-1.5
-1
-0.5
0.5
1.5
The basis functions here are the same as those for Exercise 5.23, but the constellation is a reordered version of the constellation in Exercise 5.23.
5.25
(a)
1.5
1
0(t)
0.5
0
-0.5
-1
-1.5
0.1
0.2
0.3
0.4
0.5
t
0.6
0.7
0.8
0.9
dimension: K = 1
(b)
8
6
4
2
0
s3
s2
s1
s0
-2
-4
-6
-8
-8
-6
-4
-2
5.26
(a)
0(t)
-1
0
0.1
0.2
0.3
0.4
0.5
t
0.6
0.7
0.8
0.9
0.1
0.2
0.3
0.4
0.5
t
0.6
0.7
0.8
0.9
1(t)
-1
dimension: K = 2
(b)
s2
2
1.5
s3
0.5
s0
s1
-0.5
-1
-1.5
-2
-2
-1.5
-1
-0.5
0.5
1.5
5.27
(a)
0(t)
1
0
-1
0
0.5
1.5
t
2.5
0.5
1.5
t
2.5
0.5
1.5
t
2.5
1(t)
1
0
-1
2(t)
1
0
-1
dimension K = 3
(b)
s3
s2
0
s0
s1
-5
5
5
0
0
-5
-5
5.28
(a)
0(t)
-1
0
0.5
1.5
t
2.5
0.5
1.5
t
2.5
1(t)
-1
dimension: K = 2
(b)
2.5
2
1.5
s1
s2
0.5
s0
0
-0.5
-1
-1.5
-2
-2.5
-2
-1
5.29
The average energy may be expressed as
E avg =
M
1
2
A
M
(2m + 1)
m=
M
2
2A
M
M
1
2 2
(2m + 1)
m =0
i = n
i =0
n
i =
i =0
i =0
n(n + 1)
2
n(n + 1)(2n + 1)
6
(2m + 1)
m =0
M
1
2
M
1
2
M
1
2
m =0
m =0
m =0
= 4 m2 + 4 m +
M
M
M
M
1 (M 2 + 1)
1
2
2
2
2
= 4
+4
6
2
3
M M 1
=
2
3
Putting this all together we have
E avg =
2 A2 M M 3 1 M 3 1 2
A
=
M 2
3
3
+M
2
5.30
(a) A = 0.05.
LUT
0
1
bits
-0.05
+0.05
p(nT)
ADC
(b)
-3
x 10
1.5
1
s(t)
0.5
0
-0.5
-1
-1.5
-2
4
t/Ts
(c)
x(t)
r(t)
DAC
N samples/bit
x(kT)
p(nT)
decision
n = kN
(d)
k
0
1
2
3
----------------------------------x(k) +0.00
-0.01
+0.33
+0.07
----------------------------------a(k) +0.05
-0.05
+0.05
+0.05
----------------------------------bits
1
0
1
1
s(t)
5.31
(a) A = 0.03.
LUT
00
01
10
11
bits
-0.09
-0.03
+0.09
+0.03
p(nT)
ADC
(b)
-3
2.5
x 10
1.5
s(t)
0.5
-0.5
-1
0.5
1.5
2
t/Ts
2.5
3.5
(c)
r(t)
DAC
N samples/symbol
p(nT)
decision
n = kN
(d)
k
0
1
2
3
----------------------------------x(k) +0.07
+0.06
-0.03
-0.10
----------------------------------a(k) +0.09
+0.03
-0.03
-0.09
----------------------------------bits
10
11
01
00
s(t)
5.32
(a) A = 0.125
000
001
010
011
100
101
110
111
bits
LUT
-0.875
-0.625
-0.125
-0.375
+0.875
+0.625
+0.125
+0.375
p(nT)
ADC
(b)
0.02
0.018
0.016
0.014
s(t)
0.012
0.01
0.008
0.006
0.004
0.002
0.5
1.5
t/Ts
2.5
(c)
r(t)
DAC
N samples/symbol
p(nT)
decision
n = kN
(d)
k
0
1
2
3
--------------------------------------x(k) +0.601
-0.101
+0.355
-0.777
--------------------------------------a(k) +0.625
-0.125
+0.375
-0.875
--------------------------------------bits
101
010
111
000
s(t)
5.33
2
1
0
-1
-2
-0.5
-0.4
-0.3
-0.2
-0.1
0
t/Ts
0.1
0.2
0.3
0.4
0.5
-0.4
-0.3
-0.2
-0.1
0
t/Ts
0.1
0.2
0.3
0.4
0.5
-0.4
-0.3
-0.2
-0.1
0
t/Ts
0.1
0.2
0.3
0.4
0.5
2
1
0
-1
-2
-0.5
2
1
0
-1
-2
-0.5
(d) All eye diagrams exhibit no ISI at the optimum sampling instant. The peak overshoot
increases as the excess bandwidth decreases. The width of the eye opening (and hence, the
immunity to timing offset) decreases as the excess bandwidth decreases.
5.34
4
2
0
-2
-4
-0.5
-0.4
-0.3
-0.2
-0.1
0
t/Ts
0.1
0.2
0.3
0.4
0.5
-0.4
-0.3
-0.2
-0.1
0
t/Ts
0.1
0.2
0.3
0.4
0.5
-0.4
-0.3
-0.2
-0.1
0
t/Ts
0.1
0.2
0.3
0.4
0.5
-5
-0.5
-5
-0.5
(d) All eye diagrams exhibit no ISI at the optimum sampling instant. The peak overshoot
increases as the excess bandwidth decreases. The width of the eye opening (and hence, the
immunity to timing offset) decreases as the excess bandwidth decreases.
5.35
magnitude (dB)
part (a)
0
signal
filter
-20
-40
-5
0
frequency (cycles/symbol)
-2
-1
-0.5
0
t/Ts
0.5
magnitude (dB)
part (b)
0
signal
filter
-20
-40
-5
0
frequency (cycles/symbol)
-2
-1
-0.5
0
t/Ts
0.5
magnitude (dB)
part (c)
0
signal
filter
-20
-40
-5
0
frequency (cycles/symbol)
-2
-1
-0.5
0
t/Ts
0.5
(d) As the bandwidth of the channel decreases, signal distortion increases. The signal distortion
manifests itself in the eye diagram as a narrowing of the eye opening and closure of the eye due
to ISI.
5.36
magnitude (dB)
part (a)
0
signal
filter
-20
-40
-5
0
frequency (cycles/symbol)
-1
-1
-0.5
0
t/Ts
0.5
magnitude (dB)
part (b)
0
signal
filter
-20
-40
-5
0
frequency (cycles/symbol)
-2
-1
-0.5
0
t/Ts
0.5
magnitude (dB)
part (c)
0
signal
filter
-20
-40
-5
0
frequency (cycles/symbol)
-2
-1
-0.5
0
t/Ts
0.5
(d) As the order of the filter increases, an increasing amount of energy is removed from the
signal. This increases distortion seen as eye narrowing and eye closure due to ISI.
5.37
(a) 0 =
(b)
2 0
= x =
Now, 1 =
= 1
0
2 0
2
180
rad. So we want
180
180
which implies
1
1
1 1 +
2 90
2 90
Case 1: =
1 +
2
0
1
1
1 + 0 0
1 1 +
0 2 90
2 90 2
90
90
Case 2: =
1
2
0
1
1
1 + 0 0
1 1
0 2 90
2 90 2
90
90
5.38
(a)
0 =
2 0
(b)
The system outputs are
cos(0t )
sin (0t )
but cos( 0 t ) = cos( 0 t + ) and sin ( 0 t ) = sin ( 0 t + ) . So the system output may be
expressed as
cos(0t + )
sin (0t + )
with = . This system does indeed have the desired relationship.
5.39
(a) =
3
2
(b) 0 =
3
2
3
2 0
(c)
The delay is 3 times the delay from Exercise 5.37. Furthermore, the tunable range over
which the phase error does not exceed 1 is less than that for Exercise 5.37.
5.40
(a) A = 2
ILUT
00
01
10
11
I(t)
-1
-1
+1
+1
p(nT)
2 cos( 0 n )
bits
s(t)
ADC
2 sin ( 0 n )
QLUT
00
01
10
11
-1
+1
-1
+1
p(nT)
Q(t)
(b)
I(t)
0.05
0
-0.05
0.5
1.5
2
t/Ts
2.5
3.5
0.5
1.5
2
t/Ts
2.5
3.5
0.5
1.5
2
t/Ts
2.5
3.5
Q(t)
0.05
0
-0.05
s(t)
0.05
0
-0.05
(c)
x(t)
x(kT)
p(nT)
n = kN
2 cos( 0 n )
r(t)
decision
DAC
N samples/symbol
2 sin ( 0 n )
y(t)
y(kT)
p(nT)
n = kN
(d)
1.5
0.5
-0.5
-1
-1.5
-1.5
-1
-0.5
0.5
1.5
k
0
1
2
3
----------------------------------x(k) -1.01
+1.02
+1.11
-0.03
y(k) +1.07
-0.99
+1.00
+0.07
----------------------------------a0(k) -1.00
+1.00
+1.00
-1.00
a1(k) +1.00
-1.00
+1.00
+1.00
----------------------------------bits
01
10
11
01
5.41
(a) A = 0.05 = 0.2236
LUT
00
01
10
11
bits
-0.6708
-0.2236
+0.2708
+0.2236
p(nT)
s(t)
ADC
2 cos( 0 n )
(b)
0.02
I(t)
0.01
0
-0.01
-0.02
0
0.5
1.5
2
t/Ts
2.5
3.5
0.5
1.5
2
t/Ts
2.5
3.5
0.04
s(t)
0.02
0
-0.02
-0.04
(c)
x(t)
r(t)
DAC
N samples/symbol 2 cos( n )
0
x(kT)
p(nT)
decision
n = kN
(d)
1
0.8
0.6
0.4
0.2
0
-0.2
-0.4
-0.6
-0.8
-1
-3
-2
-1
k
0
1
2
3
----------------------------------x(k) -0.03
+0.55
+1.53
-2.10
----------------------------------a(k) -0.22
+0.67
+0.67
-0.67
----------------------------------bits
01
10
10
00
5.42
(a) A = 2
ILUT
00
01
10
11
I(t)
0
-3
+3
0
p(nT)
2 cos( 0 n )
bits
s(t)
ADC
2 sin ( 0 n )
QLUT
00
01
10
11
0
+1
+1
2
p(nT)
Q(t)
(b)
I(t)
0.05
-0.05
0.5
1.5
2
t/Ts
2.5
3.5
0.5
1.5
2
t/Ts
2.5
3.5
0.5
1.5
2
t/Ts
2.5
3.5
Q(t)
0.05
0
-0.05
s(t)
0.1
0
-0.1
(c)
x(t)
x(kT)
p(nT)
n = kN
2 cos( 0 n )
r(t)
decision
DAC
N samples/symbol
2 sin ( 0 n )
y(t)
y(kT)
p(nT)
n = kN
(d)
2.5
2
1.5
1
0.5
0
-0.5
-1
-1.5
-2
-2.5
-2
-1
k
0
1
2
3
----------------------------------x(k) -0.03
-0.01
+0.01
+0.03
y(k) +1.97
+1.97
+1.97
+1.97
----------------------------------a0(k) -1.73
+0.00
+0.00
+1.73
a1(k) +1.00
+0.00
+0.00
+1.00
----------------------------------bits
01
00
00
10
5.43
(a) A = 2
ILUT
000
001
010
011
100
101
110
111
+2
+1
1
0
+1
0
-2
1
I(t)
N
p(nT)
2 cos( 0 n )
bits
s(t)
ADC
QLUT
000
001
010
011
100
101
110
111
2 sin ( 0 n )
0
+1
+1
+2
1
-2
0
1
p(nT)
Q(t)
(b)
I(t)
0.05
-0.05
0.5
1.5
2
t/Ts
2.5
3.5
0.5
1.5
2
t/Ts
2.5
3.5
0.5
1.5
2
t/Ts
2.5
3.5
Q(t)
0.05
0
-0.05
s(t)
0.05
0
-0.05
(c)
x(t)
x(kT)
p(nT)
n = kN
2 cos( 0 n )
r(t)
decision
DAC
N samples/symbol
2 sin ( 0 n )
y(t)
y(kT)
p(nT)
n = kN
(d)
2
1.5
1
0.5
0
-0.5
-1
-1.5
-2
-2
-1
k
0
1
2
3
----------------------------------x(k) -1.30
+1.51
-0.09
+0.65
y(k) +1.64
-1.49
-0.91
+0.07
----------------------------------a0(k) -1.00
+1.00
+0.00
+1.41
a1(k) +1.00
-1.00
-1.41
+0.00
----------------------------------bits
010
100
101
000
5.44
(a) A = 2
ILUT
000
001
010
011
100
101
110
111
+22
0
+2
+22
2
-22
0
-22
I(t)
N
p(nT)
2 cos( 0 n )
bits
s(t)
ADC
QLUT
000
001
010
011
100
101
110
111
2 sin ( 0 n )
+22
+2
0
22
0
+22
2
22
p(nT)
Q(t)
(b)
I(t)
0.1
0
-0.1
0.5
1.5
2
t/Ts
2.5
3.5
0.5
1.5
2
t/Ts
2.5
3.5
0.5
1.5
2
t/Ts
2.5
3.5
Q(t)
0.1
0
-0.1
s(t)
0.2
0
-0.2
(c)
x(t)
x(kT)
p(nT)
n = kN
2 cos( 0 n )
r(t)
decision
DAC
N samples/symbol
2 sin ( 0 n )
y(t)
y(kT)
p(nT)
n = kN
(d)
8
6
4
2
0
-2
-4
-6
-8
-5
k
0
1
2
3
----------------------------------x(k) -2.00
+1.00
+7.20
-1.64
y(k) -2.01
+1.64
+0.00
+1.25
----------------------------------a0(k) -2.83
+0.00
+2.00
-2.00
a1(k) -2.83
+2.00
+0.00
+0.00
----------------------------------bits
111
001
010
100
5.45
(a) A = 2
ILUT
000
001
010
011
100
101
110
111
+2
-1
+1
+2
-1
-2
+1
2
I(t)
N
p(nT)
2 cos( 0 n )
bits
s(t)
ADC
QLUT
000
001
010
011
100
101
110
111
2 sin ( 0 n )
+2
+1
+1
-2
1
+2
-1
2
p(nT)
Q(t)
(b)
I(t)
0.05
0
-0.05
0.5
1.5
2
t/Ts
2.5
3.5
0.5
1.5
2
t/Ts
2.5
3.5
0.5
1.5
2
t/Ts
2.5
3.5
Q(t)
0.05
0
-0.05
s(t)
0.1
0
-0.1
(c)
x(t)
x(kT)
p(nT)
n = kN
2 cos( 0 n )
r(t)
decision
DAC
2 sin ( 0 n )
N samples/symbol
y(t)
y(kT)
p(nT)
n = kN
(d)
3
-1
-2
-3
-3
-2
-1
k
0
1
2
3
----------------------------------x(k) -1.32
+1.51
+0.71
-0.05
y(k) -1.32
-1.51
+1.32
+0.05
----------------------------------a0(k) -1.00
+2.00
+1.00
-1.00
a1(k) -1.00
-2.00
+1.00
+1.00
----------------------------------bits
100
011
010
001
5.46
(a) A = 0.3
ILUT
0000
0001
0010
0011
0100
0101
0110
0111
1000
1001
1010
1011
1100
1101
1110
1111
-0.9
-0.9
-0.9
-0.9
-0.3
-0.3
-0.3
0.3
+0.9
+0.9
+0.9
+0.9
+0.3
+0.3
+0.3
+0.3
I(t)
N
p(nT)
2 cos( 0 n )
bits
ADC
QLUT
0000
0001
0010
0011
0100
0101
0110
0111
1000
1001
1010
1011
1100
1101
1110
1111
+0.9
+0.3
-0.9
-0.3
+0.9
+0.3
-0.9
0.3
+0.9
+0.3
-0.9
-0.3
+0.9
+0.3
-0.9
-0.3
2 sin ( 0 n )
p(nT)
Q(t)
s(t)
(b)
I(t)
0.02
0
-0.02
0
0.5
1.5
2
t/Ts
2.5
3.5
0.5
1.5
2
t/Ts
2.5
3.5
0.5
1.5
2
t/Ts
2.5
3.5
Q(t)
0.02
0
-0.02
s(t)
0.05
0
-0.05
(c)
x(t)
x(kT)
p(nT)
n = kN
2 cos( 0 n )
r(t)
decision
DAC
N samples/symbol
2 sin ( 0 n )
y(t)
y(kT)
p(nT)
n = kN
(d)
1
0.8
0.6
0.4
0.2
0
-0.2
-0.4
-0.6
-0.8
-1
-1
-0.5
0.5
k
0
1
2
3
----------------------------------x(k) -0.03
+0.51
-0.09
+0.65
y(k) +0.64
-0.49
-0.91
+0.07
----------------------------------a0(k) -0.30
+0.30
-0.30
+0.90
a1(k) +0.90
-0.30
-0.90
+0.30
----------------------------------bits
0100
1111
0110
1001
5.47
(a) A = 0.3
ILUT
0000
0001
0010
0011
0100
0101
0110
0111
1000
1001
1010
1011
1100
1101
1110
1111
0
-0.9
0
+0.9
-0.3
+0.3
-1.5
-0.9
+0.9
+1.5
-0.3
+0.3
0
-0.9
+0.9
0
I(t)
N
p(nT)
2 cos( 0 n )
bits
ADC
QLUT
0000
0001
0010
0011
0100
0101
0110
0111
1000
1001
1010
1011
1100
1101
1110
1111
+1.5
+0.9
+0.9
+0.9
+0.3
+0.3
0
0
0
0
-0.3
-0.3
-0.9
-0.9
-0.9
-1.5
2 sin ( 0 n )
N
p(nT)
Q(t)
s(t)
(b)
I(t)
0.05
0
-0.05
0
0.5
1.5
2
t/Ts
2.5
3.5
0.5
1.5
2
t/Ts
2.5
3.5
0.5
1.5
2
t/Ts
2.5
3.5
Q(t)
0.05
0
-0.05
s(t)
0.1
0
-0.1
(c)
x(t)
x(kT)
p(nT)
n = kN
2 cos( 0 n )
r(t)
decision
DAC
N samples/symbol
2 sin ( 0 n )
y(t)
y(kT)
p(nT)
n = kN
(d)
2
1.5
1
0.5
0
-0.5
-1
-1.5
-2
-2
-1
k
0
1
2
3
----------------------------------x(k) +0.90
-1.95
+1.90
+0.05
y(k) +0.54
+0.01
-1.91
-0.94
----------------------------------a0(k) +0.90
-1.50
+0.90
+0.00
a1(k) +0.90
+0.00
-0.90
-0.90
----------------------------------bits
0011
0110
1110
1100
5.48
5.49
5.50
5.51
5.52
5.53
E avg
E avg
5.54
r2
= 2.7236
r1
= 0
maximum d min = 0.1462
-1
-2
-3
-3
-2
-1
5.55
r2
= 2.8242
r1
r3
= 4.2143
r1
1 = 0
2 = 0
maximum d min = 0.073658
5
4
3
2
1
0
-1
-2
-3
-4
-5
-5
5.56
E avg
E avg
) (
) (
) (
) (
4 2 A 2 + 4 9 A 2 + 4 25 A 2 + 4 18 A 2
27 2
=
=
A
16
2
4 2 A2 + 4 9 A2
11
=
= A2
8
2
5.57
r1 = 2 A
1 =
2 = 0
r3 = 3 2 A 3 =
r2 = 3 A
r1 = 5 A
2 = 0
r1 = 2 A 1 =
r2 = 3 A
2 = 0
5.58
5.59
5.60
5.61
(a)
1.5
(1,1)
1
(1,1)
0.5
-0.5
-1
(-1,-1)
-1.5
-1.5
-1
(1,-1)
-0.5
0.5
1.5
(b)
k
0
1
2
3
-------------------------------------------x(kTs)
+1.0
-1.0
+1.0
+1.0
y((k+0.5)Ts) -1.0
-1.0
+1.0
+1.0
-------------------------------------------a0(k)
+1.0
-1.0
+1.0
+1.0
a1(k)
-1.0
-1.0
+1.0
+1.0
-------------------------------------------bits
10
00
11
11
5.62
For each case, the bit rate is Rb =
1
N M k where k is the number of data bits per subcarrier.
TM
(a) QPSK (k = 2)
Rb = 100000
symbols
subcarriers
bits
64
2
= 12.8 Mbits/s
sec
symbol
subcarrier
(b) 16-QAM (k = 4)
Rb = 100000
symbols
subcarriers
bits
64
4
= 25.6 Mbits/s
sec
symbol
subcarrier
Rb = 100000
2
=4
3
symbols
subcarriers
bits
64
4
= 25.6 Mbits/s
sec
symbol
subcarrier
5.63
Rb =
NM
1
NM k
TM
Rb
20 10 6
=
=
= 25
1
200000 4
k
TM
5.64
Assign a point from a constellation with a small number of points (e.g., BPSK, QPSK) to those
subcarriers that are attenuated a lot by the channel. Assign a point from a constellation with a
large number of points (e.g., 16-QAM, 64-QAM) to those subcarriers that are not attenuated a lot
by the channel. The selection criterion would be the maximum allowed bit error rate.
10.1
(a)
I (t ) 2 cos( 0 t ) Q(t ) 2 (1 + )sin ( 0 t + )
~
~
I (t )
Q (t )
0.5
0.4
0.3
0.2
Q(nT)
0.1
0
-0.1
-0.2
-0.3
-0.4
-0.5
-0.5
0
I(nT)
0.5
(c)
0.5
0.4
0.3
0.2
Q(nT)
0.1
0
-0.1
-0.2
-0.3
-0.4
-0.5
-0.5
0
I(nT)
0.5
(d) The phase trajectory is skewed, the same way a circle is skewed to create an ellipse.
(e)
= 0 = 20 deg
0.5
0.5
0.4
0.4
0.3
0.3
0.2
0.2
0.1
0.1
Q(nT)
Q(nT)
= 0.1 = 0 deg
-0.1
-0.1
-0.2
-0.2
-0.3
-0.3
-0.4
-0.4
-0.5
-0.5
-0.5
0
I(nT)
0.5
-0.5
0
I(nT)
0.5
The two plots above illustrate the effects: The amplitude imbalance stretches the axis. The phase
imbalance rotates the Q-axis but not the I-axis creating the pronounced skewing effect observed
in part (c).
10.2
(a)
I (t ) 2 cos( 0 t ) Q(t ) 2 (1 + )sin ( 0 t + )
~
~
I (t )
Q (t )
Q(nT)
0.5
0
-0.5
-1
-1.5
-2
-2
-1
0
I(nT)
(c)
2
1.5
1
Q(nT)
0.5
0
-0.5
-1
-1.5
-2
-2
-1
0
I(nT)
(d) The phase trajectory is skewed, the same way a circle is skewed to create an ellipse.
(e)
= 0 = 20 deg
2
1.5
1.5
0.5
0.5
Q(nT)
Q(nT)
= 0.1 = 0 deg
2
-0.5
-0.5
-1
-1
-1.5
-1.5
-2
-2
-1
0
I(nT)
-2
-2
-1
0
I(nT)
The two plots above illustrate the effects: The amplitude imbalance stretches the axis. The phase
imbalance rotates the Q-axis but not the I-axis creating the pronounced skewing effect observed
in part (c).
10.3
(a)
~
~
I (t )
~
~
= I (t ) 2 cos( 0 t ) Q (t ) 2 sin ( 0 t )
Q (t )
~
~
The outputs of the matched filters are based on I (t ) and Q (t ) . Thus we have
~
~
x (t ) = I (t ) p( t )
= [I (t ) Q(t )(1 + )sin ( )] p( t )
= I (t ) p( t ) (1 + )sin ( )Q(t ) p( t )
= x(t ) (1 + )sin ( ) y (t )
~
~
y (t ) = Q (t ) p( t )
= (1 + ) cos( )Q(t ) p( t )
= (1 + ) cos( ) y (t )
Organizing these expressions into a matrix equation produces the desired result.
(b) Using x(t ) = a0 (m )rp (t mT ) and y (t ) = a1 (m )rp (t mT ) as substitutions in the
m
~
y (t ) = (1 + ) cos( )a1 (m )rp (t mT )
m
~
y (kT ) = (1 + ) cos( )a1 (m )rp (kT mT ) = (1 + ) cos( )a1 (k )
m
~
=
y (kT ) 0 (1 + ) cos( ) a1 (k )
(c)
y(kT)
0.5
-0.5
-1
-1
-0.5
0
x(kT)
0.5
-1
-0.5
0
x(kT)
0.5
(d)
y(kT)
0.5
-0.5
-1
(e) The phase trajectory is skewed, the same way a circle is skewed to create an ellipse.
(f)
= 0.1 = 0 deg
1
y(kT)
0.5
-0.5
-1
-1
-0.5
0
x(kT)
0.5
0.5
= 0 = 20 deg
1
y(kT)
0.5
-0.5
-1
-1
-0.5
0
x(kT)
The two plots above illustrate the effects: The amplitude imbalance stretches the axis. The phase
imbalance rotates the Q-axis but not the I-axis creating the pronounced skewing effect observed
in part (d).
10.4
(c)
4
3
2
y(kT)
1
0
-1
-2
-3
-4
-4
-2
0
x(kT)
-4
-2
0
x(kT)
(d)
4
3
2
y(kT)
1
0
-1
-2
-3
-4
(e) The phase trajectory is skewed, the same way a circle is skewed to create an ellipse.
(f)
= 0 = 20 deg
1
y(kT)
y(kT)
= 0.1 = 0 deg
-1
-1
-2
-2
-3
-3
-4
-4
-4
-2
0
x(kT)
-4
-2
0
x(kT)
The two plots above illustrate the effects: The amplitude imbalance stretches the axis. The phase
imbalance rotates the Q-axis but not the I-axis creating the pronounced skewing effect observed
in part (d).
10.5
m
m
~
s (nT ) = a0 + ja1 (n Nm ) [ p c (nT ) + jp s (nT )]
N
N
m
m
m
= a0 (n Nm ) p c (nT ) a1 (n Nm ) p s (nT )
N
N
m
m
+ j a 0 (n Nm ) p s (nT ) a1 (n Nm ) p c (nT )
N
N
m
10.6
Start with the diagram in Figure 10.1.2 (d) and consider first the top branch:
a0 (k )
pc (nT )
( )
( )
( )
( )
Pc ( z ) = Pc ,0 z N + z 1 Pc ,1 z N + z 2 Pc , 2 z N + " + z ( N 1) Pc , N 1 z N
Pc ,1 ( z )
Pc , 2 ( z )
#
Pc, N 1 ( z )
The same process is applied to the branch involving a1 (k ) and p s (nT ) . Putting it all together
produces the desired block diagram.
10.7
Consider first the processing involving subfilter r:
a0 (k ) + ja1 (k )
Pr ( z )
e j 0 r
Because the coefficients p (nT ) are purely real, the filtering process has the equivalent form
Pr ( z )
a0 (k )
Pr ( z )
a1 (k )
b0 (k )
b1 (k )
e j 0 r
j
The desired output is
a0 (k )
Pr (z )
cos( 0 r )
a1 (k )
Pr (z )
sin ( 0 r )
Applying the same procedure to all subfilters generates the desired result.
10.8
We need to show that Pc ,r ( z ) = Pr ( z ) cos(r 0 ) and Ps ,r (z ) = Pr ( z )sin (r 0 ) . From Equation
(10.14) we have
Gr ( z ) = 2 p(r )e j0 r z r + 2 p( N + r )e j 0 ( N + r ) z ( N + r ) + 2 p(2 N + r )e j0 (2 N + r ) z (2 N + r ) + "
Because 0 =
2
integer , e j0 ( N + r ) = e j0 so that
N
Gr ( z ) = 2 p (r )e j0 r z r + 2 p( N + r )e j 0 r z ( N + r ) + 2 p (2 N + r )e j0 r z (2 N + r ) + "
= 2e j0 r p (r )z r + p ( N + r )z ( N + r ) + p (2 N + r )z (2 N + r ) + "
= 2e j0 r Pr ( z )
{
}
(k ) = Im{g (k )} = Im{ 2 p (k )e } =
p c ,r (k ) = Re{g r (k )} = Re 2 p r (k )e j0 r = 2 p r (k ) cos( 0 r )
p s ,r
j 0 r
2 p r (k )sin ( 0 r )
10.9
}
) g (nT )
+ ([I (nT ) + jQ (nT )]e
j 0 n
[I (nT ) + jQ (nT )]e j0 n
r
r
r
r
= 2
2
1
[I r (nT ) + jQr (nT )]e j0n g (nT ) + 1 [I r (nT ) jQr (nT )]e j0n g (nT )
=
2
2
= [I r (nT ) + jQr (nT )]e j0 n p( nT )e j0 n + [I r (nT ) jQr (nT )]e j0 n p ( nT )e j0 n
x ( nT )
y ( nT )
= e j0 n [x(nT ) + jy (nT )]
=0
The second term is zero because Ir(nT), Qr(nT), p(nT) are low-pass sequences.
10.10
}
) g (nT )
+ ([I (nT ) + jQ (nT )]e
j 0 n
[I (nT ) + jQ (nT )]e j0 n
r
r
r
r
= 2
2
1
[I r (nT ) + jQr (nT )]e j0n g (nT ) + 1 [I r (nT ) jQr (nT )]e j0n g (nT )
=
2
2
j 0 n
j 0 n
= [I r (nT ) + jQr (nT )]e
p( nT )e
+ [I r (nT ) jQr (nT )]e j 0 n p( nT )e j 0 n
=0
second term = [I r (kT ) jQr (kT )]e j 0 k p((n + k )T )e j0 (n k )
k
x ( nT )
y ( nT )
= e j0 n [x(nT ) jy (nT )]
The first term is zero because Ir(nT), Qr(nT), p(nT) are low-pass sequences.
Note that the answer
r (nT ) g (nT ) = e j0 n [x(nT ) jy (nT )]
10.11
(a)
H ( j ) =
1
1
1
+
+ jC
R j L
RL
RL[L j ( 2 RLC R )]
=
2
L + j ( 2 RLC R )
2 L2 + ( 2 RLC R )
2 L2 + ( 2 RLC R )
The imaginary part is zero when RL( 2 RLC R ) = 0 . Thus we have
02 RLC R = 0
02 =
1
LC
(b)
H ( j ) =
2
2 R 2 L2
2 L2 + ( 2 RLC R )
H ( j 0 )
1 2 2
R L
LC
=
= R2
2
1 2 1
L +
RLC R
LC
LC
32 R 2 L2
32 L2 + ( 32 RLC R )
R2
=
2
2 32 L2 = 32 L2 + 32 RLC R
R 2 L2 C 2 34 2 R 2 LC + L2 32 + R 2 = 0
(2R
LC + L2 4 R 4 L2 C 2
=
2 R 2 L2 C 2
1
1
1
1
32 =
+
+ 2 3
2 2
4 4
LC 2 R C
4R C
R LC
2
3
2 R 2 LC + L2
1 1
1
+
2
2 2
LC
R C 4R C
32 =
1
1
+
LC 2 R 2 C 2
32 =
1
1
1
+
2 2
LC 2 R C
RC
1
1
+
2 2
LC
4R C
32 =
1
1
1
1
1
1
+
+
+
2 2
2 2
2 2
RC
LC
R
C
R C
C LC
4
4
4 R
X2
Y2
2 XY
1
1
1
=
2 2
LC
4R C
2 RC
2
3
1
1
1
3 =
2 2
LC
4R C
2 RC
There are four solutions. Retaining only the positive roots produces the desired result
(c)
W3dB = 2 1
=
1
1
1
1
1
1
+
+
+
+
2 RC
4 R 2 C 2 LC 2 RC
4 R 2 C 2 LC
1
1
1
1
1
1
+
+
+
+
2 2
2 2
LC 2 RC
LC
2 RC
4R C
4R C
1
=
RC
=
(d)
maximum C: 0 = 2 540 10 3
C max =
(2 540 10 ) (0.25 10 )
3 2
= 0.3475nF
(2 1600 10 ) (0.25 10 )
3 2
= 0.0396nF
(e)
30
25
20
15
10
0
400
600
800
1000
1200
carrier frequency (kHz)
1400
1600
The relationship between the tuned frequency (the carrier frequency) and the 3-dB bandwidth
follows the equation (see parts (a) and (c))
W3dB =
L 2
0
R
This shows that the 3-dB bandwidth increases as the square of the center frequency. The
component values selected for this problem produce the desired 3-dB bandwidth at 1000 kHz
(approximately the center of the band). For carrier frequencies below 1000 kHz, the 3-dB
bandwidth is too narrow; for carrier frequencies above 1000 kHz, the 3-dB bandwidth is too
high.
10.12
For high side mixing, f LO = f c + f 0 .
The image frequency on the positive frequency axis is the frequency resulting from the
difference. That is, the image frequency satisfies
f i f LO = f 0
Substituting, we have
f i = f 0 + f LO = f 0 + ( f c + f 0 ) = f c + 2 f 0
10.13
(a) Construct the diagram below where, for low-side mixing, f i = f c 2 f IF .
image rejection BPF
BW
fi
fi +
fc
B
2
Let BW be the bandwidth of the image rejection filter. Then, from the diagram, we have
BW
B
B
B
= f c f c 2 f IF + = f c f c + 2 f IF = 2 f IF
2
2
2
2
BW = 4 f IF B
f
fc
fi
B
2
Let BW be the bandwidth of the image rejection filter. Then, from the diagram, we have
fi
BW
B
B
B
= f c + 2 f IF f c = f c f c + 2 f IF = 2 f IF
2
2
2
2
BW = 4 f IF B
(c) Both expressions are the same. This issue is not the deciding factor in selecting between highside mixing and low-side mixing.
10.14
(a) For low-side mixing, the image frequency is below the carrier frequency. Consequently the
image rejection filter needs to be tunable if, when selecting the highest channel, the image
frequency is in the band. When selecting the highest channel ( f c = 1600 kHz), the image
frequency is
f i = f c 2 f IF = 1600 2 455 = 690 kHz
which is within the AM band. Thus, YES: the image rejection filter must be tunable.
(b) For high-side mixing, the image frequency is above the carrier frequency. Consequently the
image rejection filter needs to be tunable if, when selecting the lowest channel, the image
frequency is in the band. When selecting the lowest channel ( f c = 540 kHz), the image
frequency is
f i = f c + 2 f IF = 540 + 2 455 = 1450 kHz
which is within the AM band. Thus, YES: the image rejection filter must be tunable.
10.15
(a) For low-side mixing, the image frequency is below the carrier frequency. Consequently the
image rejection filter needs to be tunable if, when selecting the highest channel, the image
frequency is in the band. When selecting the highest channel ( f c = 107.9 MHz), the image
frequency is
f i = f c 2 f IF = 107.9 2 10.7 = 86.5 MHz
which is not within the FM band. Thus, NO: the image rejection filter does not need to be
tunable.
(b) For high-side mixing, the image frequency is above the carrier frequency. Consequently the
image rejection filter needs to be tunable if, when selecting the lowest channel, the image
frequency is in the band. When selecting the lowest channel ( f c = 88.1 MHz), the image
frequency is
f i = f c + 2 f IF = 88.1 + 2 10.7 = 109.5 MHz
which is not within the FM band. Thus, NO: the image rejection filter does not need to be
tunable.
10.16
(a) For low-side mixing, the image frequency is below the carrier frequency. Consequently the
image rejection filter needs to be tunable if, when selecting the highest channel, the image
frequency is in the band. When selecting the highest channel ( f c = 848.97 MHz), the image
frequency is
f i = f c 2 f IF = 848.97 2 10.7 = 827.57 MHz
which is within the AMPS band. Thus, YES: the image rejection filter must be tunable.
(b) For high-side mixing, the image frequency is above the carrier frequency. Consequently the
image rejection filter needs to be tunable if, when selecting the lowest channel, the image
frequency is in the band. When selecting the lowest channel ( f c = 824.04 MHz), the image
frequency is
f i = f c + 2 f IF = 824.04 + 2 10.7 = 845.44 MHz
which is within the AMPS band. Thus, YES: the image rejection filter must be tunable.
10.17
(a) For low-side mixing, the image frequency is below the carrier frequency. Consequently the
image rejection filter needs to be tunable if, when selecting the highest channel, the image
frequency is in the band. When selecting the highest channel ( f c = 848.97 MHz), the image
frequency is
f i = f c 2 f IF = 848.97 2 70 = 708.97 MHz
which is not within the AMPS band. Thus, NO: the image rejection filter does not need to be
tunable.
(b) For high-side mixing, the image frequency is above the carrier frequency. Consequently the
image rejection filter needs to be tunable if, when selecting the lowest channel, the image
frequency is in the band. When selecting the lowest channel ( f c = 824.04 MHz), the image
frequency is
f i = f c + 2 f IF = 824.04 + 2 70 = 964.04 MHz
which is not within the AMPS band. Thus, NO: the image rejection filter does not need to be
tunable.
10.18
(a) For low-side mixing, the image frequency is below the carrier frequency. Consequently the
image rejection filter needs to be tunable if, when selecting the highest channel, the image
frequency is in the band. When selecting the highest channel ( f c = 893.97 MHz), the image
frequency is
f i = f c 2 f IF = 893.97 2 10.7 = 872.57 MHz
which is within the AMPS band. Thus, YES: the image rejection filter must be tunable.
(b) For high-side mixing, the image frequency is above the carrier frequency. Consequently the
image rejection filter needs to be tunable if, when selecting the lowest channel, the image
frequency is in the band. When selecting the lowest channel ( f c = 869.04 MHz), the image
frequency is
f i = f c + 2 f IF = 869.04 + 2 10.7 = 890.44 MHz
which is within the AMPS band. Thus, YES: the image rejection filter must be tunable.
10.19
(a) For low-side mixing, the image frequency is below the carrier frequency. Consequently the
image rejection filter needs to be tunable if, when selecting the highest channel, the image
frequency is in the band. When selecting the highest channel ( f c = 893.97 MHz), the image
frequency is
f i = f c 2 f IF = 893.97 2 70 = 753.97 MHz
which is not within the AMPS band. Thus, NO: the image rejection filter does not need to be
tunable.
(b) For high-side mixing, the image frequency is above the carrier frequency. Consequently the
image rejection filter needs to be tunable if, when selecting the lowest channel, the image
frequency is in the band. When selecting the lowest channel ( f c = 869.04 MHz), the image
frequency is
f i = f c + 2 f IF = 869.04 + 2 70 = 1009.04 MHz
which is not within the AMPS band. Thus, NO: the image rejection filter does not need to be
tunable.
10.20
(a) For low-side mixing, the image frequency is below the carrier frequency. Consequently the
image rejection filter needs to be tunable if, when selecting the highest channel, the image
frequency is in the band. When selecting the highest channel ( f c = 914.8 MHz), the image
frequency is
f i = f c 2 f IF = 914.8 2 10.7 = 893.4 MHz
which is within the GSM band. Thus, YES: the image rejection filter must be tunable.
(b) For high-side mixing, the image frequency is above the carrier frequency. Consequently the
image rejection filter needs to be tunable if, when selecting the lowest channel, the image
frequency is in the band. When selecting the lowest channel ( f c = 890.2 MHz), the image
frequency is
f i = f c + 2 f IF = 890.2 + 2 10.7 = 911.6 MHz
which is within the GSM band. Thus, YES: the image rejection filter must be tunable.
10.21
(a) For low-side mixing, the image frequency is below the carrier frequency. Consequently the
image rejection filter needs to be tunable if, when selecting the highest channel, the image
frequency is in the band. When selecting the highest channel ( f c = 914.8 MHz), the image
frequency is
f i = f c 2 f IF = 914.8 2 70 = 774.8 MHz
which is not within the GSM band. Thus, NO: the image rejection filter does not need to be
tunable.
(b) For high-side mixing, the image frequency is above the carrier frequency. Consequently the
image rejection filter needs to be tunable if, when selecting the lowest channel, the image
frequency is in the band. When selecting the lowest channel ( f c = 890.2 MHz), the image
frequency is
f i = f c + 2 f IF = 890.2 + 2 70 = 1030.2 MHz
which is not within the GSM band. Thus, NO: the image rejection filter does not need to be
tunable.
10.22
(a) For low-side mixing, the image frequency is below the carrier frequency. Consequently the
image rejection filter needs to be tunable if, when selecting the highest channel, the image
frequency is in the band. When selecting the highest channel ( f c = 959.8 MHz), the image
frequency is
f i = f c 2 f IF = 959.8 2 10.7 = 838.4 MHz
which is within the GSM band. Thus, YES: the image rejection filter must be tunable.
(b) For high-side mixing, the image frequency is above the carrier frequency. Consequently the
image rejection filter needs to be tunable if, when selecting the lowest channel, the image
frequency is in the band. When selecting the lowest channel ( f c = 935.2 MHz), the image
frequency is
f i = f c + 2 f IF = 935.2 + 2 10.7 = 956.6 MHz
which is within the GSM band. Thus, YES: the image rejection filter must be tunable.
10.23
(a) For low-side mixing, the image frequency is below the carrier frequency. Consequently the
image rejection filter needs to be tunable if, when selecting the highest channel, the image
frequency is in the band. When selecting the highest channel ( f c = 959.8 MHz), the image
frequency is
f i = f c 2 f IF = 959.8 2 70 = 819.8 MHz
which is not within the GSM band. Thus, NO: the image rejection filter does not need to be
tunable.
(b) For high-side mixing, the image frequency is above the carrier frequency. Consequently the
image rejection filter needs to be tunable if, when selecting the lowest channel, the image
frequency is in the band. When selecting the lowest channel ( f c = 935.2 MHz), the image
frequency is
f i = f c + 2 f IF = 935.2 + 2 70 = 1075.2 MHz
which is not within the GSM band. Thus, NO: the image rejection filter does not need to be
tunable.
10.24
(a) For low-side mixing, the image frequency is below the carrier frequency. Consequently the
image rejection filter needs to be tunable if, when selecting the highest channel, the image
frequency is in the band. When selecting the highest channel ( f c = 136.975 MHz), the image
frequency is
f i = f c 2 f IF = 136.975 2 10.7 = 115.575 MHz
which is not within the ATC band. Thus, NO: the image rejection filter does not need to be
tunable.
(b) For high-side mixing, the image frequency is above the carrier frequency. Consequently the
image rejection filter needs to be tunable if, when selecting the lowest channel, the image
frequency is in the band. When selecting the lowest channel ( f c = 118 MHz), the image
frequency is
f i = f c + 2 f IF = 118 + 2 10.7 = 139.4 MHz
which is not within the ATC band. Thus, NO: the image rejection filter does not need to be
tunable.
10.25
(a) For low-side mixing, the image frequency is below the carrier frequency. Consequently the
image rejection filter needs to be tunable if, when selecting the highest channel, the image
frequency is in the band. When selecting the highest channel ( f c = 136.975 MHz), the image
frequency is
f i = f c 2 f IF = 136.975 2 21.4 = MHz
which is not within the ATC band. Thus, NO: the image rejection filter does not need to be
tunable.
(b) For high-side mixing, the image frequency is above the carrier frequency. Consequently the
image rejection filter needs to be tunable if, when selecting the lowest channel, the image
frequency is in the band. When selecting the lowest channel ( f c = 118 MHz), the image
frequency is
f i = f c + 2 f IF = 118 + 2 21.4 = MHz
which is not within the ATC band. Thus, NO: the image rejection filter does not need to be
tunable.
10.26
(a)
c
fc
fc
d
f c > f1
( f c + f1 )
( f c f1 )
f c f1
f c + f1
( f c f1 )
f c f1
f
f 2 < f c f1
f
( f c f1 f 2 ) f c f1 f 2
( f c f1 + f 2 )
f c f1 + f 2
( f c f1 f 2 ) f c f1 f 2
(b) From the diagrams in part (a) and the assumed relationships, we have
f IF = f c f 1 f 2
(c)
To prevent spectral overlap at f = 0, we require
B
2
B
f c f1 f 2 >
2
f c f1 >
(d)
BPF 1
fc
B
f c 2 f1
2
fc
f c + 2 f1 +
BPF 2
( f c f1 )
f c f1
f c f1 2 f 2
B
2
f c f1 + 2 f 2 +
B
2
BPF 3
B
( f c f1 f 2 ) f c f1 f 2
B
2
10.27
There are many correct answers to this question. To illustrate the approach, assume that all
frequency translations use low-side mixing. With these assumptions, the first and second IF
frequencies are
first IF = fc f1
second IF = fc f1 f2
Using these assumptions and the constraint on the center frequency to bandwidth ratios, we have
12000
10
4 (12000 f1 ) + 6
(1)
12000 f1
10
4 (12000 f 1 f 2 ) + 6
(2)
(3)
f1 11701.5
(4)
39 f 1 + 40 f 2 468060
(5)
(6)
9140 f 1 11701.5
(7)
The design procedure is to select f1 that satisfies condition (7). Given the choice for f1, f2 is given
by
f 2 = 11970 f1
(8)
As an example, choose f1 = 10000 MHz. This forces f2 = 1930 MHz. The bandwidths (and center
frequency to bandwidth ratios) of the three bandpass filters are
BW 1 = 4 (12000 10000 ) + 6 = 8006
12000
Q1 =
= 1.5
8006
BW 2 = 4 (2000 1930 ) + 6 = 286
2000
Q2 =
=7
286
BW 3 = 6
70
Q3 =
= 11.7
6
The block diagram below illustrates the complete design.
2000
BPF
70
fixed
BPF1
10000
fixed
BPF2
1930
LO1
LO2
tuning control
12000
7997
1857
2000
2143
67
70
73
tuning control
16003
12000
from
antenna
to
demod
10.28
(a)
r (t ) 2 cos( c t ) = 2 I r (t ) cos 2 ( c t ) 2Qr (t )sin ( c t ) cos( c t )
= I r (t ) + I r (t ) cos(2 c t ) Qr (t )sin (2 c t )
(b) The low-pass filter output is I r (t ) . It is impossible to recover both I r (t ) and Qr (t ) from the
LPF output.
10.29
(a)
r (t ) 2 cos( c t ) = 2 I r (t ) cos( c t + ) cos( c t ) 2Qr (t )sin ( c t + ) cos( c t )
(b) The low-pass filter output is I r (t ) cos( ) Qr (t )sin ( ) . It is impossible to recover both I r (t )
and Qr (t ) from the LPF output.
10.30
(a) Channel k requires M complex-valued multiplications
(b) The number of complex-valued multiplications required to produce K channels in parallel is
MK.
(c) The condition is
M ( p1 + p 2 + " + p ) < MK
which requires
p1 + p 2 + " + p < K
10.31
(a) 4 Mbits/s QPSK 2 Msymbols/s: the sample rate must be a multiple of 2.
The bandwidth of 4 Mbit/s QPSK with the SRRC pulse shape with 50% excess bandwidth is
1 + Rb
1.5 4
2
= 2
= 3 MHz
2
2
2 2
Thus the sample rate must be greater than 6 Msamples/s
From Table 10.1.1, the lowest sample rate that satisfies both requirements is 8 Msamples/s.
(b) From Table 10.1.1, the sample rates that meet both requirements are 280 Msamples/s, 56
Msamples/s, 40 Msamples/s, and 8 Msamples/s.
10.32
(a)
Maximum
|
Maximum
Sample Rate
Bandwidth
| Sample Rate
Bandwidth
(Msamples/s)
(MHz)
| (Msamples/s)
(MHz)
--------------------------------------------------------180
90.0000
|
4
16/41
2.1951
60
30.0000
|
4
8/43
2.0930
36
18.0000
|
4
2.0000
25
5/7
12.8571
|
3
39/47
1.9149
20
10.0000
|
3
33/49
1.8367
16
4/11
8.1818
|
3
9/17
1.7647
13 11/13
6.9231
|
3
21/53
1.6981
12
6.0000
|
3
3/11
1.6364
10 10/17
5.2941
|
3
3/19
1.5789
9
9/19
4.7368
|
3
3/59
1.5254
8
4/7
4.2857
|
2
58/61
1.4754
7 19/23
3.9130
|
2
6/7
1.4286
7
1/5
3.6000
|
2
10/13
1.3846
6
2/3
3.3333
|
2
46/67
1.3433
6
6/29
3.1034
|
2
14/23
1.3043
5 25/31
2.9032
|
2
38/71
1.2676
5
5/11
2.7273
|
2
34/73
1.2329
5
1/7
2.5714
|
2
2/5
1.2000
4 32/37
2.4324
|
2
26/77
1.1688
(b) The lowest sample rate that can accommodate 8 MHz of bandwidth is 16 4/11 Msamples/s.
10.33
(a)
Maximum
|
Maximum
Sample Rate
Bandwidth
| Sample Rate
Bandwidth
(ksamples/s)
(kHz)
| (ksamples/s)
(kHz)
--------------------------------------------------------------42800
21400.0000
|
701
23/36
350.8194
14266
2/3
7133.3333
|
679
23/63
339.6825
8560
4280.0000
|
658
6/13
329.2308
6114
2/7
3057.1429
|
638
25/31
319.4032
4755
5/9
2377.7778
|
620
11/38
310.1447
3890 10/11
1945.4545
|
602
58/71
301.4085
3292
4/13
1646.1538
|
586
22/73
293.1507
2853
1/3
1426.6667
|
570
2/3
285.3333
2517 11/17
1258.8235
|
555
27/32
277.9219
2252 12/19
1126.3158
|
541
61/79
270.8861
2038
2/21
1019.0476
|
528
15/38
264.1974
1860 20/23
930.4348
|
515
55/83
257.8313
1712
856.0000
|
503
9/17
251.7647
1585
5/27
792.5926
|
491
83/87
245.9770
1475 25/29
737.9310
|
480
80/89
240.4494
1380 20/31
690.3226
|
470
30/91
235.1648
1296 32/33
648.4848
|
460
20/93
230.1075
1222
6/7
611.4286
|
450
10/19
225.2632
1156 28/37
578.3784
|
441
14/59
220.6186
1097 17/39
548.7179
|
432
11/34
216.1618
1043 37/41
521.9512
|
423
77/101
211.8812
995 15/43
497.6744
|
415
55/103
207.7670
951
1/9
475.5556
|
407
13/21
203.8095
910 30/47
455.3191
|
400
200.0000
873 23/49
436.7347
|
392
35/53
196.3302
839 11/51
419.6078
|
385
24/41
192.7927
807 29/53
403.7736
|
378
51/67
189.3806
778
2/11
389.0909
|
372
4/23
186.0870
750 50/57
375.4386
|
365
95/117
182.9060
(b) The lowest sample rate that can accommodate 200 kHz of bandwidth is 400 ksamples/s.
10.34
(a)
Maximum
|
Maximum
Sample Rate
Bandwidth
| Sample Rate
Bandwidth
(ksamples/s)
(kHz)
| (ksamples/s)
(kHz)
--------------------------------------------------------------1820
910.0000
|
29
51/61
14.9180
606
2/3
303.3333
|
28
8/9
14.4444
364
182.0000
|
28
14.0000
260
130.0000
|
27
11/67
13.5821
202
2/9
101.1111
|
26
26/69
13.1884
165
5/11
82.7273
|
25
45/71
12.8169
140
70.0000
|
24
68/73
12.4658
121
1/3
60.6667
|
24
4/15
12.1333
107
1/17
53.5294
|
23
7/11
11.8182
95 15/19
47.8947
|
23
3/79
11.5190
86
2/3
43.3333
|
22
38/81
11.2346
79
3/23
39.5652
|
21
77/83
10.9639
72
4/5
36.4000
|
21
7/17
10.7059
67 11/27
33.7037
|
20
80/87
10.4598
62 22/29
31.3793
|
20
40/89
10.2247
58 22/31
29.3548
|
20
10.0000
55
5/33
27.5758
|
19
53/93
9.7849
52
26.0000
|
19
3/19
9.5789
49
7/37
24.5946
|
18
74/97
9.3814
46
2/3
23.3333
|
18
38/99
9.1919
44 16/41
22.1951
|
18
2/101
9.0099
42 14/43
21.1628
|
17
69/103
8.8350
40
4/9
20.2222
|
17
1/3
8.6667
38 34/47
19.3617
|
17
1/107
8.5047
37
1/7
18.5714
|
16
76/109
8.3486
35 35/51
17.8431
|
16
44/111
8.1982
34 18/53
17.1698
|
16
12/113
8.0531
33
1/11
16.5455
|
15
19/23
7.9130
31 53/57
15.9649
|
15
5/9
7.7778
(b) The lowest sample rate that can accommodate 10 kHz of bandwidth is 20 ksamples/s.
10.35
Maximum
|
Maximum
Sample Rate
Bandwidth
| Sample Rate
Bandwidth
(ksamples/s)
(kHz)
| (ksamples/s)
(kHz)
--------------------------------------------------------------85600
42800.0000
|
1403
5/18
701.6389
28533
1/3
14266.6667
|
1358
19/26
679.3654
17120
8560.0000
|
1316
12/13
658.4615
12228
4/7
6114.2857
|
1277
11/18
638.8056
9511
1/9
4755.5556
|
1240
11/19
620.2895
7781
9/11
3890.9091
|
1205
19/30
602.8167
6584
8/13
3292.3077
|
1172
44/73
586.3014
5706
2/3
2853.3333
|
1141
1/3
570.6667
5035
5/17
2517.6471
|
1111
11/16
555.8438
4505
5/19
2252.6316
|
1083
43/79
541.7722
4076
4/21
2038.0952
|
1056
15/19
528.3947
3721 17/23
1860.8696
|
1031
13/40
515.6625
3424
1712.0000
|
1007
1/17
503.5294
3170 10/27
1585.1852
|
983
79/87
491.9540
2951 21/29
1475.8621
|
961
71/89
480.8989
2761
9/31
1380.6452
|
940
29/44
470.3295
2593 16/17
1296.9706
|
920
40/93
460.2151
2445
5/7
1222.8571
|
901
1/19
450.5263
2313 19/37
1156.7568
|
882
9/19
441.2368
2194 34/39
1097.4359
|
864
11/17
432.3235
2087 33/41
1043.9024
|
847
32/61
423.7623
1990 30/43
995.3488
|
831
3/44
415.5341
1902
2/9
951.1111
|
815
5/21
407.6190
1821
5/18
910.6389
|
800
400.0000
1746 15/16
873.4688
|
785
9/28
392.6607
1678 22/51
839.2157
|
771
6/35
385.5857
1615
3/32
807.5469
|
757
12/23
378.7609
1556
4/11
778.1818
|
744
8/23
372.1739
1501 43/57
750.8772
|
731
73/117
365.8120
A.1
NRZ
RZ
0.5
0.5
rp()
rp()
-0.5
-0.5
-1
-0.5
0
/T
s
0.5
-1
-0.5
MAN
0
/T
s
0.5
0.5
HS
0.5
0.5
rp()
rp()
-0.5
-0.5
-1
-0.5
0.5
-1
-0.5
/Ts
/Ts
For all pulse shapes, the autocorrelation function is zero for > Ts . Hence the pulse shape
autocorrelation function is zero for all non-zero multiples of Ts .
A.2
(a) E =
Ts / 2
t
4 A2 2
+
t
dt
4 A 2 1
2
Ts
Ts
T2 / 2
A 2Ts
dt =
3
Ts
2
Ts / 2
+Ts / 2
2A 2A
(t )dt + 2 A1 t
rp ( ) =
t
Ts
Ts
Ts
Ts / 2
3
Ts
A=
(b) For 0
2 A2 3 2 A2 2 1 2
+ A Ts
Ts
3
Ts2
= 6
Ts
For
s
2A
(t )dt + 2 A1 t
Ts
Ts
+Ts / 2
6 + 1
Ts
Ts
Ts
2
t
rp ( ) = 2 A1
Ts
2 A2
= 2 3 +
3Ts
Ts
= 2
Ts
t
dt
2 A1
Ts
2 A2 2
2
+ 2 A 2 + A 2Ts
Ts
3
2
+ 6 6 + 2
Ts
Ts
2 + 6 + 6 + 2
T
T
T3
3
3
3
2
6 6 + 1
T
T
3
rp ( ) = 33
2
6 T 6 T + 1
3 3 3 2
2 + 6 6 + 2
T3
T3
T3
0
Ts
Ts
Ts
0
2
Ts
2
Ts
Ts
2
Ts
Ts
2
t
2 A1
Ts
dt
(c)
P( f ) =
Ts / 2
=
=
P( f )
2 A j 2ft
t
te
dt + 2 A1 e j 2ft dt
Ts
Ts
Ts / 2
A
1 e jfTs
2
2 f Ts
2
2A
fT
sin 2 s e jfTs
2
f Ts
2
2
4 A2
fT
= 4 4 2 sin 4 s
f Ts
2
fT
sin 4 s
AT
2
=
4
4
fTs
2
fT
sin 4 s
3T
2
= s
4 fTs 4
2
2
2
s
(d)
Babs =
B90 =
0.85
Ts
B99 =
1.30
Ts
B60 dB =
20
Ts
0
-10
-20
|P(f)|2 (dB)
-30
-40
-50
-60
-70
-80
-90
10
15
fTs (cycles/symbol)
20
25
A.3
2
2t
3 A 2Ts
2
=
E
A
1
cos
dt
=
(a)
0
T
2
s
Ts
A=
2
3Ts
(b) For 0 Ts
2t
2 (t )
1 cos
dt
rp ( ) = A2 1 cos
Ts
Ts
Ts
= A2 (Ts ) +
A2
(Ts )cos 2
2
Ts
3 A2Ts 2
+
sin
4
Ts
1
2 1
= 1 + 1 cos 2 +
sin 2
3 Ts 3 Ts Ts 2
Ts
Using the property rp ( ) = rp ( ) we have
0
2
1 1
1 + + 1 + cos 2
sin 2
Ts 3 Ts Ts 2
3
Ts
rp ( ) =
2 1 + 1 1 cos 2 + 1 sin 2
T
3 Ts 3 Ts Ts 2
s
(c)
2t j 2ft
e
P( f ) = A1 cos
dt
T
s
0
1
jA
1 e j 2fTs
=
2
2 f ( fTs ) 1
Ts
)[
=
P( f ) =
2
e jfTs
sin (fTs )
f ( fTs )2 1
A
2
sin 2 (fTs )
AT
3 ( fT )2 1 2 (fTs )2
s
2
2
s
2
sin 2 (fTs )
Ts
3 ( fT )2 1 2 (fTs )2
s
< Ts
Ts 0
0 Ts
Ts <
Babs =
B90 =
0.95
Ts
B99 =
1.41
Ts
B60 dB =
7
Ts
0
-10
-20
-30
|P(f)|2 (dB)
(d)
-40
-50
-60
-70
-80
-90
4
6
fTs (cycles/symbol)
10
A.4
(t kTs )
k =
(a)
G( f ) = Rp ( f )
1
Ts
m =
m 1
=
Ts Ts
(b)
G( f ) =
g (t )e
j 2ft
dt
=
=
(
)
r
t
(t kTs ) e j 2ft dt
p k
=
r (t )e
k =
r (kT )e
k =
j 2ft
(t kTs )dt
j 2fTs k
R f T
m =
1
Ts
m =
f T
A.5
Rp ( f ) =
r ( )e
j 2f
p
=
j 2f
d
p(t ) p (t )dt e
= t =
= p(t ) p (t )e j 2f d dt
t =
=
= p(t ) p( x )e j 2f (t x )dx dt
t =
x =
p(t )e
j 2ft
t =
= P( f )P ( f )
= P( f )
dt p( x )e j 2fx dx
x =
A.6
p (t ) =
(1 ) 4
(1 + )
sin
t +
t cos
t
1
Ts
Ts
Ts
=
2
Ts
t 4 2
t
1
T s T s
N (t )
T s D (t )
(1 + ) 4
(1 + ) 4t (1 + ) (1 + )
cos
t +
t
t
cos
sin
Ts
Ts
Ts
Ts
Ts
Ts
Ts
2
2
4 2
t 4
t 2
t
D(t ) = 1
Ts Ts
Ts Ts
N (t ) =
(1 )
(a)
lim p(t ) =
t 0
N (t )
N (t )
1
1
1 N (0)
1
4
=
=
=
lim
lim
1 +
0
t
0
D(t )
D(t )
Ts
Ts
Ts D(0)
Ts
(b)
lim p(t ) =
1
Ts
1
Ts
1
Ts
T
t s
4
T
N s
N (t )
N (t )
1
1
4
lim
lim
=
=
Ts D (t )
Ts D(t )
Ts t
Ts D Ts
t
4
4
4
(1 ) 1 4
1+ 1+ 1+
cos
cos
sin
+
Ts
4
4 4
4 Ts
2
2
2
4 Ts 2 Ts 4 Ts
1
Ts Ts 4 Ts 4 Ts 4
2
2
2
1 + sin
+ 1 cos
2Ts 4 4
2
Ts
2
2
1 + sin
+ 1 cos
2Ts 4 4
T2
is the same.
4
f 3Ts (1 )
1 + cos
2
f T (1 )
2 = 1 + cos 3 s
2
f T (1 )
cos 1 2 1 = 3 s
2
(1 ) = f T
cos 1 2 1 +
3 s
2
f 3Ts =
1
by construction.
2
B.1
e j 0 t + e j 0 t
cos( 0 t ) =
2
B.2
e j0t + e j0t
cos( 0 t ) =
2
B.3
e j0t e j0t
sin ( 0 t ) =
j2
B.4
e j 0 t e j 0 t e j 0 t e j 0 t
sin ( 0 t ) =
=
j2
j2
B.5
B.6
e j (0t + ) + e j (0t + )
cos( 0 t + ) =
2
j
e
e j j 0 t
=
e j0t +
e
2
2
B.7
e j (0t + ) e j (0t + )
sin ( 0 t + ) =
j2
=
e j j 0 t e j j 0 t
e
e
j2
j2
B.8
e j (0t + ) = cos( 0 t + ) + j sin ( 0 t + )
B.9
Given e j0t 2 ( 0 ) and
x(t ) X ( j ) x (t ) X ( j ) ,
we have
e j 0 t = e j 0 t
2 ( 0 ) = 2 ( + 0 )
B.10
cos( 0 t ) =
1 j0t 1 j0t
e
+ e
2
2
1
1
2 ( 0 ) + 2 ( + 0 )
2
2
= ( 0 ) + ( + 0 )
B.11
sin ( 0 t ) =
1 j 0 t 1 j 0 t
e
e
j2
j2
1
1
2 ( 0 )
2 ( + 0 )
j2
j2
=
( 0 )
( + 0 )
B.12
cos( 0 t + ) =
1 j (0t + ) 1 j (0t + )
e
+ e
2
2
j
e
e j j 0 t
j 0 t
=
e
+
e
2
2
e j
e j
2 ( 0 ) +
2 ( + 0 )
2
2
= e j ( 0 ) + e j ( + 0 )
B.13
sin ( 0 t + ) =
1 j (0t + ) 1 j (0t + )
e
e
j2
j2
e j j 0 t e j j 0 t
e
e
j2
j2
e j
e j
2 ( 0 )
2 ( + 0 )
2
2
e j ( 0 )
e j ( + 0 )
B.14
Given e j0t 2 ( 0 ) and
x(t ) X ( j ) x (t ) X ( j ) ,
we have
e j (0t + ) = e j e j0t
e j 2 ( 0 ) = e j 2 ( + 0 )
B.15
x(t ) X ( j ) x(t )e j0t X ( j ( + 0 ))
B.16
I (t ) cos( 0 t ) Q(t )sin ( 0 t ) = A(t ) cos( 0 t + (t ))
where
A(t ) = I 2 (t ) + Q 2 (t )
Q(t )
I (t )
(t ) = tan 1
B.17
(a) A straightforward application of the frequency shift property in Table 2.4.3 gives
~
~
u~ (t ) U ( j ) u~ (t )e j0t U ( j ( 0 )) .
(b) A straight forward application of the conjugation property in Table 2.4.3 gives
~
u~ (t )e j0t U ( j ( 0 ))
~
u~(t )e j0t U ( j ( 0 ))
~
u~ (t )e j0t U ( j ( + ))
{ {
}}
1
1
1~
1 ~
= U ( j ( 0 )) + U ( j ( + 0 ))
2
2
B.18
(a)
r (t ) =
1
2
I r (t ) e j0t + e j0t + j
1
2
Qr (t ) e j0t e j0t
(b)
r (t ) =
1
2
([I (t ) + jQ (t )]e
r
j 0 t
j 2 0 t
B.19
MLTED
ELTED
a 0 (k )x(k + 1 / 2 ) a 0 (k )x(k 1 / 2 ) + a1 (k ) y (k + 1 / 2 ) a1 (k ) y (k 1 / 2 )
= Re
+ j[a 0 (k ) y (k + 1 / 2 ) a 0 (k ) y (k 1 / 2 ) a1 (k ) y (k + 1 / 2 ) + a1 (k ) y (k 1 / 2 )]
= a 0 (k )[x(k + 1 / 2 ) x(k 1 / 2 )] + a1 (k )[ y (k + 1 / 2 ) y (k 1 / 2 )]
ZCTED
GTED
= Re
a 0 (k 1)x(k ) + a1 (k 1) y (k ) a 0 (k )x(k 1) a1 (k ) y (k 1)
= Re
B.20
e(k ) = Im a~ (k )~
x (k )
B.21
~
x = ~
x e j
x + jy = ( x + jy )e j
= ( x + jy )(cos j sin )
= x cos + y sin + j ( x sin + y cos )
Organizing the above into a matrix equation produces the desired result.
B.22
(a)
The upper output:
= I r (t )sin (2 0 t ) Qr (t ) + Qr (t ) cos(2 0 t )
r (t )
LPF
I r (t ) jQr (t )
e j 0 t
The output of this system is the complex conjugate of the system that uses 2 sin ( 0 t ) .
(d)
0
LPF
20
C.1
H a (s ) =
k0 k p k
s + k0 k p k
(s ) = H (s )(s ) =
and
a
s
k 0 k p k
k0 k p k
s + k0 k p k
(a) (s ) =
(s ) =
s (s + k 0 k p k )
(t ) = 1 e
(b) (s ) =
(s ) =
k 0 k p kt
s
s + k0 k p k
]u(t )
s2
k 0 k p k
s (s + k 0 k p k )
2
k0 k p k
s
k0k p k
s 2 s + k0k p k
1
1
k k kt
+t +
e 0 p u (t )
k0k p k
k 0 k p k
k k kt
= t
1 e 0 p u (t )
k0k p k
(t ) =
(s )
C.2
n2
n2
H a (s ) = 2
and (s ) = H a (s )(s ) = 2
(s )
s + 2 n s + n2
s + 2 n s + n2
The roots of s 2 + 2 n s + n2 are n n 2 1 . These roots are real and distinct for > 1 ,
real and repeated for = 1 , and complex conjugates when 0 < < 1 . (When = 0 , the roots
are purely imaginary. But we are not interested in this solution for this problem.)
(a) (s ) =
Case 1, > 1 :
(s ) =
n2
n2
=
s 2 + 2 n s + n2 s
s s + n n 2 1 s + n + n 2 1
)(
1+ 2
1 2
2 1
1
=
2
s
s + n n 1 s + n + n 2 1
1
(t ) = 1 1 + 2 e
2
1
n 2 1 t
n + n
+ 1 2 e
1
2 1 t
= 1 e n t cosh n 2 1 t + 2
sinh n 2 1 t u (t )
1
))
((
Case 2, = 1 :
(s ) =
n2
n
2
2
s
(s + n ) s + n
(s + n ) s
(t ) = 1 n te t e t u (t )
n
((
))
u (t )
n2
n2
=
s 2 + 2 n s + n2 s
s s + n j n 1 2 s + n + j n 1 2
)(
1 + j
1 j
2
2
2
2
1
1
s
s + n j n 1 2 s + n + j n 1 2
1
(t ) = 1 1 j
n jn
e
2
1
1 2 t
1
1 + j
2
1 2
sin n 2 1t
= 1 e nt cos n 2 1t +
2
n + jn
e
1 2 t
u (t )
u (t )
s2
Case 1, > 1 :
(b) (s ) =
(s ) =
n2
n2
=
s 2 + 2 n s + n2 s 2
s 2 s + n n 2 1 s + n + n 2 1
2
)(
s2
n
s
(t ) = t
2 2 1
2 2 1
2
2 +
2
2
2 n
2 n
1
1
+
+
s + n n 2 1 s + n + n 2 1
1
2 2 1 n n
2 +
e
2
2
2
1 nt 2 2 1 n
= t
+
e
e
2 1
n 2 n
2 1 t
2 1t
2 2 1 n +n
1
2
e
2
2
+ 2e n
2 1t
2 2 1
2 1
e n
2 1t
2
1 nt
2 2 1
= t
+
e
2 cosh n 2 1t +
sinh n 2 1t
2
1
n
n
2 1 t
+ 2e n
)u(t )
u (t )
2 1t
u (t )
Case 2, = 1 :
2
(s ) =
= 2 n +
+
2
2
2
s
s (s + n )
s
(s + n ) s + n
2
n
(t ) = t
e nt + te nt +
e nt u (t )
n
n2
n2
=
s 2 + 2 n s + n2 s 2
s 2 s + n j n 1 2 s + n + j n 1 2
s2
n
s
(t ) = t
2 2 1
2 j
2
2 n
s + n j n 1
)(
s + n + j n 1
2 2 1
2 + j
2
2 n
2 2 1 n j n
1
2 j
e
2
2
2 e n t
= t
+
n
n
1 2 t
2 2 1 n + j n
1
2 j
e
2
2
2 cos 1 2 t + 2 1 sin 1 2 t u (t )
n
n
1 2
1 2 t
u (t )
C.3
2 n s + n2
2 n s + n2
H a (s ) = 2
(s )
and (s ) = H a (s )(s ) = 2
s + 2 n s + n2
s + 2 n s + n2
The roots of s 2 + 2 n s + n2 are n n 2 1 . These roots are real and distinct for > 1 ,
real and repeated for = 1 , and complex conjugates when 0 < < 1 . (When = 0 , the roots
are purely imaginary. But we are not interested in this solution for this problem.)
s
Case 1, > 1 :
(a) (s ) =
(s ) =
2 n s + n2
2 n s + n2
=
s 2 + 2 n s + n2 s
s + n n 2 1 s + n + n 2 1 s
)(
( 1) ( + 1)
1 ( 1 )
1 ( + 1 )
=
+
+
2
s + n n 2 1
s + n + n 2 1
2 1 2
n
n
(t ) =
e
2
1 2 1
(
+ 1)
+
e
+ 1 u (t )
1 ( + 1 )
1)
1 ( 1 )
and the second term by
and
1)
1 ( 1 )
2 1 t
n + n 2 1 t
(
Multiplying the first term by
1 ( +
1 +
2
2
simplifying produces
1
e n
(t ) = +
2 2 2 1
1
= e n
2
2 1t
1
e n
2
+
e n
2
2
2 1
2 1t
2 1t
2 2 1
e n
2 1t
e nt + 1 u (t )
2 2 1
e n
e x + ex
e x ex
and sinh (x ) =
we have
2
2
(t ) = 1 e t cosh n 2 1t
n
2 1t
2 1
sinh n
1t ) u (t )
2 1t
t
e n + 1 u (t )
Case 2, = 1 :
(s ) =
2 n s + n2 (2 n s + n2 )
=
s 2 + 2 n s + n2 s
(s + n ) 2 s
+
2
(s + n ) s + n s
[
]
= [1 (1 t )e ]u (t )
(t ) = n te t e t + 1 u (t )
n
n t
2 n s + n2
(2 n s + n2 )
=
s 2 + 2 n s + n2 s
s + n j n 1 2 s + n + j n 1 2 s
)(
( j 1 ) ( + j 1 )
1 ( + j 1 )
1 ( j 1 )
+
+
=
2
j 1 2 2 j
n
n
(t ) =
e
2
1 j 1 2
s + n + j n 2 1
s + n j n 2 1
2 1 t
( + j 1 ) e
+
1 ( + j 1 )
2
(
Multiplying the first term by
1 ( + j
1 + j 1 2
1 2
)
)
2
2
n + j n 2 1 t
+ 1 u (t )
(
and the second term by
1 ( j
1 j 1 2
1 2
)
)
2
2
and
simplifying produces
1
2
(t ) = j
1
= e jn
2
j
e n
2
2 1
1
e j n
2
2 1t
2 1t
2 1t
2 2 1
e j n
2 1t
+ j
2 1t
2 2 1
sin n 2 1t u (t )
2 1
e nt + 1 u (t )
e jx e jx
e jx + e jx
and sin ( x ) =
we have
2
j2
(t ) = 1 e t cos n 2 1t
n
1
j
+ + j
e n
2
2
2 1
e j n
2 1t
t
e n + 1 u (t )
s2
Case 1, > 1 :
(b) (s ) =
(s ) =
2 n s + n2
2 n s + n2
=
s 2 + 2 n s + n2 s 2
s + n n 2 1 s + n + n 2 1 s 2
n 2 1
s + n n 1
2
(t ) =
n 2 2 1
s + n + n 1
2
n + n 2 1 t
n 2 2 1
)(
n 2 2 1
s2
n n 2 1 t
+ t u (t )
1
= t
sinh n 2 1t e nt u (t )
n 2 1
Case 2, = 1 :
(s ) =
2 n s + n2 (2 n s + n2 )
=
s 2 + 2 n s + n2 s 2
(s + n )2 s 2
(s + n )
s2
(t ) = te t + t u (t )
n
= t 1 e nt u (t )
Case 3, 0 < < 1 :
(s ) =
2 n s + n2
2 n s + n2
=
s 2 + 2 n s + n2 s 2
s + n j n 1 2 s + n + j n 1 2 s 2
n j2 1 2
s + n j n 1 2
(t ) =
n j 2 1 2
s + n + j n 1 2
+
n j2 1 2
n j n 1 2 t
)(
n j2 1 2
1
= t
sin n 1 2 t e nt u (t )
n 1 2
s2
e
n j n 1 2 t
+ t u (t )
C.4
K n2
K n2
(s )
H a (s ) = 2
and (s ) = H a (s )(s ) = 2
s + 2 n s + n2
s + 2 n s + n2
2 k 2
where K = 1 +
2
The roots of s 2 + 2 n s + n2 are n n 2 1 . These roots are real and distinct for > 1 ,
real and repeated for = 1 , and complex conjugates when 0 < < 1 . (When = 0 , the roots
are purely imaginary. But we are not interested in this solution for this problem.)
(a) (s ) =
Case 1, > 1 :
(s ) =
K n2
K n2
=
s 2 + 2 n s + n2 s
s s + n n 2 1 s + n + n 2 1
)(
K
1 +
2
2
2 1
2 1
K
s
s + n n 2 1 s + n + n 2 1
1
(t ) = K 1 1 +
n n
e
2
1
2 1 t
n +n
+ 1
e
2 1
2 1 t
= K 1 e nt cosh n 1 2 t +
sinh n 1 2 t u (t )
2 1
Case 2, = 1 :
(s ) =
K n2
(s + n )
K n
K
K
=
2
s
s
(s + n ) s + n
(t ) = K 1 n te t e t u (t )
n
u (t )
K n2
K n2
=
s 2 + 2 n s + n2 s
s s + n j n 1 2 s + n + j n 1 2
)(
K
K
1 j
1 + j
2
2
2
2
1
1
s
s + n j n 1 2 s + n + j n 1 2
1
(t ) = K 1 1 j
n jn
e
2
1
1 2 t
1
1 + j
2
1 2
sin n 2 1t
= K 1 e nt cos n 2 1t +
2
(b)
(s ) =
n + jn
e
1 2 t
u (t )
u (t )
s2
Case 1, > 1 :
(s ) =
K n2
K n2
=
s 2 + 2 n s + n2 s 2
s 2 s + n n 2 1 s + n + n 2 1
2 K
)(
s2
n
s
2 2 1 K
2 2 1
K
2 +
2
2
2
2 n
2 n
+
s + n n 2 1
s + n + n 2 1
2 1
2 2 1 n n 2 1 t 1
2 2 1 n +n 2 1 t
u (t )
(t ) = K t
+ 2
+ 2 +
e
e
2
2
2
n 2
1
1
2
2
1 nt 2 2 1 n 2 1t
2 2 1 n 2 1t
e
e
e
= K t
+
+ 2e n 1t
+ 2e n 1t u (t )
2 1
n 2 n
2 1
1 nt
2 2 1
e
2 cosh n 2 1t +
sinh n 2 1t u (t )
= K t
+
n n
2 1
Case 2, = 1 :
2 K
K
(s ) = K
= 2
2
2
s
s (s + n )
2
n
(t ) = K t
e nt + te nt +
2 K
K
(s + n )
n
s + n
e nt u (t )
n
K n2
K n2
=
s 2 + 2 n s + n2 s 2
s 2 s + n j n 1 2 s + n + j n 1
K
s2
n
s
(t ) = K t
K
2 2 1
2 j
2
2 n
s + n j n 1
)(
1
2 2 1 n jn
2 j
e
2
2
2 e nt
= K t
+
n
n
K
2 2 1
2 + j
2
2 n
s + n + j n 1
1 2 t
1
2 2 1 n + j n
2 j
e
2
2
2 cos 1 2 t + 2 1 sin 1 2 t u (t )
n
n
1 2
1 2 t
u (t )
k p k 0 F (s )
In general, H (s ) =
C.5
(a)
s + k p k 0 F (s )
F (s ) = k
H (s ) =
H ( j ) =
H ( j ) =
2
(k
k0 k )
2 + (k p k 0 k )2
k p k0 k
s + k p k0 k
k p k0 k
j + k p k 0 k
(k
k0 k )
2 + (k p k 0 k )2
k p k0 k
1
3 = k p k 0 k B3 =
2
2
B3 k p k 0 k
4
2
=
= <1
Bn
k p k0 k
2
So, B3 < Bn
(b)
F (s ) =
k
s+k
H (s ) =
n2
s 2 + 2 n s + n2
H ( j ) =
H ( j ) =
2
n4
2
n
) + (2 )
2 2
B3 =
B3 n
=
1 2 2 +
Bn 2
So, B3 < Bn
n2
n2 2 + j 2 n
n4
2
n
) + (2 )
2
1
3 = n 1 2 2 +
2
(1 2 )
2 2
+1
n
2
1 2 2 + (1 2 2 ) + 1
2
(1 2 )
2 2
+1
8
1 2 2 +
2
(1 2 )
2 2
(c)
F (s ) = k 1 +
k2
s
2 n s + n2
H (s ) = 2
s + 2 n s + n2
H ( j ) =
H ( j ) =
2
n4 + (2 n )2
2
n
) + (2 )
2 2
j 2 n + n2
n2 2 + j 2 n
n4 + (2 n )2
2
n
) + (2 )
2
1
3 = n 1 + 2 2 +
2
(1 + 2 )
2 2
n
2
1 + 2 2 + (1 + 2 2 ) + 1
2
B3 n
2
=
1 + 2 2 + (1 + 2 2 ) + 1
Bn 2
+1
B3 =
n +
2
1 1 + 2 +
(1 + 2 )
1
+
4
2 2
+1
1
4
(d)
F (s ) =
H (s ) =
H ( j ) =
H ( j ) =
2
C2
2
n
) + (2 )
2 2
k1 + s
k2 + s
k
where C = n2 + n 2 2
n
C
s + 2 n s +
2
2
n
C
+ j 2 n
2
n
C2
2
n
) + (2 )
= (2
C2
2
2
n
) (
1 + n4 2 2 1 n4 2
2
) (
) (
2
1
n2 2 2 1 + n4 2 2 1 n4 2
2
B3
2
1
n2 2 2 1 + n4 2 2 1 n4 2
=
Bn 2
B3 =
8
=
2 n
8
2
k2
n 1 + 2
n
n2 (2 2 1) + n4 (2 2 1) ( n4 2 )
2
k
1 + 2 2
n
This is a mess. It appears to be less than 1 for all values of , but it also depends on k2 and n.
C.6
H a (s ) =
2 n s + n2
k
where = 1
2
2
2
s + 2 n s + n
k0k p
k2
and n = k 0 k p k 2
H a (s ) =
which has two poles at s = j n .
This is an oscillator, which we do not want!
n2
s 2 + n2
C.7
k0 k p k
(a) H a (s ) =
s + k0 k p k
s +
T
2
z 1
1+
1+
2 1 z 1
2
2
=
=
(b) H a
1
1
T
T
1
2
1
+
z
z
1
+
2 z 1
T 1 + z 1
1
T
1+
2
(c) H d ( z ) =
(d)
K p K 0 Kz 1
1 (1 K p K 0 K )z 1
2 = 1 K K K
p
0
T
1+
2
(e) Bn =
k0 k p k
4
K p K0 K =
k 0 k p k = 4 Bn
T
=
T
1+
k 0 k p kT
1
1 + k 0 k p kT
2
K0 K p K =
4 Bn T
1 + 2 Bn T
C.8
n2
(a) H a (s ) = 2
s + 2 n s + n2
(b)
2 1 z 1
n2
=
H a
1
2
2 1 z 1
T 1 + z 2 1 z 1
+ n2
+
n
1
1
T 1+ z
T 1+ z
=
z 2
where n =
nT
2
K p K0
(c) H d ( z ) =
z 2 +
(d) K =
n2
(
z 2 + z 1 + 1)
2
1 2 n + n
n2 1
1 + 2 n + n2
1
+2
+
z
1 2 n + n2
1 2 n + n2
z 1
K
K p K0 K 1
K
z 1 +
1
K
1 2 n + n2
1 + 2 n + n2
n
T
1
we have Bn T = n =
8
8
4
nT n
=
2 4
Making this substitution into the answer from part (d) gives
(e) Using Bn =
K=
n = 4 (BnT )
1 8 2 (BnT ) + 16 2 (BnT )
1 + 8 2 (BnT ) + 16 2 (BnT )
C.9
(a) H a (s ) =
k
1
2 2
n
n
s 2 + 2 n s + n2
n2 1 +
n2 C
s 2 + 2 n s + n2
(b)
2 1 z 1
n2 C
=
H a
1
2
T 1 + z 2 1 z 1
2 1 z 1
+ n2
+ 2 n
1
1
T 1+ z
T 1+ z
n2 C
(z 2 + z 1 + 1)
1 2 n + n2
=
n2 1
1 + 2 n + n2
1
+
z 2 + 2
z
1 2 n + n2
1 2 n + n2
K p K0
(c) H d ( z ) =
z 2 +
K 2 K p K 0 K1
K p K0 K2 1
K 2 K p K 0 K1
z 1 1 K 1 z 1
z 1 +
1
K 2 K p K 0 K1
(d)
K p K0 K2 1
K 2 K p K 0 K1
2 n2 1
1 2 n + n2
1 2 n + n2
K 2 K p K 0 K1 =
1 + 2 n + n2
K1 = 1
4 n2
1
K p K 0 1 + 2 n + n2
1 2 n 3 n2
K2 = K p K0 +
1 + 2 n + n2
Page 14, Second new paragraph, The same power/bandwidth exists with digitally modulated
carriers. should read, The same power/bandwidth trade off exists with digitally modulated
carriers.
Chapter 2
Page 27, The sentence after Equation (2.14) should read
An energy signal is a signal with finite nonzero energy whereas a power signal is
a signal with finite nonzero power.
Page 28, Equation (2.19) should read
Page 41, second line of text, complex plain should be complex plane
Page 50, Equations (2.57) and (2.58) should read
Page 65, the third paragraph of Section 2.6.2. The two occurrences of
should be
should be
Page 76, Exercise 2.27, the line after the equation should read
where the integral on the left is the power contained in the interval
Page 83, Exercise 2.46, the plot for
should be
should be
Page 86: The figure at the top of the page (Exercise 2.50) should be
Page 87, The figure at the top of the page (Exercise 2.51) should be
Page 98, Exercise 2.69 should begin Consider an LTI system with input
Page 99, Exercise 2.70 should begin Consider an LTI system with input
Page 99, the figure of Exercise 2.71 should be
should be
should be
should be
Page 138, second line Figure 3.3.8 requires three multipliers, should read Figure
3.3.8 requires four multipliers,
and scale by
to produce a discrete-time
Page 175, Exercise 3.37, The last sentence should read Show that for small
approximately
.
, the DTFT is
Chapter 4
Page 195, Equation (4.45) should be
Page 198, Equation (4.52): should be boldface so that Equation (4.52) reads as follows:
Page 198, Equation (4.54): should be boldface so that Equation (4.54) reads as follows:
Page 198, Equation (4.55): AMA should be boldface so that Equation (4.55) reads as follows:
should be
should be
should be
Page 212, Exercise 4.26: the impulse response should be written as follows:
Page 213, Exercise 4.28: the impulse response should be written as follows:
Chapter 5
Page 225, Equation (5.17) should read
Page 234, Four lines below equation (5.40), ADC should be DAC.
Page 239, Equation (5.53) should be
0
+1.00
0.95
+1
1
1
+1.02
+1.02
+1
+1
2
0.97
+0.98
1
+1
3
0.97
1.00
1
1
Page 273, the sentence just above Equation (5.107) should read, Using Bayes rule,
Page 286, The constellation plot in Exercise 5.17 should be
(c) Repeat part (a) for a pulse shape with 25% excess bandwidth and
(d) Compare and contrast the eye diagrams from parts (a) (c).
Page 292, Exercise 5.34 should read
Consider a 4-ary PAM system using the SRRC pulse shape.
(a) Produce an eye diagram corresponding to 200 randomly generated symbols for
a pulse shape with 100% excess bandwidth and
. Use a sampling rate
equivalent to 16 samples/symbol.
(b) Repeat part (a) for a pulse shape with 50% excess bandwidth and
(c) Repeat part (a) for a pulse shape with 25% excess bandwidth and
.
.
(d) Compare and contrast the eye diagrams from parts (a) (c).
Page 300, The figure for Exercise 5.46 should be
Page 301, The first line after the figure should read the average energy is 1.215 J
Chapter 6
Page 306, Equation (6.2) should be
Page 313, The legend of Figure 6.1.3 is incorrect. Figure 6.1.3 should be as follows:
Page 325, the sentence just above Equation (6.87) should read, The union bound for the
conditional probabilities are
Page 343, Footnote 5. The last line should read utility of these added features.
Chapter 7
Page 424, Exercise 7.7: (7.45) should be (7.44).
Chapter 8
Page 445, Equation (8.20) should be as follows:
Page 488, In the caption of Figure 8.4.26, Figure 8.4.26 should be Figure 8.4.25.
Page 471, The lower diagram of Figure 8.4.16 should be
Page 507, The exponential term of the first line of equation (8.131) should be
Pages 517-518, Exercises 8.12-8.15 and 8.18 should be deleted. The remaining exercises should
be renumbered in the obvious way.
Chapter 9
Page 560, the first line under Figure 9.3.3. Equation (9.60) should be (9.59).
Page 560, the first new paragraph the text a filters transfer frequency response should
be a filters transfer function
Page 562: Equation (9.61) should be
(degrees)
45.00
26.57
14.04
7.13
3.58
1.79
0.90
0.45
(degrees)
45.00
71.57
57.53
50.40
46.83
48.62
49.51
49.96
(degrees)
+50.00
+5.00
-21.57
-7.53
-0.40
+3.17
+1.38
+0.49
+1
+1
-1
-1
-1
+1
+1
+1
+1.00
+1.00
+0.50
+0.88
+1.05
+1.13
+1.09
+1.07
+0.00
+1.00
+1.50
+1.38
+1.27
+1.20
+1.24
+1.25
80
70
angles (degrees)
n1 n
n=0
60
50
40
30
20
10
0
3
4
iteration index (k)
Page 596: The first word of the second sentence of the third new paragraph on the page (10 lines
from the bottom of the page) should be CoRDiC.
Page 602: The first equation of Exercise 9.25 should be
Chapter 10
Page 660: Figure 10.2.18 should be
Page 663: The matrix equation for Exercise 10.3 (a) should be
Page 664: The second line of Exercise 10.6 should reference Figure 10.1.2 (d).
Page 665: Exercise 10.8 should read
The QAM modulator of Exercise 10.6 was derived from the QAM modulator of Figure
10.1.2 (d) by using polyphase partitions of
and
. The QAM modulator of
Exercise 10.7 was derived from the QAM modulator of Figure 10.1.4 by using a
polyphase partition of
. Show that the filterbanks in these two modulators are
exactly identical.
Page 668: The second line of Exercise 10.20 should begin consists of 124 channels
Page 669: The second line of Exercise 10.22 should begin consists of 124 channels
Page 669, Exercise 10.26: the last sentence above the figure should read
Assume
and
in terms of
, and
Appendix A
Page 677, Equation (A.9) should read
Appendix B
Page 715, The equation below the first line of Exercise B.18 should be
Page 715, The equation below the first line of Exercise B.18 (b) should be
Bibliography
Page 752. Ref. 23 should be
T. Cover and J. Thomas, Elements of Information Theory, John Wiley & Sons, New York, 1991.
Page 758: Ref.182 should be
C. Dick and f. harris, On the structure, performance, and applications of recursive all-pass
filters with adjustable and linear group delay, Proceedings of the IEEE International
Conference on Acoustics, Speech, and Signal Processing, Orlando, FL, May 14-17, 2002, pp.
1517-1520.