Digital Signal Processing

Homework3
Discrete Fourier Transform

Q1) Compute DFT coefficients using direct method for the following signals:

1) x1(n) = [2,0,2,0]

2) x2(n) = [0,0,1,0,0]

3) x3(n) = [1, j, j,1]

4) x4(n) = [3 ,-3,3,-3]

Q2) ) Given DFT coefficients X(k), compute IDFT using direct method:

1) X1(k) = [5, -2j, 3, 2j]

2) X2(k) = [4, -5, 3, -5]

3) X3(k) = [0, j, -2j, -j]

Q3) Define the following important properties of DTFT:

1) Periodicity

2) Circular folding

3) Conjugate symmetric

4) Circular shift

5) Circular Convolution

Q4) The first five values of 8-point DFT of a real-valued sequence x(n) are given by:

[ 0.25, 0.125-j0.3 , 0 , 0.125-j0.06 , 0.5 ]

Determine the DFT of each of the following sequences using properties:

1) x1(n) = x((2-n))8

2) x2(n) = x((n+5))8
3) x3(n) = x(n) ©8 x((-n))8

Q5) Calculate the N-point circular convolution for the following sequences:

1) x1(n) = [1,1,1,1] , x2(n) = cos(πn/4) , N = 8

2) x1(n) = [1,-1,1, -1] , x2(n) = [1, 0 , -1 , 0] , N = 4

Q6) Given the sequences x1(n) and x2(n) shown below:

x1(n) = [2, 1, 1,2] and x2(n) = [1, -1, -1, 1]

1) Compute the circular convolution between x1(n) and x2(n)

2) Compute the linear convolution using circular convolution

Q7) Compute the 8-point DFT using Radix-2 DIT FFT algorithm for the following signal:

x(n) = cos(πn/2) , N = 8

Q8) Verify your solution results of Q7 by resolving it using Radix-2 DIF FFT algorithm