Digital Signal Processing

Assignment-5

1. Find the N -point DFT of the following sequences x[n]:

(a) x[n] = δ[n]

(b) x[n] = u[n] − u[n − N ]

2. Consider two sequences x[n] and h[n] of length 4 given by

π 
x[n] = cos n , n = 0, 1, 2, 3
2
 n
1
h[n] = , n = 0, 1, 2, 3
2

(a) Calculate y[n] = x[n] ⊛ h[n] by doing the circular convolution directly.
(b) Calculate y[n] by DFT.

3. Show that
1
x[n] = IDFT{X[k]} = [DFT{X ∗ [k]}]∗
N
∗
where denotes the complex conjugate and

X[k] = DFT{x[n]}.

4. Consider a sequence
x[n] = {1, 1, −1, −1, −1, 1, 1, −1}.

Determine the DFT X[k] of x[n] using the decimation-in-time FFT algorithm.
5. Consider the sequence
x(n) = δ(n) + 2δ(n − 2) + δ(n − 3).

(a) Find the four-point DFT of x(n).

(b) If y(n) is the four-point circular convolution of x(n) with itself, find y(n) and the
four-point DFT Y (k).
(c) With h(n) = δ(n) + δ(n − 1) + 2δ(n − 3), find the four-point circular convolution of
x(n) with h(n).

6. Compute the quantity

N
X −1
x1 (n) x2 (n)
n=0

for the following pairs of sequences.

1
 (a) 
2π
x1 (n) = x2 (n) = cos n , 0≤n≤N −1
N
(b)    
2π 2π
x1 (n) = cos n , x2 (n) = sin n , 0≤n≤N −1
N N
(c)
x1 (n) = δ(n) + δ(n − 8), x2 (n) = u(n) − u(n − N )

7. For the sequences

   
2π 2π
x1 (n) = cos n , x2 (n) = sin n , 0 ≤ n ≤ N − 1,
N N

determine the N -point:

(a) Circular convolution x1 (n) ⊛ x2 (n)

(b) Circular correlation of x1 (n) and x2 (n)
(c) Circular autocorrelation of x1 (n)
(d) Circular autocorrelation of x2 (n)

8. Given the eight-point DFT of the sequence

(
1, 0 ≤ n ≤ 3
x(n) =
0, 4 ≤ n ≤ 7

compute the DFT of the sequences:

(a) 
1, n = 0

x1 (n) = 0, 1 ≤ n ≤ 4

1, 5 ≤ n ≤ 7


(b) 
0, 0 ≤ n ≤ 1

x2 (n) = 1, 2 ≤ n ≤ 5

0, 6 ≤ n ≤ 7


9. Consider a finite-duration sequence

x(n) = {0, 1, 2, 3, 4}
↑

(a) Sketch the sequence s(n) with six-point DFT

S(k) = W2∗ X(k), k = 0, 1, . . . , 6

(b) Determine the sequence y(n) with six-point DFT

Y (k) = ℜ{X(k)}

2
 (c) Determine the sequence v(n) with six-point DFT

V (k) = ℑ{X(k)}

10. Let xa (t) be an analog signal with bandwidth B = 3 kHz. We wish to use an N = 2m -point
DFT to compute the spectrum of the signal with a resolution less than or equal to 50 Hz.
Determine:

(a) the minimum sampling rate,

(b) the minimum number of required samples, and
(c) the minimum length of the analog signal record.

11. Determine the N -point DFTs of the following length-N sequences defined for 0 ≤ n ≤
N − 1:
 
2πn
Xa [n] = sin
N
 
2 2πn
Xb [n] = cos
N
 
3 2πn
Xc [n] = cos
N

12. Determine the 4-point DFTs of each sequence of the following pairs of length-4 sequences
defined for 0 ≤ n ≤ 3 by computing a single DFT:

(a)
g[n] = {2, −1, 3, 0}, h[n] = {−2, 4, 2, −1}
(b)
x[n] = {−3, −2, 2, 4}, y[n] = {1, 2, 3, 4}

13. Determine the eight-point DFT of the signal

X[n] = {1, 1, 1, 1, 1, 1, 0, 0}

and sketch its magnitude and phase.

14. Compute the eight-point circular convolution for the following sequences:

(a)

x1 [n] = {1, 1, 1, 1, 0, 0, 0, 0}
 
3π
x2 [n] = sin n , 0≤n≤7
8

(b)
 n
1
x1 [n] = , 0≤n≤7
4
 
3π
x2 [n] = cos n , 0≤n≤7
8

3
15. The first five points of the eight-point DFT of a real-valued sequence are

{0.25, 0.125 − j0.3018, 0, 0.125 − j0.0518, 0}

Determine the remaining three points.

16. Consider the sequences

x1 (n) = {0, 1, 2, 3, 4}, x2 (n) = {0, 1, 0, 0, 0}, s(n) = {1, 0, 0, 0, 0}

↑ ↑ ↑

(where the arrows indicate the origin sample), and their five-point DFTs.

(a) Determine a sequence y(n) so that

Y (k) = X1 (k)X2 (k).

(b) Is there a sequence x3 (n) such that

S(k) = X1 (k)X3 (k)?

17. Compute the energy of the N -point sequence

 
2πk0 n
x(n) = cos , 0 ≤ n ≤ N − 1.
N

18. Let X[k] denote the N -point DFT of a length-N sequence x[n], with N even. Define two
length- N2 sequences given by

1
1

g[n] = x[2n] + x[2n + 1] , h[n] = x[2n] − x[2n + 1] ,
2 2
N
0≤n≤ − 1.
2
If G[k] and H[k], 0 ≤ k ≤ N2 − 1, denote N2 -point DFTs of g[n] and h[n], respectively,
determine the N -point DFT X[k] from these two N2 -point DFTs.

19. Let X(k) be the N -point DFT of the sequence x(n), 0 ≤ n ≤ N − 1. We define a 2N -point
sequence y(n) as
x n , n even,
  

y(n) = 2
0, n odd.

Express the 2N -point DFT of y(n) in terms of X(k).

20. Use the four-point DFT and IDFT to determine the sequence

x3 (n) = x1 (n) ∗ x2 (n),

where
x1 (n) = {1, 2, 3, 4}, x2 (n) = {4, 3, 2, 2}.
↑ ↑