Chapter 7

7.1
Since x(n) is real, the real part of the DFT is even, imaginary part odd. Thus, the remaining
points are {0.125 +j0.0518, 0, 0.125 +j0.3018}
7.2
(a)
x
2
(l) = x
2
(l), 0 l N 1
= x
2
(l +N), (N 1) l 1
x
2
(l) = sin(
3
8
l), 0 l 7
= sin(
3
8
(l + 8)), 7 l 1
= sin(
3
8
|l|), |l| 7
Therefore, x
1
(n) 8 x
2
(n) =
3

m=0
x
2
(n m)
= sin(
3
8
|n|) +sin(
3
8
|n 1|) +. . . +sin(
3
8
|n 3|)
= {1.25, 2.55, 2.55, 1.25, 0.25, 1.06, 1.06, 0.25}
(b)
x
2
(n) = cos(
3
8
n), 0 l 7
= cos(
3
8
n), 7 l 1
= [2u(n) 1] cos(
3
8
n), |n| 7
Therefore, x
1
(n) 8 x
2
(n) =
3

m=0
_
1
4
_
m
x
2
(n m)
= {0.96, 0.62, 0.55, 1.06, 0.26, 0.86, 0.92, 0.15}
(c)
for (a) X
1
(k) =
7

n=0
x
1
(n)e
j

4
kn
219
2007 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. This material is protected under all copyright laws
as they currently exist. No portion of this material may be reproduced, in any form or by any means, without permission in
writing from the publisher. For the exclusive use of adopters of the book Digital Signal Processing, Fourth Edition, by John G.
Proakis and Dimitris G. Manolakis. ISBN 0-13-187374-1.
= {4, 1 j2.4142, 0, 1 j0.4142, 0, 1 +j0.4142, 0, 1 +j2.4142}
similarly,
X
2
(k) = {1.4966, 2.8478, 2.4142, 0.8478, 0.6682, 0.8478,
2.4142, 2.8478}
DFT of x
1
(n) 8 x
2
(n) = X
1
(k)X
2
(k)
= {5.9864, 2.8478 j6.8751, 0, 0.8478 +j0.3512, 0,
0.8478 j0.3512, 0, 2.8478 +j6.8751}
For sequences of part (b)
X
1
(k) = {1.3333, 1.1612 j0.2493, 0.9412 j0.2353, 0.8310 j0.1248,
0.8, 0.8310 +j0.1248, 0.9412 +j0.2353, 1.1612 +j0.2493}
X
2
(k) = {1.0, 1.0 +j2.1796, 1.0 j2.6131, 1.0 j0.6488, 1.0,
1.0 +j0.6488, 1.0 +j2.6131, 1.0 j2.1796}
Consequently,
DFT of x
1
(n) 8 x
2
(n) = X
1
(k)X
2
(k)
= {1.3333, 1.7046 +j2.2815, 0.3263 j2.6947, 0.75 j0.664, 0.8,
0.75 +j0.664, 0.3263 +j2.6947, 1.7046 j2.2815}
7.3
x(k) may be viewed as the product of X(k) with
F(k) =
_
1, 0 k k
c
, N k
c
k N 1
0, k
c
< k < N k
c
F(k) represents an ideal lowpass lter removing frequency components from (k
c
+ 1)
2
N
to .
Hence x(n) is a lowpass version of x(n).
7.4
(a)
x
1
(n) =
1
2
_
e
j
2
N
n
+e
j
2
N
n
_
X
1
(k) =
N
2
[(k 1) +(k + 1)]
also X
2
(k) =
N
2j
[(k 1) (k + 1)]
So X
3
(k) = X
1
(k)X
2
(k)
=
N
2
4j
[(k 1) (k + 1)]
and x
3
(n) =
N
2
sin(
2
N
n)
(b)

R
xy
(k) = X
1
(k)X

2
(k)
=
N
2
4j
[(k 1) (k + 1)]
r
xy
(n) =
N
2
sin(
2
N
n)
220
2007 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. This material is protected under all copyright laws
as they currently exist. No portion of this material may be reproduced, in any form or by any means, without permission in
writing from the publisher. For the exclusive use of adopters of the book Digital Signal Processing, Fourth Edition, by John G.
Proakis and Dimitris G. Manolakis. ISBN 0-13-187374-1.
(c)

