EE605 Department of Electrical Engineering 2019-20-I

Exercise Set-9

1. Suppose x̃[n] is a periodic sequence with period N.Then x̃[n] is also periodic with period 3N. Let X̃[k]
denote the DFS coefficients of x̃[n] considered as a periodic sequence with period N and let X̃3 [k] denote
the DFS coefficients of x̃[n] considered as a periodic sequence with period 3N. Express X̃3 [k] in terms
of X̃[k].
2. Figure below shows a finite length sequence x[n]. Sketch the sequences x1 [n] and x2 [n] specified as

x1 [n] = x[((n − 2))4 ], 0 ≤ n ≤ 3,

x2 [n] = x[((−n))4 ], 0 ≤ n ≤ 3.

x[n]

6 5
4
3

n
0 1 2 3

3. Consider a finite-length sequence x[n] of length N . Two finite-length sequences y[n] and z[n] of length
2N are constructed from x[n] as given below

x[n], 0 ≤ n ≤ N − 1,
y[n] =
 0, otherwise.
 x[n], 0 ≤ n ≤ N − 1,
z[n] = −x[n − N ], N ≤ n ≤ 2N − 1,
0, otherwise.


The N-point DFT of x[n] is denoted by X[k], and the 2N-point DFT of y[n] and z[n] are denoted by
Y [k] and Z[k] respectively.
(a) Express Y [k] and Z[k] in terms of X[k].
(b) Determine the simplest possible relationship to obtain X[k] from Z[k].
4. Let x[n] be a finite-length sequence given by

{x[n]} = {x[0] = 2, 1, 1, 0, 3, 2, 0, 3, 4, 6 = x[9]}

with a 10-point DFT given by X[k]. Evaluate the following functions of X[k] without computing the
DFT.
P9 P9 −j(4πk/5)
P9 2
A. X[0] B. X[5] C. k=0 X[k] D. k=0 e X[k] E. k=0 |X[k] |

5. Consider a real finite-length sequence x[n] with Fourier transform X(ejω ) and DFT X[k]. If

Im{X[k]} = 0, k = 0, 1, · · · , N − 1.

Can we conclude that

Im{X(ejω )} = 0, −π ≤ ω ≤ π?
State your reasoning if your answer is yes. Give a counter-example if your answer is no.
6. Let x[n] be a real-valued 5-point sequence whose 7-point DFT is denoted by X[k]. If real-part of X[k]
is the 7-point DFT of g[n], show that g[0] = x[0], and determine the relationship between g[1] and x[1].
EE605 Exercise Set-9 (Continued)

7. Consider two finite duration sequences x[n] and y[n]. The sequence x[n] is one for 0 ≤ n ≤ 99 and zero
otherwise. The sequence y[n] is one for 0 ≤ n ≤ 9 and zero otherwise.
(a) Determine and sketch the linear convolution x[n] ∗ y[n].
(b) Determine and sketch the 100-point circular convolution x[n]
100 y[n].

(c) Determine and sketch the 110-point circular convolution x[n]

110 y[n].

8. Consider two finite duration sequences x[n] and y[n]. The sequence x[n] is zero for n < 0, n ≥ 40, and
9 < n < 30, and y[n] is zero for n < 10 and n > 19. Let w[n] denote the linear convolution of x[n] and
y[n]. Let g[n] denote the 40-point circular convolution of x[n] and y[n].
(a) Determine the values of n for which w[n] can be nonzero.
(b) Determine the values of n for which w[n] can be obtained from g[n]. Explicitly specify the index
values.
9. Consider a 20-point finite-duration sequence x[n] with Fourier transform X(ejω ).
4π
(a) If it is desired to evaluate X(ejω ) at ω = 5 by computing one M-point DFT. Find the smallest
possible value of M.
10π
(b) If it is desired to evaluate X(ejω ) at ω = 27 by computing one L-point DFT. Find the smallest
possible value of L.
10. Consider the sequence x[n] shown in figure for Exercise 5.
(a) Sketch the finite length sequence y[n] whose 6-point DFT is

Y [k] = W64k X[k],

where X[k] is 6-point DFT of x[n].

(b) Sketch the finite length sequence w[n] whose 6-point DFT is

W [k] = Re{X[k]}.

(c) Sketch the finite length sequence q[n] whose 3-point DFT is

Q[k] = X[2k], k = 0, 1, 2.

11. Suppose that we want to compute 63-point circular convolution of two 63-point sequences x[n] and h[n].
(a) It is possible to compute the 63-point circular convolution of x[n] and h[n] using a number of
64-point DFTs, inverse DFTs, and overlap-add method. Workout a procedure for this.
(b) Specify an algorithm that computes the 63-point circular convolution of x[n] and h[n] using two
128-point DFTs and one 128-point inverse DFT.
(c) We could also compute the 63-point circular convolution of two 63-point sequences x[n] and h[n] by
computing their linear convolution and aliasing the result. In terms of number of multiplications,
which of the three methods is most efficient? Which is least efficient?
12. Input to the system shown below is a finite length sequence x[n] such that it is zero for n < 0 and n > 63.
Express y[n] and r[n] in terms of the sequence x[n].
X[k] R[k] Y [k]
x[n] 64-point DFT ↓2 ↑2 64-point IDFT y[n]

R[k]
32-point IDFT r[n]

Page 2