Not for sale.

1



SOLUTIONS MANUAL
to accompany
Digital Signal Processing:
A Computer-Based
Approach
Fourth Edition

Sanjit K. Mitra

Prepared by

Chowdary Adsumilli, John Berger, Marco Carli,
Hsin-Han Ho, Rajeev Gandhi, Martin Gawecki, Chin Kaye Koh,
Luca Lucchese, Mylene Queiroz de Farias, and Travis Smith



Copyright ! 2011 by Sanjit K. Mitra. No part of this publication may
be reproduced or distributed in any form or by any means, or stored in
a database or retrieval system, without the prior written consent of
Sanjit K. Mitra, including, but not limited to, in any network or other
electronic Storage or transmission, or broadcast for distance learning.
Not for sale. 2
Chapter 5

5.1 Given the definition that
!
y [n] = x [r]

h [n " r].
r=0
N"1
#

Then:
!
y [n + kN] = x [r]

h [n + kN " r].
r=0
N"1
#

Since
!

h [n] is periodic in
!
n with a period N:
!

h [n + kN " r] =

h [n " r].
Therefore:
!
y [n + kN]
!
= x [r]

h [n " r] = y [n],
r=0
N"1
#

Hence
!
y [n] is also periodic in
!
n with a period . N

5.2 (a)
!
y [0] = x [r]

h ["r]
r=0
5
#


!
= x [0]

h [0] + x [1]

h [5] + x [2]

h [4] + x [3]

h [3] + x [4]

h [2] + x [5]

h [1]
= 4 " (#1) ( ) + (#3) " 2 ( ) + 2 " 0 ( ) + 0 "1 ( ) + 1" 0 ( ) + 1" 2 ( )
= #4 #6 +0 +0 +0 +2 = #10



!
y [1] = x [r]

h [1" r]
r=0
5
#



!
= x [0]

h [1] + x [1]

h [0] + x [2]

h [5] + x [3]

h [4] + x [4]

h [3] + x [5]

h [2]
= 4 " 2 ( ) + (#3) " (#1) ( ) + 2 " 2 ( ) + 0 " 0 ( ) + 1"1 ( ) + 1" 0 ( )
= 8 + 4 + 4 +1 =17



!
y [2] = x [r]

h [2 " r]
r=0
5
#



!
= x [0]

h [2] + x [1]

h [1] + x [2]

h [0] + x [3]

h [5] + x [4]

h [4] + x [5]

h [3]
= 4 " 0 ( ) + (#3) " 2 ( ) + 2 " (#1) ( ) + 0 " 2 ( ) + 1" 0 ( ) + 1"1 ( )
= 0 #6 #2 +0 +0 +1 = #7



!
y [3] = x [r]

h [3 " r]
r=0
5
#



!
= x [0]

h [3] + x [1]

h [2] + x [2]

h [1] + x [3]

h [0] + x [4]

h [5] + x [5]

h [4]
= 4 "1 ( ) + (#3) " 0 ( ) + 2 " 2 ( ) + 0 " (#1) ( ) + 1" 2 ( ) + 1" 0 ( )
= 4 #0 + 4 +0 +2 +0 =10


Not for sale. 3

!
y [4] = x [r]

h [4 " r]
r=0
5
#



!
= x [0]

h [4] + x [1]

h [3] + x [2]

h [2] + x [3]

h [1] + x [4]

h [0] + x [5]

h [5]
= 4 " 0 ( ) + (#3) "1 ( ) + 2 " 0 ( ) + 0 " 2 ( ) + 1" (#1) ( ) + 1" 2 ( )
= 0 # 3+0 +0 #1+2 = #2



!
y [5] = x [r]

h [5 " r]
r=0
5
#



!
= x [0]

h [5] + x [1]

h [4] + x [2]

h [3] + x [3]

h [2] + x [4]

h [1] + x [5]

h [0]
= 4 " 2 ( ) + (#3) " 0 ( ) + 2 "1 ( ) + 0 " 0 ( ) + 1" 3 ( ) + 1" (#1) ( )
= 8 #0 +2 #0 + 3 #1 =12


Therefore,
!
y [n] ={10, 17, "7, 10, "2, 12}, 0 # n # 5.

(b)
!
y [0] = x [r]

h ["r]
r=0
5
#

!
= x [0]

h [0] + x [1]

h [5] + x [2]

h [4] + x [3]

h [3] + x [4]

h [2] + x [5]

h [1]


!
= 6 "1 ( ) + 9 "1 ( ) + (#4) " 0 ( ) + 1" (#4) ( ) + 2 " 3 ( ) + 3 " (#2) ( )
= 6 +9 # 4 # 4 +6 + #6 = 7



!
y [1] = x [r]

h [1" r]
r=0
5
#



!
= x [0]

h [1] + x [1]

h [0] + x [2]

h [5] + x [3]

h [4] + x [4]

h [3] + x [5]

h [2]


!
= 6 " (#2) ( ) + 9 "1 ( ) + (#4) "1 ( ) + 1" 0 ( ) + 2 " (#4) ( ) + 3 " 3 ( )
= #12 +9 # 4 +0 #8 +9 = #6



!
y [2] = x [r]

h [2 " r]
r=0
5
#



!
= x [0]

h [2] + x [1]

h [1] + x [2]

h [0] + x [3]

h [5] + x [4]

h [4] + x [5]

h [3]


!
= 6 " 3 ( ) + 9 " (#2) ( ) + (#4) "1 ( ) + 1"1 ( ) + 2 " 0 ( ) + 3 " (#4) ( )
=18 #18 # 4 +1#0 #12 = #15



!
y [3] = x [r]

h [3 " r]
r=0
5
#



!
= x [0]

h [3] + x [1]

h [2] + x [2]

h [1] + x [3]

h [0] + x [4]

h [5] + x [5]

h [4]


!
= 6 " (#4) ( ) + 9 " 3 ( ) + (#4) " (#2) ( ) + 1"1 ( ) + 2 "1 ( ) + 3 " 0 ( )
= #24 +27 +8 +1+2 #0 = #15


Not for sale. 4

!
y [4] = x [r]

h [4 " r]
r=0
5
#



!
= x [0]

h [4] + x [1]

h [3] + x [2]

h [2] + x [3]

h [1] + x [4]

h [0] + x [5]

h [5]


!
= 6 " 0 ( ) + 9 " (#4) ( ) + (#4) " 3 ( ) + 1" (#2) ( ) + 2 "1 ( ) + 3 "1 ( )
= 0 # 36 #12 #1+2 + 3 = #44



!
y [5] = x [r]

h [5 " r]
r=0
5
#



!
= x [0]

h [5] + x [1]

h [4] + x [2]

h [3] + x [3]

h [2] + x [4]

h [1] + x [5]

h [0]


!
= 6 "1 ( ) + 9 " 0 ( ) + (#4) " (#4) ( ) + 1" 3 ( ) + 2 " (#2) ( ) + 3 "1 ( )
= 6 +0 +16 + 3 # 4 + 3 = 24


Therefore,
!
y [n] ={7, "6, "15, "15, "44, 24}, 0 # n # 5.

5.3 Since
!

"
k
[n + rN] =

"
k
[n], all the terms which are not in the range

!
0,1,, N "1, can be
accumulated into
!

"
k
[n], where
!
0 " k " N #1. Hence, in this case the Fourier series
representation involves N complex exponential sequences. Let
!
x [n] =
1
N

X [k]e
j 2"kn / N
k=0
N#1
$
, then:
!
x [n]e
" j 2#rn / N
n=0
N"1
$
=
1
N

X [k]e
j 2# (k"r)n / N
k=0
N"1
$
n=0
N"1
$

!
=
1
N

X [k]
k=0
N"1
#
e
j 2$ (k"r)n / N
n=0
N"1
#
%
&
'
'
(
)
*
*
.

From Eqn. (5.11), the inner summation is equal to N if k = r, and otherwise it is equal to
Thus:
!
x [n]e
" j 2#rn / N
n=0
N"1
$
=

X [r].
Next, observe that

!

X [k +!N] = x [n]e
" j 2# (k+!N)n / N
n=0
N"1
$
= x [n]e
" j 2#kn / N
n=0
N"1
$
e
" j 2#!n

!
= x [n]e
" j 2#kn / N
n=0
N"1
$
=

X [k].

Thus, X[k] is also a periodic sequence with period N.

5.4 (a) Given
!
x
1
[n] = cos
3"n
4
#
$
%
&
'
(
cos
"n
4
#
$
%
&
'
(
=
1
2
e
j"n / 4
+e
) j"n / 4
( )
1
2
e
j 3"n / 4
+e
) j 3"n / 4
( )

!
=
1
4
e
j"n / 4
e
j 3"n / 4
+e
j"n / 4
e
# j 3"n / 4
+e
# j"n / 4
e
j 3"n / 4
+e
# j"n / 4
e
# j 3"n / 4
( )
=
1
4
e
j"n
+e
j"n / 2
+e
# j"n / 2
+e
# j"n
( )
=
1
2
cos "n ( ) +cos
"n
2
$
%
&
'
(
)
$
%
&
'
(
)

Not for sale. 5

Since the period of one component is
!
N
1
= 2 and the period of the second component is
!
N
2
= 4, the period of the combined signal is
!
N = LCM(N
1
, N
2
) = 4. Thus, Eqn.
(5.199b) reduces to:

!

X
1
[k] =
1
4
e
j"n
e
# j 2"kn / 4
n=0
3
$
+ e
# j"n
e
# j 2"kn / 4
n=0
3
$
%
&
'
(
'
)
*
'
+
'


!
+
1
4
e
j"n / 2
e
# j 2"kn / 4
n=0
3
$
+ e
# j"n / 2
e
# j 2"kn / 4
n=0
3
$
%
&
'
(
'
)
*
'
+
'



!
=
1
4
e
4 j"n / 4
e
# j 2"kn / 4
n=0
3
$
+ e
#4 j"n / 4
e
# j 2"kn / 4
n=0
3
$
%
&
'
(
'
)
*
'
+
'

!
+
1
4
e
j 2"n / 4
e
# j 2"kn / 4
n=0
3
$
+ e
# j 2"n / 4
e
# j 2"kn / 4
n=0
3
$
%
&
'
(
'
)
*
'
+
'
=
1
4
e
# j 2"n(k#2) / 4
n=0
3
$
+e
# j 2"n(k+2) / 4
+e
# j 2"n(k#1) / 4
+e
# j 2"n(k+1) / 4
%
&
'
(
'
)
*
'
+
'


Now, from Eqn. (5.11), we observe:
!
1
4
e
" j 2#n(k"1) / 4
n=0
3
$
=
1, for k =1,
0, otherwise,
%
&
'

!
1
4
e
" j 2#n(k+1) / 4
n=0
3
$
=
1, for k = 3,
0, otherwise,
%
&
'

!
1
4
e
" j 2#n(k"2) / 4
n=0
3
$
=
1, for k = 2,
0, otherwise,
%
&
'

!
1
4
e
" j 2#n(k+2) / 4
n=0
3
$
=
1, for k = 2,
0, otherwise.
%
&
'


Hence:
!

X
1
[k] = 0, 1, 2, 1. { }, 0 " k " 3.

(b) Given:

!
x
2
[n] = cos
"n
4
#
$
%
&
'
(
+ 3sin
2
"n
4
#
$
%
&
'
(
=
1
2
e
j"n / 4
+e
) j"n / 4
( )
+ 3*
1
2 j
e
j"n / 4
)e
) j"n / 4
( )
1
2 j
e
j"n / 4
)e
) j"n / 4
( )

Not for sale. 6
!
=
1
2
e
j"n / 4
+e
# j"n / 4
( )
+ 3$
1
2 j
e
j"n / 4
#e
# j"n / 4
( )
1
2 j
e
j"n / 4
#e
# j"n / 4
( )
=
1
2
e
j"n / 4
+e
# j"n / 4
( )
#
3
4
e
j"n / 4
e
j"n / 4
#e
j"n / 4
e
# j"n / 4
#e
j"n / 4
e
# j"n / 4
+e
# j"n / 4
e
# j"n / 4
( )
!
=
1
2
e
j"n / 4
+e
# j"n / 4
( )
#
3
4
e
j"n / 2
+e
# j"n / 2
( )
= cos
"n
4
$
%
&
'
(
) #
3
2
cos
"n
2
$
%
&
'
(
) .


Since the period of one component is
!
N
1
= 8 and the period of the other component is
!
N
2
= 4, the period of the combined signal is
!
N = LCM(N
1
, N
2
) =16.

Thus, Eqn. (5.199b) reduces to:
!

X
2
[k] = e
j"n / 4
e
# j 2"kn /16
n=0
15
$
+ e
# j"n / 4
e
# j 2"kn /16
n=0
15
$
%
&
'
(
'
)
*
'
+
'
+
3
2
e
j"n / 2
e
# j 2"kn /16
n=0
15
$
+ e
# j"n / 2
e
# j 2"kn /16
n=0
15
$
%
&
'
(
'
)
*
'
+
'
= e
j 4"n /16
e
# j 2"kn /16
n=0
15
$
+ e
# j 4"n /16
e
# j 2"kn /16
n=0
15
$
%
&
'
(
'
)
*
'
+
'
+
3
2
e
j8"n /16
e
# j 2"kn /16
n=0
15
$
+ e
# j8"n /16
e
# j 2"kn /16
n=0
15
$
%
&
'
(
'
)
*
'
+
'
= e
# j 2"n(k#2) /16
n=0
15
$
+e
# j 2"n(k+2) / 4
+
3
2
e
# j 2"n(k#4) /16
+
3
2
e
# j 2"n(k+4) /16
%
&
'
(
'
)
*
'
+
'


Now, from Eqn. (5.11), we observe:
!
1
16
e
" j 2#n(k"2) /16
n=0
15
$
=
1, for k = 2,
0, otherwise,
%
&
'


!
1
16
e
" j 2#n(k+2) /16
n=0
15
$
=
1, for k =14,
0, otherwise,
%
&
'

!
1
16
e
" j 2#n(k"4) /16
n=0
15
$
=
1, for k = 4,
0, otherwise,
%
&
'


!
1
16
e
" j 2#n(k+4) / 4
n=0
15
$
=
1, for k =12,
0, otherwise.
%
&
'


Hence:
Not for sale. 7

!

X
2
[k] = 0, 0,
1
16
, 0,
3
8
, 0, 0, 0, 0, 0, 0, 0,
3
8
, 0,
1
16
, 0
"
#
$
%
&
'
, 0 ( k (15.
5.5 Let
!

P [k] denote the coefficients of the Fourier series representation of
!
p [n]. Since
!
p [n]
is periodic with a period
!
N, then from Eq. (5.185b), we have for any index k:
!

P [k] = p [n]e
" j 2#kn / N
n=0
N"1
$
=1.
Hence, from Eq. (5.185a) we get:

!
p [n] =
1
N

P [!]e
j 2"!n / N
!=0
N#1
$
=
1
N
e
j 2"!n / N
!=0
N#1
$
.

5.6 Given:
!

X [k] = X(e
j"
)
"=2#k / N
= X(e
j 2#k / N
) = x[n]e
$ j 2#k / N
n=$%
%
&
, $ % < k < %.

We can show that X[k] is periodic as follows:



!

X [k +!N] = X(e
j 2" (k+!N) / N
) = X(e
j 2"k / N
e
j"!
) = X(e
j 2"k / N
) =

X [k].

Likewise, we can define the original sequence:



!
x [n] =
1
N

X [k]e
j 2"kn / N
k=0
N#1
$
=
1
N
x[!]e
# j 2"!n / N
!=#%
%
$
&
'
(
(
)
*
+
+
k=0
N#1
$
e
j 2"kn / N

!
=
1
N
x[!]e
j 2" (k#!)n / N
!=#$
$
%
k=0
N#1
%
.

Let
!
! = n + rN. Then:
!
x [n] =
1
N
x[n + rN] e
" j 2#kr
k=0
N"1
$
%
&
'
'
(
)
*
*
r="+
+
$
.

But
!
e
" j 2#kr
k=0
N"1
$
= N. Hence:
!
x [n] = x[n + rN]
r="#
#
$
.

5.7 (a) From Eqn. (5.199a):
!
x [n] =
1
N

X [r]e
" j 2#rn / N
r=0
N"1
$
.

Therefore:
!

G [k] = g [n]e
" j 2#kn / N
n=0
N"1
$

Not for sale. 8


!
= x [n] y [n] e
" j 2#kn / N
n=0
N"1
$
=
1
N

X [r]
r=0
N"1
$
!
y [n]e
" j 2# (k"r)n / N
n=0
N"1
$



!
=
1
N

X [r]
n=0
N"1
#
!
y [n]e
" j 2$ (k"r)n / N
r=0
N"1
#
=
1
N

X [r]

Y [k " r]
r=0
N"1
#
.

(b) Similarly from Eqns. (5.199a) and (5.199b):


!

h [n] =
1
N

X [k]

Y [k] e
j 2"kn / N
k=0
N#1
$
=
1
N
x [r]

Y [k] e
j 2"k(n#r) / N
r=0
N#1
$
k=0
N#1
$


!
= x [r]
1
N

Y [k] e
j 2"k(n#r) / N
k=0
N#1
$
%
&
'
'
(
)
*
*
r=0
N#1
$
= x [r] y [n # r]
r=0
N#1
$
.

5.8 (a) Given:
!
x
a
[n] = cos(2"n / N) =
1
2
(e
j 2"n / N
+e
# j 2"n / N
). Therefore:

!
X
a
[k] =
1
2
e
j 2"n / N
n=0
N#1
$
e
# j 2"kn / N
#
1
2
e
# j 2"n / N
n=0
N#1
$
e
# j 2"kn / N


!
=
1
2
e
" j 2# (k"1)n / N
n=0
N"1
$
"
1
2
e
" j 2# (k+1)n / N
n=0
N"1
$
.

From Eqn. (5.11), the first sum is equal to
!
N when
!
k =1 and
!
0 otherwise. Likewise, the
second sum is equal to
!
N when
!
k = N "1 and
!
0 otherwise. Therefore,


!
X
a
[k] =
N /2, k =1,
"N /2, k = N "1,
0, otherwise.
#
$
%
&
%


(b) Given:
!
x
b
[n] = sin
2
2"n
N
#
$
%
&
'
( =1)cos
2
2"n
N
#
$
%
&
'
( =
1
2
)
1
2
cos
4"n
N
#
$
%
&
'
( .

The Npoint DFT of 1/2 is N/2 for k = 0 and 0 otherwise. From Example 5.2, the Npoint
DFT of
!
cos(4"n / N) is N/2 for k = 2 and
!
k = N "2 and 0 otherwise. Thus:


!
X
b
[k] =
N /2, k = 0,
"N / 4, k = 2, N "2,
0, otherwise.
#
$
%
&
%


(c) Given:
!
x
b
[n] = sin
3
2"n
N
#
$
%
&
'
( =
3
4
sin
2"n
N
#
$
%
&
'
( )
1
4
sin
6"n
N
#
$
%
&
'
( .

Not for sale. 9
The Npoint DFT of
!
sin(2"n / N) is
!
N /2 j for k = 0 and
!
k = N, and 0 otherwise. The N
point DFT of
!
sin(6"n / N) is
!
N /6 j for k = 3 and
!
k = N " 3, and 0 otherwise. Thus:


!
X
b
[k] =
3N /8 j, k = 0, N,
"N /8 j, k = 3, N " 3,
0, otherwise.
#
$
%
&
%


5.9 (a)
!
Y
a
[k] = "
n
W
N
kn
n=0
N#1
$
= ("W
N
k
)
n
n=0
N#1
$
=
1#"
N
W
N
kN
1#"W
N
k
=
1#"
N
1#"W
N
k
.

(b) Note that
!
y
b
[n] =
+4, for n even,
"2, for n odd,
#
$
%
= 3("1)
n
+1.

Hence we can use the result from Part (a) and write:


!
Y
b
[k] = [3("1)
n
+1]W
N
kn
n=0
N"1
#
!
= 3 "W
N
k
( )
n
n=0
N"1
#
+ W
N
k
( )
n
n=0
N"1
#
.

Assume
!
W
N
k
" 1. Then:

!
Y
b
[k] = 3
1" "W
N
k
( )
N
1" "W
N
k
( )
+
1" W
N
k
( )
N
1" W
N
k
( )
= 3
1" "W
N
k
( )
N #
$
%
&
'
(
1"W
N
k
( )
1"W
N
k
( )
1+W
N
k
( )
+
1" W
N
k
( )
N #
$
%
&
'
(
1+W
N
k
( )
1"W
N
k
( )
1+W
N
k
( )


!
= 3
1" "1 ( )
N
e
j 2#k
( )
1"W
N
k
( )
1"W
N
k
( )
1+W
N
k
( )
+
1"e
j 2#k
( )
1+W
N
k
( )
1"W
N
k
( )
1+W
N
k
( )
=
3 " 3W
N
k
" 3 "1 ( )
N
e
j 2#k
+ 3 "1 ( )
N
e
j 2#k
W
N
k
( )
+ 1+W
N
k
"e
j 2#k
"e
j 2#k
W
N
k
( )
1"W
N
k
( )
1+W
N
k
( )


!
=
4 "2W
N
k
" 3 "1 ( )
N
e
j 2#k
+ 3 "1 ( )
N
e
j 2#k
W
N
k
"e
j 2#k
"e
j 2#k
W
N
k
1"W
N
k
( )
1+W
N
k
( )
=
4 " 3 "1 ( )
N
e
j 2#k
"e
j 2#k
"W
N
k
2 " 3 "1 ( )
N
e
j 2#k
+e
j 2#k
( )
1"W
N
k
( )
1+W
N
k
( )
.


Not for sale. 10
Assume
!
W
N
k
= "1 #k = N /2 (where N is necessarily even). Then:
!
Y
b
[N /2] = 3 (1)
n
n=0
N"1
#
+ ("1)
n
n=0
N"1
#
= 2N.

Now, suppose
!
W
N
k
=1 "k = 0. Then,

!
Y
b
[0] = 3 ("1)
n
n=0
N"1
#
+ (1)
n
n=0
N"1
#
= 3
[1"("1)
N
]
1"("1)
+ N =
3
2
[1"("1)
N
] + N
!
=
N, for N even,
3+ N, for N odd.
"
#
$


5.10 Now:
!
x[n] = cos("
o
n) =
1
2
(e
j"
o
n
+e
# j"
o
n
), 0 $ n $ N #1.

Therefore:
!
X[k] =
1
2
e
j"
o
n
e
# j 2$kn / N
n=0
N#1
%
+
1
2
e # j
j"
o
n
e
# j 2$kn / N
n=0
N#1
%


!
=
1
2
e
" j (
2#k
N
"$
o
)n
n=0
N"1
%
+
1
2
e
" j (
2#k
N
+$
o
)n
n=0
N"1
%


!
=
1
2
"
1#e
# j
2$k
N
#%
o
&
'
(
)
*
+
N
1#e
# j
2$k
N
#%
o
&
'
(
)
*
+
+
1
2
"
1#e
# j
2$k
N
+%
o
&
'
(
)
*
+
N
1#e
# j
2$k
N
+%
o
&
'
(
)
*
+


!
=
1
2
e
" j
2#k
N
"$
o
%
&
'
(
)
*
N"1
2
%
&
'
(
)
*
+
sin #k "
$
o
N
2
( )
sin
#k
N
"
$
o
2
( )
+
1
2
e
" j
2#k
N
+$
o
%
&
'
(
)
*
N"1
2
%
&
'
(
)
*
+
sin #k +
$
o
N
2
( )
sin
#k
N
+
$
o
2
( )
.

5.11 From the definition of the DFT:
!
x[n] =
1
N
X[k]W
N
"kn
k=0
N"1
#
. Thus:

!
x[N " n] =
1
N
X[k]W
N
"k(N"n)
k=0
N"1
#
=
1
N
X[k]W
N
kn
k=0
N"1
#
=
1
N
F{X[k]}.

Therefore:

!
x[N " n] =
1
N
F{X[k]} =
1
N
F{F{x[n]}}, or,

!
F{F{x[n]}} = N" x[N # n].
Hence:n

!
F{F{F{F{x[n]}}}} = N
2
" x[n].

5.12 Given the DFT of the original sequence, X[k], we can express it in terms of the even
and odd parts:

!
X[k] = x[n]W
N
nk
n=0
N"1
#
= x[2r]W
N
2rk
r=0
(N / 2)"1
#
+ x[2r +1]W
N
(2r+1)k
r=0
(N / 2)"1
#

Not for sale. 11

!
= x[2r]W
N / 2
rk
r=0
(N / 2)"1
#
+W
N
k
x[2r +1]W
N / 2
rk
r=0
(N / 2)"1
#
= g[r]W
N / 2
rk
r=0
(N / 2)"1
#
+W
N
k
h[r]W
N / 2
rk
r=0
(N / 2)"1
#
!
= G["k#
N / 2
] +W
N
k
H["k#
N / 2
], 0 $ k $ N %1.

5.13 Given the N/2 point DFTs of g[n] and h[n], we can rewrite the N-point DFT of x[n], by
first noticing the relationship between the DFT X[k] and its odd and even parts:

For

!
k = 2!, we get:

!
X[2!] = x[n]+ x[
N
2
+ n]
"
#
$
%
&
' W
N
2n!
n=0
(N / 2)(1
)



!
= x[n]+ x[
N
2
+ n]
"
#
$
%
&
' W
N / 2
n!
n=0
(N / 2)(1
)
= G[!].

For
!
k = 2! +1 we get:

!
X[2! +1] = x[n]" x[
N
2
+ n]
#
$
%
&
'
( W
N
(2!+1)n
n=0
(N / 2)"1
)



!
= x[n]+ x[
N
2
+ n]
"
#
$
%
&
' W
N
n
( W
N / 2
n!
n=0
(N / 2))1
*
= H[!].

where

!
0 " ! "
N
2
#1. Thus, we can rewrite the original sequence as follows:


!
X[k] = x[n]W
N
nk
n=0
N"1
#
= x[n]W
N
nk
n=0
(N / 2)"1
#
+ x[n]W
N
nk
n=N / 2
N"1
#


!
= x[n]W
N
nk
n=0
(N / 2)"1
# +W
N
(N / 2)k
x[
N
2
+ n]W
N
nk
n=0
(N / 2)"1
#

!
= x[n]+("1)
k
x[
N
2
+ n]
#
$
%
&
'
( W
N
nk
n=0
(N / 2)"1
)
= G[2!] + H[2! +1] = G[k] + H[k].

5.14 Given:
!
g[n] =
1
2
(x[2n] + x[2n +1]), h[n] =
1
2
(x[2n] " x[2n +1]), 0 # n #
N
2
"1.

Solving for
!
x[2n]and
!
x[2n +1], we get:
!
x[2n] = g[n] + h[n],


!
x[2n +1] = g[n] " h[n].

Therefore:
!
X[k] = x[n]W
N
nk
n=0
N"1
#
= x[2r]W
N
2rk
r=0
(N / 2)"1
#
+ x[2r +1]W
N
(2r+1)k
r=0
(N / 2)"1
#
.

!
= x[2r]W
N / 2
rk
r=0
(N / 2)"1
#
+W
N
k
x[2r +1]W
N / 2
rk
r=0
(N / 2)"1
#

Not for sale. 12

!
= (g[n] + h[n])W
N / 2
rk
r=0
(N / 2)"1
#
+W
N
k
(g[n] " h[n])W
N / 2
rk
r=0
(N / 2)"1
#


!
= (1+W
N
k
) g[n]W
N / 2
rk
r=0
(N / 2)"1
#
+(1"W
N
k
) h[n]W
N / 2
rk
r=0
(N / 2)"1
#


!
= (1+W
N
k
)G["k#
N / 2
] +(1$W
N
k
)H["k#
N / 2
], 0 % k % N $1.

5.15 As a
1
a
4
a
2
a
3
we can rewrite:

!
g[n] = a
1
x[2n] + a
2
x[2n +1], 0 " n "
N
2
#1,


!
h[n] = a
3
x[2n] " a
4
x[2n +1], 0 # n #
N
2
"1.

Solving for
!
x[2n] and
!
x[2n +1], we get:


!
x[2n] =
a
4
g[n] " a
2
h[n]
a
1
a
4
" a
2
a
3
and
!
x[2n +1] =
"a
3
g[n] + a
1
h[n]
a
1
a
4
" a
2
a
3
.

Therefore:
!
X[k] = x[n]W
N
nk
n=0
N"1
#
= x[2r]W
N
2rk
r=0
(N / 2)"1
#
+ x[2r +1]W
N
(2r+1)k
r=0
(N / 2)"1
#


!
= x[2r]W
N / 2
rk
r=0
(N / 2)"1
#
+W
N
k
x[2r +1]W
N / 2
rk
r=0
(N / 2)"1
#


!
=
a
4
g[r] " a
2
h[r]
a
1
a
4
" a
2
a
3
#
$
%
&
'
(
W
N / 2
rk
r=0
(N / 2)"1
)
+W
N
k
"a
3
g[n] + a
1
h[n]
a
1
a
4
" a
2
a
3
#
$
%
&
'
(
W
N / 2
rk
r=0
(N / 2)"1
)


!
=
1
a
1
a
4
" a
2
a
3
(a
4
" a
3
W
N
k
)G[#k$
N / 2
] + ("a
2
+ a
1
W
N
k
)H[#k$
N / 2
]
( )
.

5.16 (a)
!
G[k] = x[n]W
2N
nk
n=0
N"1
#
. For
!
k even, i.e.,

!
k = 2!,

!
G[2!] = x[n]W
2N
2!n
n=0
N"1
#


!
= x[n]
N
!n
n=0
N"1
#
= X[!], 0 $ ! $ N "1. For
!
k odd, i.e.,

!
k = 2! +1,

!
G[2! +1] = x[n]W
2N
(2!+1)n
n=0
N"1
#
= x[n]W
2N
n
( )
W
N
!n
n=0
N"1
#
, 0 $ ! $ N "1.

(b)
!
H[k] = x[n " N]W
2N
nk
n=N
2N"1
#
. Let
!
m = n " N or
!
n = m+ N. Then
!
H[k] = x[m]W
2N
(m+N)k
m=0
N"1
#
= ("1)
k
x[m]W
2N
mk
m=0
N"1
#
. For
!
k even, i.e.,

!
k = 2!,
Not for sale. 13

!
H[2!] = x[m]W
2N
2!m
m=0
N"1
#
= x[m]W
N
!m
m=0
N"1
#
= X[!], 0 $ ! $ N "1. For
!
k odd, i.e.,

!
k = 2! +1,

!
H[2! +1] = " x[m]W
2N
(2!+1)m
m=0
N"1
#
= " x[m]W
2N
m
( )
W
N
!m
m=0
N"1
#
, 0 $ ! $ N "1.

5.17
!
Y[k] = y[n]W
2N
nk
n=0
2N"1
#
= (g[n] + h[n])W
2N
nk
n=0
2N"1
#
= G[k] + H[k]. For
!
k even, i.e.,

!
k = 2!,

!
Y[2!] = G[2!] + H[2!] = 2 X[!], 0 " ! " N #1.
For
!
k odd, i.e.,

!
k = 2! +1,

!
G[2! +1] = x[n]W
2N
(2!+1)n
n=0
N"1
#
= x[n]W
2N
n
W
N
!n
n=0
N"1
#
and

!
H[2! +1] = " x[n]W
2N
(2!+1)n
n=0
N"1
#
= " x[n]W
2N
n
W
N
!n
= "G[2! +1]
n=0
N"1
#
, 0 $ ! $ N "1.
Hence, for

!
k = 2! +1,

!
Y[2! +1] = G[2! +1] "G[2! +1] = 0, 0 # ! # N "1.


5.18
!
Y[k] = y[n]W
MN
nk
n=0
MN"1
#
= x[n]W
MN
nk
n=0
N"1
#
.

Thus:
!
Y[kM] = x[n]W
MN
nkM
n=0
N"1
#
= x[n]W
N
nk
n=0
N"1
#
= X[k].

5.19 Assuming that N is odd and R = NL, where L is a positive integer, the DFT Y[k] is
given:


!
Y[k] =
LX[k] 0 " k " N #1 ( ) /2
LX[k # R+ N] R # N #1 ( ) /2 " k " R #1
0 else
$
%
&
'
&


We can find the IDFT of Y[k] as follows:


!
y[n] =
1
R
Y[k]W
R
"kn
k=0
R"1
#
=
1
R
LX[k]W
R
"kn
k=0
(N"1) / 2
#
+
1
R
LX[k " R+ N]W
R
"kn
k=R"(N"1) / 2
R"1
#


!
=
L
R
X[k]W
N
"kn
N"1
N"L
#
$
%
&
'
(
W
L
"kn
1"L
N"L
#
$
%
&
'
(
k=0
(N"1) / 2
)
+
L
R
LX[k " R+ N]W
N
"kn
N"1
N"L
#
$
%
&
'
(
W
L
"kn
1"L
N"L
#
$
%
&
'
(
k=R"(N"1) / 2
R"1
)


Not for sale. 14
5.20 (a) Given:

!
y[n] =
x[n / L], n = 0, L, 2L,, (N "1)L,
0, elsewhere.
#
$
%


We can find the NL-point DFT as follows:


!
Y[k] = y[n]W
NL
nk
n=0
NL"1
#
= x[n]W
NL
nLk
n=0
N"1
#
= x[n]W
N
nk
n=0
N"1
#
.

For
!
k " N, let
!
k = k
o
+ rN where
!
k
o
= "k#
N
. Then:

!
Y[k] =Y[k
o
+ rN] = x[n]W
N
n(k
o
+rN)
n=0
N"1
#
= x[n]W
N
nk
o
n=0
N"1
#
!
= X[k
o
] = X["k#
N
].

(b) Since
!
Y[k] = X["k#
5
] for
!
0 " k " 20, a sketch of
!
Y[k] will include a repetition of
X[k] 4 times as shown below:


5.21
!
(1) g[n] = x[n]W
N
"n
2
/ 2
, y[n] =W
N
n
2
/ 2
,

!
(2) r
yg
[k] = g[n]y[n + k]
n="#
#
$ = x[n]W
N
"n
2
/ 2
W
N
(n+k)
2
/ 2
n=0
N"1
$

!
= x[n]W
N
"n
2
/ 2
W
N
n
2
/ 2
n=0
N"1
# W
N
nk
W
N
k
2
/ 2
=W
N
k
2
/ 2
x[n]
n=0
N"1
# W
N
nk

!
(3) W
N
"k
2
/ 2
r
yg
[k] =W
N
"k
2
/ 2
W
N
k
2
/ 2
x[n]W
N
nk
n=0
N"1
# = x[n]W
N
nk
n=0
N"1
# = X[k].

The final transformation proves that this alternative computation results in the N-point
DFT of x[n].

5.22 Given an N-point sequence x[n] with an N-point DFT X[k]. The length-3N sequence
y[n] is defined by:


!
y[n] =
x[n], 0 " n " N #1,
0, N " n " 3N #1.
$
%
&

Not for sale. 15

Also, the N-point DFT, W[k], of a length-N sequence w[n] is given by


!
W[k] =Y[3k + 2], 0 " k " N #1.

To express w[n] in terms of x[n], first express the DFT of y[n] in terms of the DFT of
x[n] as follows, in order to establish a frequency-domain relationship between them:


!
Y[k] = y[n]W
3N
nk
n=0
3N"1
# .

From here, we use the same principle as in Problem 5.16, dealing with each 3rd of the
signal separately, and keeping track of the multipliers that are necessary to balance each
part of the equation:

For

!
k = 3!,

!
Y[3!] = y[n]W
3N
n3!
n=0
3N"1
# = x[n]W
N
n!
n=0
3N"1
# = x[n]W
N
n!
n=0
N"1
# = X[k],

For

!
k = 3! +1,


!
Y[3! +1] = y[n]W
3N
n(3!+1)
n=0
3N"1
# = x[n]W
N
n!
W
3N
n
n=0
3N"1
# = x[n]W
3N
n
( )
W
N
n!
n=0
N"1
# ,

For

!
k = 3! + 2,


!
Y[3! + 2] = y[n]W
3N
n(3!+2)
n=0
3N"1
# = x[n]W
N
n!
W
3N
2n
n=0
3N"1
# = x[n]W
3N
2n
( )
W
N
n!
n=0
N"1
# .

Next, apply the definitions:



!
w[n] =
1
N
x[n]W
3N
2n
( )
W
N
n!
n=0
N"1
# W
N
"nk
k=0
N"1
# =
1
N
x[n]W
3N
2n
( )
n=0
N"1
#
k=0
N"1
#


!
=
1
N
x[n]W
3N
2n
( )
W
N
n!
n=0
N"1
# W
N
"nk
k=0
N"1
# =
1
N
x[n]W
3N
2n
( )
n=0
N"1
#
k=0
N"1
# .

5.23 Given the sequences P[k] and D[k], we can find the IDFT of each using a matrix
multiplication:


!
p[0]
p[1]
p[2]
p[3]
"
#
$
$
$
$
%
&
'
'
'
'
=
1
4
1 1 1 1
1 j (1 (j
1 (1 1 (1
1 (j (1 j
"
#
$
$
$
$
%
&
'
'
'
'
3.5
(0.5 ( j9.5
2.5
(0.5 + j9.5
"
#
$
$
$
$
%
&
'
'
'
'
=
1.25
(4.5
1.75
5
"
#
$
$
$
$
%
&
'
'
'
'

Not for sale. 16

!
d[0]
d[1]
d[2]
d[3]
"
#
$
$
$
$
%
&
'
'
'
'
=
1
4
1 1 1 1
1 j (1 (j
1 (1 1 (1
1 (j (1 j
"
#
$
$
$
$
%
&
'
'
'
'
17
7.4 + j12
17.8
7.4 ( j12
"
#
$
$
$
$
%
&
'
'
'
'
=
12.4
5.8
5
(6.2
"
#
$
$
$
$
%
&
'
'
'
'
.

Therefore:
!
X(e
j"
) =
1.25 # 4.5e
# j"
+1.75e
# j 2"
+ 5e
# j 3"
12.4 + 5.8e
# j"
+ 5e
# j 2"
#6.2e
# j 3"
.

5.24 Given the sequences P[k] and D[k], we can find the IDFT of each using a matrix
multiplication:


!
p[0]
p[1]
p[2]
p[3]
"
#
$
$
$
$
%
&
'
'
'
'
=
1
4
1 1 1 1
1 j (1 (j
1 (1 1 (1
1 (j (1 j
"
#
$
$
$
$
%
&
'
'
'
'
(9
(4 ( j9
2 ( 3
(4 + j9
"
#
$
$
$
$
%
&
'
'
'
'
=
(5
(6
(1
3
"
#
$
$
$
$
%
&
'
'
'
'


!
d[0]
d[1]
d[2]
d[3]
"
#
$
$
$
$
%
&
'
'
'
'
=
1
4
1 1 1 1
1 j (1 (j
1 (1 1 (1
1 (j (1 j
"
#
$
$
$
$
%
&
'
'
'
'
6
3+ j 7
(4
3( j 7
"
#
$
$
$
$
%
&
'
'
'
'
=
2
6
(1
(1
"
#
$
$
$
$
%
&
'
'
'
'
.

Therefore:
!
X(e
j"
) =
#5 #6e
# j"
#e
# j 2"
+ 3e
# j 3"
2 + 6e
# j"
#e
# j 2"
#e
# j 3"
.

5.25 From Eq. (5.49) we have
!
x
i
[n] = x[n + mN]
m="#
#
$ , 0 % n % N "1. Let x[n] be a length-M
sequence defined for
!
0 " n " M #1. If
!
M " N, then x[n] can be recovered from
!
x
i
[n]
by extracting N samples from
!
x
i
[n] in the range
!
0 " n " N #1. If M > N, then x[n]
cannot be recovered from
!
x
i
[n] because of time-domain aliasing.

(a)
!
x
1
[n] = x[n +12m]
m="#
#
$ = x[n +12] + x[n] + x[n "12], 0 % n %11.

Since M = 12 > 9 = N, x[n] is recoverable from
!
x
1
[n]. In fact, x[n] is given by the first
9 samples of
!
x
1
[n] because of the above formula:

!
x
1
[n] ={1, "3, 4, "5, 7, "5, 4, "3, 1, 0, 0, 0}, 0 # n #11,

(b)
!
x
2
[n] = x[n + 8m]
m="#
#
$ = x[n + 8] + x[n] + x[n "8], 0 % n % 7.
Not for sale. 17
This time, since M = 8 < 9 = N, x[n] is not recoverable from
!
x
2
[n]. In fact, the
repeated copies overlap to form:


!
x
2
[n] = 2, "3, 4, "5, 7, "5, 4, "3, 2, "3, 4
[ ]
, 0 # n #10.

5.26 For each of these problems, we also use the result proven in the solution of Problem
5.25.

(a)
!
y[n] = x[n + 4m]
m="#
#
$ = x[n + 4] + x[n] + x[n " 4], 0 % n % 3.
Thus, y[n] becomes:
!
y[n] = 10, "9, "1, 2 { }, 0 # n # 3.
(a)
!
v[n] = x[n + 5m]
m="#
#
$ = x[n + 5] + x[n] + x[n "5], 0 % n % 4.

Thus, v[n] becomes:
!
v[n] = "1, 1, 7, "7, 2 { },


5.27
!
y[n] = x[n]O* h[n] = x[k]h[n " k]
k=0
100
# = h[k] x[n " k]
k=0
100
# = h[k] x[n " k]
k=17
36
# .

!
u[n] = x[n]
O
51 h[n] = h[k] x["n # k$
51
]
k=0
50
% = h[k] x["n # k$
51
]
k=17
36
% .

For n ! 36:
!
x["n # k$
51
] = x[n # k].

Thus:
!
y[n] = u[n] for
!
36 " n " 50.

5.28 (a)

!
y
C
[n] = g[!]h["n #!$
6
]
!=0
5
% . Thus,

!
y
C
[0] = g[0]h[0] + g[1]h[5] + g[2]h[4] + g[3]h[3] + g[4]h[2] + g[5]h[1]

!
y
C
[1] = g[0]h[1] + g[1]h[0] + g[2]h[5] + g[3]h[4] + g[4]h[3] + g[5]h[2]

!
y
C
[2] = g[0]h[2] + g[1]h[1] + g[2]h[0] + g[3]h[5] + g[4]h[4] + g[5]h[3]

!
y
C
[3] = g[0]h[3] + g[1]h[2] + g[2]h[1] + g[3]h[0] + g[4]h[5] + g[5]h[4]

!
y
C
[4] = g[0]h[4] + g[1]h[3] + g[2]h[2] + g[3]h[1] + g[4]h[0] + g[5]h[5]

!
y
C
[5] = g[0]h[5] + g[1]h[4] + g[2]h[3] + g[3]h[2] + g[4]h[1] + g[5]h[0]


!
y
L
[n] = g[!]
!=0
5
" h[n #!]. Thus,

!
y
L
[0] = g[0]h[0],

!
y
L
[1] = g[0]h[1] + g[1]h[0],

!
y
L
[2] = g[0]h[2] + g[1]h[1] + g[2]h[0],

!
y
L
[3] = g[0]h[3] + g[1]h[2] + g[2]h[1] + g[3]h[0],

!
y
L
[4] = g[0]h[4] + g[1]h[3] + g[2]h[2] + g[3]h[1] + g[4]h[0],

!
y
L
[5] = g[0]h[5] + g[1]h[4] + g[2]h[3] + g[3]h[2] + g[4]h[1] + g[5]h[0],
Not for sale. 18

!
y
L
[6] = g[1]h[5] + g[2]h[4] + g[3]h[3] + g[4]h[2] + g[5]h[1]

!
y
L
[7] = g[2]h[5] + g[3]h[4] + g[4]h[3] + g[5]h[2]

!
y
L
[8] = g[3]h[5] + g[4]h[4] + g[5]h[3]

!
y
L
[9] = g[4]h[5] + g[5]h[4]

!
y
L
[9] = g[5]h[5]

Comparing
!
y
C
[n] with
!
y
L
[n] we observe that:


!
y
C
[0] = y
L
[0] + y
L
[6],

!
y
C
[1] = y
L
[1] + y
L
[7],

!
y
C
[2] = y
L
[2] + y
L
[8],

!
y
C
[3] = y
L
[3] + y
L
[9],

!
y
C
[4] = y
L
[4] + y
L
[10],

!
y
C
[5] = y
L
[5].

(b) First, we determine the linear convolution of g[n] and h[n]:


!
y
L
[n] = "6, 22, "3, "54, 77, 9, "28, 63, "6, 13, 12 { }.

Applying the formula derived in Part (a) we arrive at

!
y
C
[n] = "6 "28, 22 + 63, "3"6, "54 +13, 77 +12, 9 { }

!
= "34, 85, "9, "41, 89, 9 { }.


Using MATLAB we arrive at
yc =

-34.0000 85.0000 -9.0000 -41.0000 89.0000 9.0000



5.29

!
y[3] = x[!]h["n #!$
6
]
!=0
5
%
= x[0]h[3] + x[1]h[2] + x[2]h[1] + x[3]h[0] + x[4]h[5] + x[5]h[4]

!
= ("3) # 7 +0 # ("2) +(7 # 4) + 4 # ("5) +("5) # 0 +8 # 6

!
= "21+28 "20 + 48 = 35.

5.30 We need to show that:
!
g[n]
O
N h[n] = h[n]
O
N g[n].
Let:
!
x[n] = g[n]
O
N h[n] = g[m]h["n # m$
N
]
m=0
N#1
%
Then:
!
y[n] = h[n]
O
N g[n] = h[m]g["n # m$
N
]
m=0
N#1
%

!
= h[m]g[n " m]
m=0
n
# + h[m]g[N + n " m]
m=n+1
N"1
#
Not for sale. 19

!
= h[n " m]g[m]
m=0
n
# + h[N + n " m]g[m]
m=n+1
N"1
# = h[$n " m%
N
]g[m]
m=0
N"1
# = x[n].

5.31 We need to show that:
!
f [n]
O
N g[n]
"
#
$
%
&
'
O
N h[n] = f [n]
O
N g[n]
O
N h[n]
"
#
$
%
&
'
Let:
!
x[n] = f [n]
O
N g[n]
"
#
$
%
&
'
O
N h[n] = f [m]g[(n ) m*
N
]
m=0
N)1
+
"
#
$
%
&
'
O
N h[n]

!
= f [k]g["n #"m# k$
N
$
N
]h["n # k$
N
]
m=0
N#1
%
k=0
N#1
%
= f [k]g["n #"m# k$
N
$
N
]h["n # k$
N
]
k=0
N#1
%
m=0
N#1
% .


Then, because circular convolution is commutative, from Problem 5.30 solution we
observe:

!
x[n] = f [k]g["n #"m# k$
N
$
N
]h["n # k$
N
]
k=0
N#1
%
m=0
N#1
% = f [m]g["k # m$
N
]h["n #"k # m$
N
$
N
]
k=0
N#1
%
m=0
N#1
%

!
= f [n]
O
N g[k]h["n # k$
N
]
k=0
N#1
%
&
'
(
)
*
+
= f [n]
O
N g[n]
O
N h[n]
&
'
(
)
*
+ .

5.32 First we set up the tabular form for computing the linear convolution:


The entries in the column for
!
n = "4#
4
, are moved to the column for n = 0. Next, the
entries in the column for
!
n = "5#
4
, are moved to the column for n = 1. Finally, the
entries in the column for
!
n = "6#
4
, are moved to the column for n = 2.

Summing the four entries in the columns n = 0, 1, 2, and 3, we finally arrive at the
sequence y[n] as indicated below:
<4>
4
<5>
4
<6>
4
8 2 4 6
8 2 4 6
12 3 6 9
4 1 2 3
2 2 3 1 : ] [
4 1 2 3 : ] [
3 2 1 0 :
n h
n x
n
_ _
_
_ _
_ _
_ _
_ _
Not for sale. 20



5.33 First we set up the tabular form for computing the linear convolution:



The entries in the column for
!
n = "4#
4
, are moved to the column for n = 0. Next, the
entries in the column for
!
n = "5#
4
, are moved to the column for n = 1. Finally, the
entries in the column for
!
n = "6#
4
, are moved to the column for n = 2.

Summing the four entries in the columns n = 0, 1, 2, and 3, we finally arrive at the
sequence y[n] as indicated below:



5.34 (a)
!
X[N /2] = x[n]W
N
nN / 2
n=0
N"1
# = ("1)
n
n=0
N"1
# x[n].

11 9 - 3 3 : ] [
6 8 2 4
4 6 8 2
3 6 9 12
4 1 2 3
2 2 3 1 : ] [
4 1 2 3 : ] [
3 2 1 0 :
n y
n h
n x
n
_ _
_ _
_ _
_ _
_ _
_
30 18 24 12
15 9 12 6
10 6 8 4
20 12 16 8
6 3 2 4 : ] [
5 3 4 2 : ] [
3 2 1 0 :
n h
n x
n
4
<4> <5>
4
<6>
4
_ _ _ _
_ _ _ _
14 20 9 17 : ] [
12 30 18 24
12 6 15 9
6 8 4 10
20 12 16 8
6 3 2 4 : ] [
5 3 4 2 : ] [
3 2 1 0 :
n y
n h
n x
n
_ _
_ _ _ _
_ _ _ _
_ _
Not for sale. 21
Hence if
!
x[n] = x N "1" n
N
[ ]
and
!
N is even, then:
!
X[N /2] = ("1)
n
n=0
N"1
# x[n] = 0.

(b)
!
X[0] = x[n]
n=0
N"1
# . Hence if
!
x[n] = "x[N "1" n], then . 0 ] 0 [ = X

(c) Given N = 2M and that x[n] satisfies the condition:
!
x[n] = "x #n + M$
N
[ ]
.

We can write:

!
X[2!] = x[n]W
N
2n!
n=0
N"1
# = x[n]W
N
2n!
n=0
(N / 2)"1
# + x[n]W
N
2n!
n=(N / 2)"1
N"1
#


!
= x[n]W
N
2n!
n=0
(N / 2)"1
# + x[n +
N
2
]W
N
2n!
n=0
(N / 2)"1
#
= x[n] + x[n + M] ( )W
2M
2n!
n=0
M"1
# .


Hence

!
X[2!] = 0 for
!
0 " ! " M #1.

5.35 We are given the following relationships for
!
0 " n "
N
2
#1:


!
x
0
[n] = x[2n +1] + x[2n], x
1
[n] = x[2n +1] " x[2n],

!
y
0
[n] = y[2n +1] + y[2n], y
1
[n] = y[2n +1] " y[2n]

Since x[n] and y[n] are real symmetric sequences, it follows that
!
x
0
[n] and
!
y
0
[n] are
real symmetric sequences, and
!
x
1
[n] and
!
y
1
[n] are real antisymmetric sequences.
Consider the N/2 length sequence:
!
u[n] = x
0
[n] + y
1
[n] + j x
1
[n] + y
0
[n]
( )
.

Its conjugate sequence is given by:
!
u*[n] = x
0
[n] + y
1
[n] " j x
1
[n] + y
0
[n]
( )
.

Next, we observe that:


!
u["#n$
N / 2
] = x
0
["#n$
N / 2
] + y
1
["#n$
N / 2
] + j x
1
["#n$
N / 2
] + y
0
["#n$
N / 2
]
( )


!
= x
0
[n] " y
1
[n] + j "x
1
[n] + y
0
[n]
( )
.

Its conjugate sequence is given by:
!
u*["#n$
N / 2
] = x
0
[n] # y
1
[n] # j #x
1
[n] + y
0
[n]
( )
.

By adding these 4 sequences we get:


!
4x
0
[n] = u[n] + u*[n] + u["#n$
N / 2
] + u*["#n$
N / 2
].

From Table 5.3, if
!
U[k] = DFT{u[n]}, then:

Not for sale. 22

!
U*["#k$
N / 2
] = DFT{u*[n]},

!
U*[k] = DFT{u*["#n$
N / 2
]},

!
U["#k$
N / 2
] = DFT{u["#n$
N / 2
]}.

Thus:
!
X
0
[k] = DFT{x
0
[n]} =
1
4
U[k] +U*["#k$
N / 2
] +U["#k$
N / 2
] +U*[k]
( )
.

Similarly,
!
j 4x
1
[n] = u[n] " u*[n] " u[#"n$
N / 2
] + u*[#"n$
N / 2
].

Hence:
!
X
1
[k] = DFT{x
1
[n]} =
1
j 4
U[k] "U*[#"k$
N / 2
] "U[#"k$
N / 2
] +U*[k]
( )
.

Likewise,
!
4y
1
[n] = u[n] " u[#"n$
N / 2
] + u*[n] " u*[#"n$
N / 2
].

Thus:
!
Y
1
[k] = DFT{y
1
[n]} =
1
4
U[k] "U[#"k$
N / 2
] +U*[#"k$
N / 2
] "U*[k]
( )
.

Finally:
!
j 4y
0
[n] = u[n] + u["#n$
N / 2
] # u*[n] # u*["#n$
N / 2
].

Hence:
!
Y
0
[k] = DFT{y
0
[n]} =
1
j 4
U[k] +U["#k$
N / 2
] #U*["#k$
N / 2
] #U*[k]
( )
.

5.36 For x[n], when it is an even length N sequence, we know that X[2m] = 0 for all m such
that 0 " m " (N/2) 1. We can therefore show that:


!
X[2m] = x[n]W
N
2mn
n=0
N"1
# = x[n]W
N
2mn
n=0
(N / 2)"1
# + x[n]W
N
2mn
n=N / 2
N"1
#

!
= x[n]W
N
2mn
n=0
(N / 2)"1
# + x[n +
N
2
]W
N
2mn
W
N
mN
n=0
N / 2"1
#

!
= x[n] + x[n +
N
2
"
#
$
%
&
'
W
N
2mn
n=0
(N / 2)(1
) = 0,
This implies
!
x[n] + x["n +
N
2
#
N
] = 0.This is related to what was shown in Problem 5.13.

5.37 This problem is related to Problem 5.36, and uses some of the concepts discussed there.

(a) If N is even and:
!
x[n] = "x[#n +
N
2
$
N
].

Then we can write:
!
X[2m] = x[n]W
N
2mn
n=0
N"1
# = x[n]W
N
2mn
n=0
(N / 2)"1
# + x[n]W
N
2mn
n=N / 2
N"1
#

!
= x[n]W
N
2mn
n=0
(N / 2)"1
# + x[n +
N
2
]W
N
2m(n+
N
2
)
n=0
N / 2"1
#
Not for sale. 23

!
= x[n]W
N
2mn
n=0
(N / 2)"1
# + x[n +
N
2
]W
N
2mn
n=0
N / 2"1
# W
N
mn

!
= x[n] + x[n +
N
2
]
"
#
$
%
&
'
W
N
2mn
n=0
(N / 2)(1
)

!
= x[n] " x[n] ( )W
N
2mn
n=0
(N / 2)"1
# = 0, 0 $ m $
N
2
"1.

(b) If N is an integer multiple of 4 and if:
!
x[n] = "x[#n +
N
4
$
N
],
then we can write:

!
X[4!] = x[n]W
N
4!n
n=0
N"1
#

!
= x[n]W
N
4!n
n=0
(N / 4)"1
# + x[n]W
N
4!n
n=N / 4
(N / 2)"1
# + x[n]W
N
4!n
n=N / 2
(3N / 4)"1
# + x[n]W
N
4!n
n=3N / 4
N"1
#

!
= x[n]W
N
4!n
+ x[n +
N
4
]W
N
4!(n+
N
4
)
"
#
$
$
n=0
N
4
%1
& +x[n +
N
2
]W
N
4!(n+
N
2
)
+ x[n +
3N
4
]W
N
4!(n+
3N
4
)
'
(
)
)

!
= x[n] + x[n +
N
4
]W
N
!n
+ x[n +
N
2
]W
N
2!n
+ x[n +
3N
4
]W
N
3!n
"
#
$
%
&
'
n=0
N
4
(1
) W
N
4!n



!
= (x[n] " X[n] + x[n] " x[n])W
N
4!n
n=0
N
4
"1
# = 0,

since

!
W
N
!N
=W
N
2!N
=W
N
3!N
=1.


5.38 Given the relationships between the length N sequence x[n] and its N-point DFT X[k]:


!
x[n] = x
re
ev
[n] + x
re
od
[n]
( )
+ j x
im
ev
[n] + x
im
od
[n]
( )
,
X[k] = X
re
ev
[k] + X
re
od
[k]
( )
+ j X
im
ev
[k] + X
im
od
[k]
( )
.


The ability to show all these relationships relies on the fact that all the component
sequences within the parenthesis above are all real sequences (they have been split into
real and imaginary components), so the properties listed in Sections 5.5.1 and 5.6 apply
in turn.

(a) Using the definitions in Eqns. (5.61) and (5.62):
!
x
re
ev
[n] =
1
2
x
re
[n] + x
re
*["#n$
N
]
( )
.

Thus we can take the DFT and, using the relationships in Table 5.2, obtain:

Not for sale. 24
!
DFT x
re
ev
[n]
{ }
=
1
2
x
re
[n] + x
re
*["#n$
N
]
( )
n=0
N#1
% W
N
nk
=
1
2
x
re
[n]
n=0
N#1
% W
N
nk
+
1
2
x
re
*["#n$
N
]
n=0
N#1
% W
N
nk


!
=
1
2
X
re
[k] +
1
2
X
re
*[k] =
1
2
X
re
[k] +
1
2
X
re
*["#k$
N
]

!
=
1
2
X
re
[k] + X
re
*[ "k
N
]
( )
= X
re
ev
[k].

(b) Using the definitions in Eqns. (5.61) and (5.62):
!
x
re
od
[n] =
1
2
x
re
[n] " x
re
*[ "n
N
]
( )


Thus we similarly take the DFT and, using the relationships in Table 5.2, obtain:

!
DFT x
re
ev
[n]
{ }
=
1
2
x
re
[n] " x
re
*[#"n$
N
]
( )
n=0
N"1
% W
N
nk
=
1
2
x
re
[n]
n=0
N"1
% W
N
nk
"
1
2
x
re
*[#"n$
N
]
n=0
N"1
% W
N
nk


!
=
1
2
X
re
[k] "
1
2
X
re
*[k] =
1
2
X
re
[k] "
1
2
X
re
*[#"k$
N
]

!
=
1
2
X
re
[k] " X
re
*[#"k$
N
]
( )
= X
re
od
[k].

(c) Using the definitions in Eqns. (5.61) and (5.62):
!
x
im
ev
[n] =
1
2
x
im
[n] + x
im
*["#n$
N
]
( )
.

Thus we can take the DFT and, using the relationships in Table 5.2, obtain:

!
DFT x
im
ev
[n]
{ }
=
1
2
x
im
[n] + x
im
*["#n$
N
]
( )
n=0
N#1
% W
N
nk
=
1
2
x
im
[n]
n=0
N#1
% W
N
nk
+
1
2
x
im
*["#n$
N
]
n=0
N#1
% W
N
nk


!
=
1
2
X
im
[k] +
1
2
X
im
*[k] =
1
2
X
im
[k] +
1
2
X
im
*["#k$
N
]

!
=
1
2
X
im
[k] + X
im
*["#k$
N
]
( )
= X
im
ev
[k].

(d) Using the definitions in Eqns. (5.61) and (5.62):
!
x
im
od
[n] =
1
2
x
im
[n] " x
im
*[#"n$
N
]
( )
.

Thus we similarly take the DFT and, using the relationships in Table 5.2, obtain:

Not for sale. 25
!
DFT x
im
od
[n]
{ }
=
1
2
x
im
[n] " x
im
*[#"n$
N
]
( )
n=0
N"1
% W
N
nk
=
1
2
x
im
[n]
n=0
N"1
% W
N
nk
"
1
2
x
im
*[#"n$
N
]
n=0
N"1
% W
N
nk


!
=
1
2
X
im
[k] "
1
2
X
im
*[k] =
1
2
X
im
[k] "
1
2
X
im
*[#"k$
N
]

!
=
1
2
X
im
[k] " X
im
*[#"k$
N
]
( )
= X
im
od
[k].

5.39 For each of the following, x[n] and X[k] are both length N.

(a)
!
X["N # k$
N
] = x[n]W
N
(N#k)n
n=0
N#1
% = x[n]W
N
Nn
W
N
#kn
n=0
N#1
% = x[n] W
N
#kn
n=0
N#1
% = X *[k].
(b)
!
X[0] = x[n]W
N
0
n=0
N"1
# = x[n]
n=0
N"1
# which is real.
(c)
!
X[
N
2
] = x[n]W
N
(N / 2)n
n=0
N"1
# = ("1)
n
n=0
N"1
# x[n] which is real.

5.40 Given:
!
X[k] = x[n]W
N
nk
n=0
N"1
# .
(a) We know that:
!
X *[k] = x *[n]W
N
"nk
n=0
N"1
# .
Therefore, we can replace n with
!
N " n in the summation to obtain:


!
X *[k] = x *[N " n]W
N
"(N"n)k
n=0
N"1
# = x *[N " n]W
N
nk
n=0
N"1
# .


Thus:
!
DFT{x *[N " n]} = DFT{x *[#"n$
N
} = X *[k].

(b) We know that:
!
Re{x[n]} =
1
2
{x[n] + x *[n]}.

Taking the DFT of both sides and using the results of Part (a) we get:


!
DFT Re{x[n]} { } =
1
2
X[k] + X *["#k$
N
{ }.
(c) We know that:
!
j Im{x[n]} =
1
2
{x[n] " x *[n]}.Therefore:


!
DFT j Im{x[n]} { } =
1
2
X[k] " X *[#"k$
N
{ }.

(d) We know that:

!
x
cs
[n] =
1
2
{x[n] + x *["#n$
N
]}.
Not for sale. 26
Using the linearity property and results of Part (b) we get:


!
DFT{x
cs
[n]} =
1
2
{X[k] + X *[k]} = Re{X[k]}.
(e) We know that:
!
x
ca
[n] =
1
2
{x[n] " x *[#"n$
N
]}.
Using the linearity property and results of Part (b) we get


!
DFT{x
ca
[n]} =
1
2
{X[k] " X *[k]} = j Im{X[k]}.

5.41 For a real sequence, x[n] = x*[n], so taking the DFT of both sides results in:


!
X[k] = X *["#k$
N
].

Note that this is one of the properties listed in Table 5.2 and it implies:


!
Re{X[k]} + j Im{X[k]} = Re{X["#k$
N
]} # j Im{X["#k$
N
]}.

Comparing the real and imaginary parts we get:


!
Re{X[k]} = Re{X["#k$
N
]} and
!
Im{X[k]} = "Im{X[#"k$
N
]}.

Also,
!
X[k] = (Re{X[k]})
2
+ (Im{X[k]})
2


!
= (Re{X["#k$
N
]})
2
+ (Im{X["#k$
N
]})
2
= X["#k$
N
].


!
arg{X[k]} = tan
"1
Im{X[k]}
Re{X[k]}
#
$
%
&
'
(
= tan
"1
"Im{X[)"k*
N
]}
Re{X[)"k*
N
]}
#
$
%
&
'
(
= "arg{X[)"k*
N
]}.

5.42 To test for this, we use the properties of Table 5.1, which state that a DFT is real if the
generating sequence x[n] is circular conjugate symmetric and that a DFT is imaginary if
the generating sequence x[n] is circular conjugate anti-symmetric. Thus, we check if:


!
x[n] = x *["#n$
N
] or
!
x[n] = "x *[#"n$
N
].

(a) We can see that:
!
x
1
*[ "n
9
] = 5, "9, 4, 7, "8, "8, 7, 4, "9 { } = x
1
[n]

Thus,
!
X
1
[k] is real.

(b) We can see that:
!
x
2
*[ "n
9
] = 0, 4, "3, "7, 5, "5, 7, 3, " 4 { } = "x
2
[n]

Thus,
!
X
2
[k] is imaginary.

(c) We can see that:
Not for sale. 27

!
x
3
*["#n$
9
]
= 3, #1+ j9, #4 + j5, 5 # j5, 2 + j9, 2 # j9, 5 + j5, #4 # j5, #1# j9 { }


This would be equal to the negative of
!
x
3
[n], except the x[0] terms do not
match therefore the DFT
!
X
3
[k] is neither purely real nor purely imaginary.

(d) We can see that:

!
x
4
*["#n$
9
]
= j 3, 8 + j6, #2 + j5, 7 # j9, 7 # j6, #7 # j6, #7 # j9, 2 + j5, #8 + j6 { }


Again, this is neither equal to
!
x
4
[n] or
!
"x
4
[n], so
!
X
4
[k] is complex valued.

5.43 Since
!
x[n] is a length-11 real sequence, its DFT satisfies
!
X[k] = X *["#k$
11
]. Thus:

!
X[1] = X *["#1$
11
] = X *[10] =1.5 + j5.31,

!
X[3] = X *["#3$
11
] = X *[8] = #3.34 # j 3.69,

!
X[5] = X *["#5$
11
] = X *[6] = #7.55 # j13.69,

!
X[7] = X *["#7$
11
] = X *[4] = #12.44 # j12.7,

!
X[9] = X *["#9$
11
] = X *[2] = 2.49 + j19.12.


5.44 Since is a length-11 real sequence, its DFT satisfies
!
X[k] = X *["#k$
11
]. Thus:

!
X[1] = X *["#1$
11
] = X *[10] = #9.36 + j1.45,

!
X[3] = X *["#3$
11
] = X *[8] = 22.19 # j2.82,

!
X[6] = X *["#6$
11
] = X *[5] = #2.6 # j22.52,

!
X[7] = X *["#7$
11
] = X *[4] = 9.28 + j 3.37,

!
X[9] = X *["#9$
11
] = X *[2] =1.98 # j18.79.

5.45 Since the DFT
!
X[k] is real-valued, x[n] is circularly even:
!
x[n] = x["#n$
10
]. Therefore:

!
x[2] = x["#2$
10
] = x[8] = 6.26,

!
x[6] = x["#6$
10
] = x[4] = #3.1,

!
x[7] = x["#7$
10
] = x[3] = 8.58,

!
x[9] = x["#9$
10
] = x[1] = 6.2.

5.46 Since the DFT X[k] is imaginary-valued, x[n] is circularly odd:
!
x[n] = "x[#"n$
10
].
Therefore:

!
x[3] = "x[#"3$
10
] = "x[7] = 9.32,

!
x[6] = "x[#"6$
10
] = "x[4] = 3.1,

!
x[8] = "x[#"8$
10
] = "x[2] = 6.19,

!
x[9] = "x[#"9$
10
] = "x[1] = "4.2.

Not for sale. 28
5.47 (a)
!
y[n] = x
1
[n]
O
N x
2
[n] = x
1
[m]x
2
["n # m$
N
]
m=0
N#1
% .
Thus:
!
y[n]
n=0
N"1
# = x
1
[m]
m=0
N"1
# x[$n " m%
N
]
n=0
N"1
# = x
1
[n]
n=0
N"1
#
&
'
(
)
*
+
x
2
[n]
n=0
N"1
#
&
'
(
)
*
+
.

(b)
!
("1)
n
y[n]
n=0
N"1
# = x
1
[m]
m=0
N"1
# x[$n " m%
N
]("1)
n
n=0
N"1
#
!
= x
1
[m]
m=0
N"1
#
$
%
&
'
(
)
x
2
[N + m" n]("1)
n
+ x
2
[m" n]("1)
n
n=m
N"1
#
n=0
m"1
#
$
%
&
'
(
)
.

Replacing n with (N + n m) in the first sum and with (n m) in the second sum:

!
("1)
n
y[n]
n=0
N"1
# = x
1
[m]
m=0
N"1
#
$
%
&
'
(
)
x
2
[n]("1)
n"N+m
+ x
2
[n]("1)
n+m
n=m
N"1
#
n=0
m"1
#
$
%
&
'
(
)


!
= ("1)
n
x
1
[n]
n=0
N"1
#
$
%
&
'
(
)
("1)
n
x
2
[n]
n=0
N"1
#
$
%
&
'
(
)
.

5.48 We make use of the result of Problem 5.47, Part (b). Now,

!
("1)
n
n=0
3
# h
1
[n] =1" 4 "2 + 3 = "2,
!
("1)
n
n=0
3
# h
2
[n] = 5 + 4 "1" 3 = 5,
!
("1)
n
n=0
3
# h
3
[n] = "2 "5 + 2 + 4 = "1,
!
("1)
n
n=0
3
# h
4
[n] = "3"2 " 3" 4 = "12, and
!
("1)
n
n=0
3
# x[n] = 2 + 3+1" 4 = 2. We next compute
!
("1)
n
n=0
3
# h
1
[n]
$
%
&
'
(
)
("1)
n
n=0
3
# x[n]
$
%
&
'
(
)
= "2 * 2 = "4,
!
("1)
n
n=0
3
# h
2
[n]
$
%
&
'
(
)
("1)
n
n=0
3
# x[n]
$
%
&
'
(
)
= 5 * 2 =10,
!
("1)
n
n=0
3
# h
3
[n]
$
%
&
'
(
)
("1)
n
n=0
3
# x[n]
$
%
&
'
(
)
= "1* 2 = "2,
!
("1)
n
n=0
3
# h
4
[n]
$
%
&
'
(
)
("1)
n
n=0
3
# x[n]
$
%
&
'
(
)
= "12 * 2 = "24.

We compare the above 4 products with the following:
!
("1)
n
n=0
3
# y
a
[n] = "16 + 24 + 27 "25 =10,
Not for sale. 29
!
("1)
n
n=0
3
# y
b
[n] = "13"5 +1" 7 = "24,
!
("1)
n
n=0
3
# y
c
[n] = 25 + 6 "27 "8 = "4,
!
("1)
n
n=0
3
# y
d
[n] = 30 "20 "29 +17 = "2.
We observe
!
("1)
n
n=0
3
# y
d
[n]
$
%
&
'
(
)
= ("1)
n
n=0
3
# h
1
[n]
$
%
&
'
(
)
("1)
n
n=0
3
# x[n]
$
%
&
'
(
)
= "4,
!
("1)
n
n=0
3
# y
a
[n]
$
%
&
'
(
)
= ("1)
n
n=0
3
# h
2
[n]
$
%
&
'
(
)
("1)
n
n=0
3
# x[n]
$
%
&
'
(
)
=10,

!
("1)
n
n=0
3
# y
c
[n]
$
%
&
'
(
)
= ("1)
n
n=0
3
# h
3
[n]
$
%
&
'
(
)
("1)
n
n=0
3
# x[n]
$
%
&
'
(
)
= "2, and

!
("1)
n
n=0
3
# y
b
[n]
$
%
&
'
(
)
= ("1)
n
n=0
3
# h
4
[n]
$
%
&
'
(
)
("1)
n
n=0
3
# x[n]
$
%
&
'
(
)
= "24.

From these calculations, we can conclude that:

!
y
a
[n] = h
2
[n]
O
4
x[n], y
b
[n] = h
4
[n]
O
4
x[n], y
c
[n] = h
3
[n]
O
4
x[n], y
d
[n] = h
1
[n]
O
4
x[n].

5.49 We make use of the result of Problem 5.47, Part (b). Now,


!
("1)
n
b
1
[n]
n=0
3
#
= "13, ("1)
n
b
2
[n]
n=0
3
#
= "5, ("1)
n
b
3
[n]
n=0
3
#
= 9, ("1)
n
b
4
[n]
n=0
3
#
= 5,

!
("1)
n
n=0
3
#
a[n] = 5. We next compute

!
("1)
n
y
a
[n]
n=0
3
#
= "25, ("1)
n
y
b
[n]
n=0
3
#
= 25, ("1)
n
y
c
[n]
n=0
3
#
= 45, ("1)
n
y
d
[n]
n=0
3
#
= "65.
We then form

!
("1)
n
a[n]
n=0
3
#
$
%
&
&
'
(
)
)
("1)
n
b
1
[n]
n=0
3
#
$
%
&
&
'
(
)
)
= "65, ("1)
n
a[n]
n=0
3
#
$
%
&
&
'
(
)
)
("1)
n
b
2
[n]
n=0
3
#
$
%
&
&
'
(
)
)
= "25,
!
("1)
n
a[n]
n=0
3
#
$
%
&
&
'
(
)
)
("1)
n
b
3
[n]
n=0
3
#
$
%
&
&
'
(
)
)
= 45, ("1)
n
a[n]
n=0
3
#
$
%
&
&
'
(
)
)
("1)
n
b
4
[n]
n=0
3
#
$
%
&
&
'
(
)
)
= 25

Comparing the above values with
!
y
a
[0], y
b
[0], y
c
[0], y
d
[0], we conclude that:


!
y
a
[n] = b
2
[n]
O
4
a[n], y
b
[n] = b
4
[n]
O
4
a[n], y
c
[n] = b
3
[n]
O
4
a[n], y
d
[n] = b
1
[n]
O
4
a[n].
Not for sale. 30

5.50 (a) Using the circular convolution theorem of the DFT given in Table 5.3, we get:
!
DFT x["n # m
1
$
N
{ }
=W
N
km
1
X[k], DFT x["n # m
2
$
N
{ }
=W
N
km
2
X[k].

Hence:
!
W[k] = DFT(w[n]) = "W
N
km
1
X[k] + #W
N
km
2
X[k] = "W
N
km
1
+ #W
N
km
2
( )
X[k].

(b) Now we can write g[n] as:
!
g[n] =
1
2
x[n] + ("1)
n
x[n]
( )
=
1
2
x[n] +W
N
"(N / 2)n
x[n]
( )
.

Using circular frequency shifting theorem of the DFT given in Table 5.3, we get:
!
G[k] = DFT(g[n]) =
1
2
X[k] + X["k #
N
2
$
N
]
%
&
'
(
)
*
.

(c) Using circular convolution DFT theorem of the DFT given in Table 5.3, we get:

!
Y[k] = DFT(y[n]) = X[k]" X[k] = X
2
[k].

5.51 (a) Using circular time shifting theorem of the DFT given in Table 5.3, we get:

!
DFT x["n #
N
2
$
N
]
%
&
'
(
)
*
=W
N
k(N / 2)
X[k] = (#1)
k
X[k]. Hence,

!
U[k] = DFT(u[n]) = X[k] "("1)
k
X[k] =
2X[k], for k odd,
0, for k even.
#
$
%

(b)
!
V[k] = DFT{v[n]} = DFT x[n] " x[n "
N
2
]
#
$
%
&
'
(
= X[k] + X[k] = 2X[k].

(c)
!
y[n] = ("1)
n
x[n] =W
N
(N / 2)n
x[n]. Hence, using the circular frequency-shifting
property of the DFT given in Table 5.3, we get
!
Y[k] = DFT{y[n]} = DFT W
N
(N / 2)n
x[n]
{ }
= X["k #
N
2
$
N
].