R
xx
(k) = X
1
(k)X

1
(k)
=
N
2
4
[(k 1) +(k + 1)]
r
xx
(n) =
N
2
cos(
2
N
n)
(d)

R
yy
(k) = X
2
(k)X

2
(k)
=
N
2
4
[(k 1) +(k + 1)]
r
yy
(n) =
N
2
cos(
2
N
n)
7.5
(a)
N1

n=0
x
1
(n)x

2
(n) =
1
4
N1

n=0
_
e
j
2
N
n
+e
j
2
N
n
_
2
=
1
4
N1

n=0
_
e
j
4
N
n
+e
j
4
N
n
+ 2
_
=
1
4
2N
=
N
2
(b)
N1

n=0
x
1
(n)x

2
(n) =
1
4j
N1

n=0
_
e
j
2
N
n
+e
j
2
N
n
__
e
j
2
N
n
e
j
2
N
n
_
=
1
4j
N1

n=0
_
e
j
4
N
n
e
j
4
N
n
_
= 0
(c)

N1
n=0
x
1
(n)x

2
(n) = 1 + 1 = 2
7.6
w(n) = 0.42 0.25
_
e
j
2
N1
n
+e
j
2
N1
n
_
+ 0.04
_
e
j
4
N1
n
+e
j
4
N1
n
_
w(k) = 0.42
N1

n=0
e
j
2
N
nk
0.25
_
N1

n=0
e
j
2
N1
n
e
j
2
N
nk
+
N1

n=0
e
j
2
N1
n
e
j
2
N
nk
_
+0.04
_
N1

n=0
e
j
4
N1
n
e
j
2
N
nk
+
N1

n=0
e
j
4
N1
n
e
j
2
N
nk
_
221
2007 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. This material is protected under all copyright laws
as they currently exist. No portion of this material may be reproduced, in any form or by any means, without permission in
writing from the publisher. For the exclusive use of adopters of the book Digital Signal Processing, Fourth Edition, by John G.
Proakis and Dimitris G. Manolakis. ISBN 0-13-187374-1.
= 0.42N(k)
0.25
_
1 e
j2[
N
N1
k]
1 e
j2[
1
N1

k
N
]
+
1 e
j2[
N
N1
+k]
1 e
j2[
1
N1
+
k
N
]
_
+0.04
_
1 e
j2[
2N
N1
k]
1 e
j2[
2
N1

k
N
]
+
1 e
j2[
2N
N1
+k]
1 e
j2[
2
N1
+
k
N
]
_
= 0.42N(k)
0.25
_
1 cos(
2N
N1
) cos(2(
1
N1
+
k
N
)) +cos(
2k
N
)
1 cos(2(
1
N1
+
k
N
))
_
+0.04
_
1 cos(
4N
N1
) cos(2(
2
N1
+
k
N
)) +cos(
2k
N
)
1 cos(2(
2
N1
+
k
N
))
_
7.7
X
c
(k) =
N1

n=0
1
2
x(n)
_
e
j
2k
0
n
N
+e
j
2k
0
n
N
_
e

2kn
N
=
1
2
N1

n=0
x(n)e
j
2(kk
0
)n
N
+
1
2
N1

n=0
x(n)e
j
2(k+k
0
)n
N
=
1
2
X(k k
0
)
modN
+
1
2
X(k +k
0
)
modN
similarly, X
s
(k) =
1
2j
X(k k
0
)
modN

1
2j
X(k +k
0
)
modN
7.8
y(n) = x
1
(n) 4 x
2
(n)
=
3

m=0
x
1
(m)
mod4
x
2
(n m)
mod4
= {17, 19, 22, 19}
7.9
X
1
(k) = {7, 2 j, 1, 2 +j}
X
2
(k) = {11, 2 j, 1, 2 +j}
X
3
(k) = X
1
(k)X
2
(k)
= {17, 19, 22, 19}
222
2007 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. This material is protected under all copyright laws
as they currently exist. No portion of this material may be reproduced, in any form or by any means, without permission in
writing from the publisher. For the exclusive use of adopters of the book Digital Signal Processing, Fourth Edition, by John G.
Proakis and Dimitris G. Manolakis. ISBN 0-13-187374-1.
7.10
x(n) =
1
2
_
e
j
2kn
N
+e
j
2kn
N
_
x(n)x

(n) =
1
4
_
2 +e
j
4kn
N
+e
j
4kn
N
_
E =
N1

n=0
x(n)x

(n)
=
1
4
N1

n=0
_
2 +e
j
4kn
N
+e
j
4kn
N
_
=
1
4
2N
=
N
2
7.11
(a)
x
1
(n) = x(n 5)
mod8
X
1
(k) = X(k)e
j
25k
8
= X(k)e
j
5k
4
(b)
x
2
(n) = x(n 2)
mod8
X
2
(k) = X(k)e
j
22k
8
= X(k)e
j
k
2
7.12
(a)
s(k) = W
k
2
X(k)
= (1)
k
X(k)
s(n) =
1
6
5

k=0
(1)
k
X(k)W
kn
N
N = 6
=
1
6
5

k=0
X(k)W
k(n3)
N
= x(n 3)
mod6
s(n) = {3, 4, 0, 0, 1, 2}
(b)
y(n) = IDFT
_
X(k) +X

(k)
2
_
223
2007 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. This material is protected under all copyright laws
as they currently exist. No portion of this material may be reproduced, in any form or by any means, without permission in
writing from the publisher. For the exclusive use of adopters of the book Digital Signal Processing, Fourth Edition, by John G.
Proakis and Dimitris G. Manolakis. ISBN 0-13-187374-1.
=
1
2
[IDFT{X(k)} + IDFT{X

(k)}]
=
1
2
_
x(n) +x

(n)
modN

=
_
x(0),
x(1) +x(5)
2
,
x(2) +x(4)
2
, x(3),
x(4) +x(2)
2
,
x(5) +x(1)
2
_
=
_
0,
1
2
, 3, 3, 3,
1
2
_
(c)
v(n) = IDFT
_
X(k) X

(k)
2j
_
By similar means to (b)
v(n) =
_
0,
1
2
j, j, 0, j,
1
2
j
_
7.13
(a)
X
1
(k) =
N1

n=0
x(n)W
kn
N
X
3
(k) =
3N1

n=0
x(n)W
kn
3N
=
N1

n=0
x(n)W
kn
3N
+
2N1

n=N
x(n)W
kn
3N
+
3N1

n=2N
x(n)W
kn
3N
=
N1

n=0
x(n)W
n
k
3
N
+
N1

n=0
x(n)W
k
3
W
n
k
3
N
+
N1

n=0
x(n)W
2k
3
W
n
k
3
N
=
N1

n=0
x(n)
_
1 +W
k
3
+W
2k
3

W
n
k
3
N
= (1 +W
k
3
+W
2k
3
)X
1
(k)
(b)
X
1
(k) = 2 +W
k
2
X
3
(k) = 2 +W
k
6
+ 2W
2k
6
+W
3k
6
+ 2W
4k
6
+W
5k
6
= (2 +W
k
3
2
) +W
2k
6
(2 +W
k
3
2
) +W
4k
6
(2 +W
k
3
2
)
= (1 +W
k
3
+W
2k
3
)X
1
(
k
3
)
7.14
(a)
y(n) = x
1
(n) 5 x
2
(n)
= {4, 0, 1, 2, 3}
224
2007 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. This material is protected under all copyright laws
as they currently exist. No portion of this material may be reproduced, in any form or by any means, without permission in
writing from the publisher. For the exclusive use of adopters of the book Digital Signal Processing, Fourth Edition, by John G.
Proakis and Dimitris G. Manolakis. ISBN 0-13-187374-1.
(b) Let x
3
(n) = {x
0
, x
1
, . . . , x
4
}. Then,
_

_
0 4 3 2 1
1 0 4 3 2
2 1 0 4 3
3 2 1 0 4
4 3 2 1 0
_

_
_

_
x
0
x
1
x
2
x
3
x
4
_

_
=
_

_
1
0
0
0
0
_

_
Solving yields sequence
x
3
(n) =
_
0.18

, 0.22, 0.02, 0.02, 0.02

_
.
7.15
Dene H
1
(z)

= H
1
(z) and corresponding time signal h
1
(n). The use of 64-pt DFTs of y(n)
and h
1
(n) yields x(n) = y(n) 64 h
1
(n) whereas x(n) requires linear convolution. However we
can simply recognize that
X(z) = Y (z)H
1
(z)
= Y (z) 0.5Y (z)z
1
so x(n) = y(n) 0.5y(n 1), 0 n 63
with y(1)

= 0
7.16
H(k) =
N1

n=0
h(n)e
j
2
N
kn
= 1 + (
1
4
)e
j
2
4k
0
k
0
k
= 1
1
4
e
j

2
k
G(k) =
1
H(k)
=
1
1
1
4
e
j
2
N
k
= 1 +
_
1
4
e
j

2
k
_
+
_
1
4
e
j

2
k
_
2
+. . .
=
_
4
3
,
16 4j
17
,
4
5
,
16 + 4j
17
, repeat k
0
times
_
g(n) =
1
N
N1

n=0
G(k)e
j
2
N
kn
=
1
4k
0
[
4k
0
4

k=0,4,...
4
3
e
j
2
4k
0
kn
+
4k
0
3

k=1,5,...
_
16 4j
17
_
e
j
2
4k
0
kn
225
2007 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. This material is protected under all copyright laws
as they currently exist. No portion of this material may be reproduced, in any form or by any means, without permission in
writing from the publisher. For the exclusive use of adopters of the book Digital Signal Processing, Fourth Edition, by John G.
Proakis and Dimitris G. Manolakis. ISBN 0-13-187374-1.
+
4k
0
2

k=2,6,...
4
5
e
j
2
4k
0
kn
+
4k
0
1

k=3,7,...
_
16 + 4j
17
_
e
j
2
4k
0
kn
]
=
1
4k
0
__
4
3

_
+
__
16 4j
17
_
e
j
2
4k
0
n

_
+
_
4
5
e
j
2
4k
0
2n

_
+
__
16 + 4j
17
_
e
j
2
4k
0
3n

__
where

=
k
0
1

i=0
e
j
2
k
0
ni
But

= 1, yielding
g(0) =
1
4
_
4
3
+
_
16 4j
17
_
+
4
5
+
_
16 + 4j
17
__
=
256
255
g(k
0
) =
1
4
_
4
3
+j
_
16 4j
17
_

4
5
j
_
16 + 4j
17
__
=
64
255
g(2k
0
) =
1
4
_
4
3

_
16 4j
17
_
+
4
5

_
16 + 4j
17
__
=
16
255
g(3k
0
) =
1
4
_
4
3
j
_
16 4j
17
_

4
5
+j
_
16 + 4j
17
__
=
4
255
and g(n) = 0 for other n in [0, 4k
0
) .
Therefore, g(n) h(n) =
_

_
256
255
, 0, 0, . . . , 0

k
0
, . . . , 0

2k
0
, . . . , 0

3k
0
, . . . ,
1
255

4k
0
, 0
_

_
g(.) represents a close approximation to an inverse system, but not an exact one.
7.17
X(k) =
7

n=0
x(n)e
j
2
8
kn
= {6, 0.7071 j1.7071, 1 j, 0.7071 +j0.2929, 0, 0.7071 j0.2929, 1 +j,
0.7071 +j1.7071}
|X(k)| = {6, 1.8478, 1.4142, 0.7654, 0, 0.7654, 1.4142, 1.8478}

X(k) =
_
0, 1.9635,

4
, 0.3927, 0, 0.3927,

4
, 1.9635
_
226
2007 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. This material is protected under all copyright laws
as they currently exist. No portion of this material may be reproduced, in any form or by any means, without permission in
writing from the publisher. For the exclusive use of adopters of the book Digital Signal Processing, Fourth Edition, by John G.
Proakis and Dimitris G. Manolakis. ISBN 0-13-187374-1.
7.18
x(n) =

i=
(n iN)
y(n) =

m
h(m)x(n m)
=

m
h(m)
_

i
(n miN)
_
=

i
h(n iN)
Therefore, y(.) is a periodic sequence with period N. So
Y (k) =
N1

n=0
y(n)W
kn
N
= H(w)|
w=
2
N
k
Y (k) = H(
2k
N
) k = 0, 1, . . . , N 1
7.19
Call the two real even sequences x
e1
(.) and x
e2
(.), and the odd ones x
o1
(.) and x
o2
(.) (a)
Let x
c
(n) = [x
e1
(n) +x
o1
(n)] +j [x
e2
(n) +x
o2
(n)]
Then, X
c
(k) = DFT{x
e1
(n)} + DFT{x
o1
(n)} +jDFT{x
e2
(n)} +jDFT{x
o2
(n)}
= [X
e1
(k) +X
o1
(k)] +j [X
e2
(k) +X
o2
(k)]
where X
e1
(k) =
Re[X
c
(k)] + Re[X
c
(k)]
2
X
o1
(k) =
Re[X
c
(k)] Re[X
c
(k)]
2
X
e2
(k) =
Im[X
c
(k)] + Im[X
c
(k)]
2
X
o2
(k) =
Im[X
c
(k)] Im[X
c
(k)]
2
(b)
s
i
(0) = x
i
(1) x
i
(N 1) = 0
s
i
(N n) = x
i
(N n + 1) +x
i
(N n 1)
= x
i
(n + 1) x
i
(n 1)
= s
i
(n)
(c)
x(n) = [x
1
(n) +s
3
(n)] +j [x
2
(n) +s
4
(n)]
The DFT of the four sequences can be computed using the results of part (a)
For i = 3, 4, s
i
(k) =
N1

n=0
s
i
(n)W
kn
N
227
2007 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. This material is protected under all copyright laws
as they currently exist. No portion of this material may be reproduced, in any form or by any means, without permission in
writing from the publisher. For the exclusive use of adopters of the book Digital Signal Processing, Fourth Edition, by John G.
Proakis and Dimitris G. Manolakis. ISBN 0-13-187374-1.
=
N1

n=0
[x
i
(n + 1) x
i
(n 1)] W
kn
N
= W
k
N
X
i
(k) W
k
N
X
i
(k)
= 2jsin(
2
N
k)X
i
(k)
Therefore, X
3
(k) =
s
3
(k)
2jsin(
2
N
k)
X
4
(k) =
s
4
(k)
2jsin(
2
N
k)
(d) X
3
(0) and X
4
(0), because sin(
2
N
k) = 0.
7.20
X(k) =
N1

n=0
x(n)W
kn
N
=
N
2
1

n=0
x(n)W
kn
N
+
N
2
1

n=0
x(n +
N
2
)W
k(n+
N
2
)
N
=
N
2
1

n=0
_
x(n) x(n)W
k
2

W
kn
N
If k is even, W
k
2
= 1, and X(k) = 0
(b) If k is odd, W
k
2
= 1, Therefore,
X(k) =
N
2
1

n=0
2x(n)W
kn
N
= 2
N
2
1

n=0
x(n)W
n
k
2
N
2
For k = 2l + 1, l = 0, . . . ,
N
2
1
X(2l + 1) = 2
N
2
1

n=0
x(n)W
ln
N
2
W
n
N
=
N
2
pt DFT of sequence 2x(n)W
n
N
7.21
(a) F
s
F
N
= 2B = 6000 samples/sec
(b)
T =
1
F
s
=
1
6000
228
2007 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. This material is protected under all copyright laws
as they currently exist. No portion of this material may be reproduced, in any form or by any means, without permission in
writing from the publisher. For the exclusive use of adopters of the book Digital Signal Processing, Fourth Edition, by John G.
Proakis and Dimitris G. Manolakis. ISBN 0-13-187374-1.
1
LT
50
L
1
50T
=
6000
50
= 120 samples
(c) LT =
1
6000
120 = 0.02 seconds.
7.22
x(n) =
1
2
e
j
2
N
n
+
1
2
e
j
2
N
n
, 0 n N, N = 10
X(k) =
N1

n=0
x(n)e
j
2
N
kn
=
N1

n=0
1
2
e
j
2
N
(k1)n
+
N1

n=0
1
2
e
j
2
N
(k+1)n
= 5(k 1) + 5(k 9), 0 k 9
7.23
(a) X(k) =

N1
n=0
(n)e
j
2
N
kn
= 1, 0 k N 1
(b)
X(k) =
N1

n=0
(n n
0
)e
j
2
N
kn
= e
j
2
N
kn
0
, 0 k N 1
(c)
X(k) =
N1

n=0
a
n
e
j
2
N
kn
=
N1

n=0
(ae
j
2
N
k
)
n
=
1 a
N
1 ae
j
2
N
k
(d)
X(k) =
N
2
1

n=0
e
j
2
N
kn
=
1 e
j
2
N
N
2
k
1 e
j
2
N
k
=
1 (1)
k
1 e
j
2
N
k
229
2007 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. This material is protected under all copyright laws
as they currently exist. No portion of this material may be reproduced, in any form or by any means, without permission in
writing from the publisher. For the exclusive use of adopters of the book Digital Signal Processing, Fourth Edition, by John G.
Proakis and Dimitris G. Manolakis. ISBN 0-13-187374-1.
(e)
X(k) =
N1

n=0
e
j
2
N
nk
0
e
j
2
N
kn
=
N1

n=0
e
j
2
N
(kk
0
)n
= N(k k
0
)
(f)
x(n) =
1
2
e
j
2
N
nk
0
+
1
2
e
j
2
N
nk
0
From (e) we obtain X(k) =
N
2
[(k k
0
) +(k N +k
0
)]
(g)
x(n) =
1
2j
e
j
2
N
nk
0

1
2j
e
j
2
N
nk
0
Hence X(k) =
N
2j
[(k k
0
) (k N +k
0
)]
(h)
X(k) =
N1

n=0
x(n)e
j
2
N
nk
( assume N odd )
= 1 +e
j
2
N
2k
+e
j
2
N
4k
+. . . +e
j
2
N
(n1)k
=
1 (e
j
2
N
2k
)
N+1
2
1 e
j
2
N
2k
=
1 e
j
2
N
k
1 e
j
4
N
k
=
1
1 e
j
2
N
k
7.24
(a)
x(n) =
1
N
N1

k=0
X(k)e
j
2
N
nk

N1

k=0
X(k)e
j
2
N
nk
= Nx(n)
X(0) +X(1) +X(2) +X(3) = 4
X(0) +X(1)e
j

2
+X(2)e
j
+X(3)e
j
3
2
= 8
X(0) +X(1)e
j
+X(2)e
j2
+X(3)e
j3
= 12
X(0) +X(1)e
j
3
2
+X(2)e
j3
+X(3)e
j
9
2
= 4
_

_
1 1 1 1
1 j 1 j
1 1 1 1
1 j 1 j
_

_
_

_
X(0)
X(1)
X(2)
X(3)
_

_
=
_

_
4
8
12
4
_

_
X(0)
X(1)
X(2)
X(3)
_

_
=
_

_
7
2 j
1
2 +j
_

_
230
2007 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. This material is protected under all copyright laws
as they currently exist. No portion of this material may be reproduced, in any form or by any means, without permission in
writing from the publisher. For the exclusive use of adopters of the book Digital Signal Processing, Fourth Edition, by John G.
Proakis and Dimitris G. Manolakis. ISBN 0-13-187374-1.
(b)
X(k) =
3

n=0
x(n)e
j
2
4
nk
X(0) =
3

n=0
x(n)
= 7
X(1) =
3

n=0
x(n)e
j

2
n
= 2 j
X(2) =
3

n=0
x(n)e
jn
= 1
X(3) =
3

n=0
x(n)e
j
3
2
n
= 2 +j
7.25
(a)
X(w) =

n=
x(n)e
jwn
= e
j2w
+ 2e
jw
+ 3 + 2e
jw
+e
j2w
= 3 + 2cos(2w) + 4cos(4w)
(b)
V (k) =
5

n=0
v(n)e
j
2
6
nk
= 3 + 2e
j
2
6
k
+e
j
2
6
2k
+ 0 +e
j
2
6
4k
+e
j
2
6
5k
= 3 + 4cos(

3
k) + 2cos(
2
3
k)
(c) V (k) = X(w)|
w=
2k
6
=
k
3
This is apparent from the fact that v(n) is one period (0 n 7) of a periodic sequence
obtained by repeating x(n).
7.26
Let x(n) =

l=
(n +lN)
Hence, x(n) is periodic with period N, i.e.
x(n) = 1, n = 0, N, 2N, . . .
231
2007 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. This material is protected under all copyright laws
as they currently exist. No portion of this material may be reproduced, in any form or by any means, without permission in
writing from the publisher. For the exclusive use of adopters of the book Digital Signal Processing, Fourth Edition, by John G.
Proakis and Dimitris G. Manolakis. ISBN 0-13-187374-1.
= 0, otherwise
Then X(k) =
N1

n=0
x(n)e
j
2
N
nk
= 1, 0 k N 1
and x(n) =
1
N
N1

k=0
X(k)e
j
2
N
nk
Hence,

l=
(n +lN) =
1
N
N1

k=0
e
j
2
N
nk
7.27
(a)
Y (k) =
M1

n=0
y(n)W
kn
M
=
M1

n=0

l
x(n +lM)W
kn
M
Now X(w) =

n
x(n)e
jwn
,
so X(
2
M
k) =

n
W
kn
M
=
M1

n=0

l
x(n +lM)W
k(n+lM)
M
=
M1

n=0

l
x(n +lM)W
kn
M
= Y (k)
Therefore, Y (k) = X(w)|
w=
2
M
k
(b)
Y (k) = X(w)|
w=
2
N
2
k
Y (
k
2
) = X(w)|
w=
2
N
k
= X(k), k = 2, 4, . . . , N 2
(c)
X
1
(k) = X(k + 1)
x
1
(n) = x(n)e
j
2
N
n
= x(n)W
n
N
Let y(n) = x
1
(n) +x
1
(n +
N
2
), 0 n N 1
= 0, elsewhere
Then X(k + 1) = X
1
(k)
= Y (
k
2
), k = 0, 2, . . . , N 2
232
2007 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. This material is protected under all copyright laws
as they currently exist. No portion of this material may be reproduced, in any form or by any means, without permission in
writing from the publisher. For the exclusive use of adopters of the book Digital Signal Processing, Fourth Edition, by John G.
Proakis and Dimitris G. Manolakis. ISBN 0-13-187374-1.
where Y (k) is the
N
2
-pt DFT of y(n)
7.28
(a) Refer to g 7.28-1.
(b)
0 10 20 30
0
0.2
0.4
0.6
0.8
1
> n

>

x
(
n
)
x(n)
0 1 2 3 4
5
0
5
10
15
20
> w

>

X
(
w
)
X(w)
0 10 20 30
0.2
0
0.2
0.4
0.6
ck
0 10 20 30
0
0.5
1
> n

>

x
t
i
l
d
e
(
n
)
xtilde(n)
Figure 7.28-1:

n=
x(n)e
jwn
=

n=
a
|n|
e
jwn
= a +
1

L
a
n
e
jwn
+
L

1
a
n
e
jwn
= a +
L

1
a
n
e
jwn
+
L

1
a
n
e
jwn
= a + 2
L

n=1
a
n
cos(wn)
= x(0) + 2
L

n=1
x(n)cos(wn)
(c) Refer to g 7.28-1.
(d) Refer to g 7.28-1.
233
2007 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. This material is protected under all copyright laws
as they currently exist. No portion of this material may be reproduced, in any form or by any means, without permission in
writing from the publisher. For the exclusive use of adopters of the book Digital Signal Processing, Fourth Edition, by John G.
Proakis and Dimitris G. Manolakis. ISBN 0-13-187374-1.
(e) Refer to g 7.28-2.
(f) N=15. Refer to g 7.28-3.
0 50 100 150 200 250
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
> n

>

x
(
n
)
x(n)
Figure 7.28-2:
234
2007 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. This material is protected under all copyright laws
as they currently exist. No portion of this material may be reproduced, in any form or by any means, without permission in
writing from the publisher. For the exclusive use of adopters of the book Digital Signal Processing, Fourth Edition, by John G.
Proakis and Dimitris G. Manolakis. ISBN 0-13-187374-1.
20 10 0 10 20
0
0.2
0.4
0.6
0.8
1
> n

>

x
(
n
)
x(n)
0 1 2 3 4
5
0
5
10
15
20
> w

>

X
(
w
)
X(w)
0 5 10 15
0.5
0
0.5
1
1.5
> w

>

c
k
ck
10 5 0 5 10
0.6
0.8
1
1.2
1.4
> n

>

x
t
i
l
d
e
(
n
)
xtilde(n)
Figure 7.28-3:
7.29
Refer to g 7.29-1. The time domain aliasing is clearly evident when N=20.
7.30
Refer to g 7.30-1.
(e)
x
am
(n) = x(n)cos(2f
c
n)
X
am
(w) =
N1

n=0
x(n)cos(2f
c
n)e
j2fn
=
1
2
N1

n=0
x(n)
_
e
j2(ff
c
)n
+e
j2(f+f
c
)n
_
X
am
(w) =
1
2
[X(w w
c
) +X(w +w
c
)]
7.31
(a) c
k
= {
2

,
1

,
2
3
,
1
2
. . .}
(b) Refer to g 7.31-1. The DFT of x(n) with N = 128 has a better resolution compared to one
with N = 64.
235
2007 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. This material is protected under all copyright laws
as they currently exist. No portion of this material may be reproduced, in any form or by any means, without permission in
writing from the publisher. For the exclusive use of adopters of the book Digital Signal Processing, Fourth Edition, by John G.
Proakis and Dimitris G. Manolakis. ISBN 0-13-187374-1.
0 2 4 6 8
0
5
10
X(w)

>

m
a
g
0 1000 2000 3000
0
0.5
1
1.5
x(n)

>

x
(
n
)
0 2 4 6 8
0
5
10
X(w) with N=20

>

m
a
g
0 10 20 30
0
0.5
1
1.5
x(n) with N=20

>

x
(
n
)
0 2 4 6 8
0
5
10
X(w) with N=100
> w

>

m
a
g
0 50 100 150
0
0.5
1
1.5
x(n) with N=100
> n

>

x
(
n
)
Figure 7.29-1:
7.32
(a)
Y (j) =
1
2
P(j) X(j)
=
1
2
_
T
0
sin(
T
0
2
)e
j
T
0
2
_
[2(
0
)]
where sincx

=
sin x
x
Y (j) = T
0
sinc
_
T
0
(
0
)
2
_
e
j
T
0
(
0
)
2
(b) w
0
P = 2k for an integer k, or w
0
=
2k
P

(c)
Y (w) =
N1

n=0
e
jw
0
n
e
jwn
236
2007 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. This material is protected under all copyright laws
as they currently exist. No portion of this material may be reproduced, in any form or by any means, without permission in
writing from the publisher. For the exclusive use of adopters of the book Digital Signal Processing, Fourth Edition, by John G.
Proakis and Dimitris G. Manolakis. ISBN 0-13-187374-1.
0 100 200 300
2
0
2
x
(
n
)
x(n)
0 100 200 300
1
0
1
x
c
(
n
)
xc(n)
0 100 200 300
2
0
2
x
a
m
(
n
)
xam(n)
0 50 100 150
0
20
40
m
a
g
Xam(w) with N=128
0 50 100 150
0
10
20
30
m
a
g
Xam(w) with N=100
0 100 200 300
0
20
40
60
m
a
g
Xam(w) with N=180
Figure 7.30-1:
=
sin
N
2
(w w
0
)
sin
ww
0
2
e
j
N1
2
(ww
0
)
Larger N narrower main lobe of |Y (w)|. T
0
in Y (j) has the same eect.
(d)
Y (k) = Y (w)|
w=
2
N
k
=
sin(k l)
sin
(kl)
N
e
j
N1
N
(kl)
|Y (k)| =
|sin(k l)|
|sin
(kl)
N
|
= N(k l)
(e) The frequency samples
2
N
k fall on the zeros of Y (w). By increasing the sampling by a factor
of two, for example, we will obtain a frequency sample between the nulls.
Y (w)|
w=
2
2N
k=

N
k, k=0,1,...,2N1
237
2007 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. This material is protected under all copyright laws
as they currently exist. No portion of this material may be reproduced, in any form or by any means, without permission in
writing from the publisher. For the exclusive use of adopters of the book Digital Signal Processing, Fourth Edition, by John G.
Proakis and Dimitris G. Manolakis. ISBN 0-13-187374-1.
0 200 400 600 800
1.5
1
0.5
0
0.5
1
1.5
x(n)
0 20 40 60 80
0
5
10
15
20
DFT of x(n) with N=64
0 50 100 150
0
10
20
30
40
50
60
DFT of x(n) with N=128
Figure 7.31-1:
238
2007 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. This material is protected under all copyright laws
as they currently exist. No portion of this material may be reproduced, in any form or by any means, without permission in
writing from the publisher. For the exclusive use of adopters of the book Digital Signal Processing, Fourth Edition, by John G.
Proakis and Dimitris G. Manolakis. ISBN 0-13-187374-1.