Subject: Digital Signal Processing (TE321)

Practice Problem 2
Q1. Use the convolution theorem to calculate the circular convolution of the data
sequence {1, 1, 0, 1} & {1, 0, 0, 1}.

Q2. Calculate the DFT of the data sequence {0, 1, 1, 0} by using direct DFT
method & also using by DIT & DIF methods. Compare the number of complex
multiplications & additions in all three methods.

Q3. The first four sampled voltage values of a 10Hz bandwidth signal sampled at
125Hz were {0.5, 1, 1, 0.5} . Demonstrate how the DFT of this sequence may be
obtained using FFT.

Q4. Find the 8-point DFT of the following sequence characterized by the values:
x(1) = −1 , x(3) = 2 , x(5) = −6 , x(7 ) = 4
Considering;
- First block of N/4-point DFT produced 3 by addition & -7 by subtraction
- Second block of N/4-point DFT produced 8 by addition & 4 by subtraction
Obtain the values at each stage & propagate the diagram to the final stage.

Q5. Determine the Radix-2, 8-point FFT by butterfly method with the following data:
- First block of N/4 produces -5 by subtraction
- Second block of N/4 produces 8 by addition
- Third block of N/4 produces 7 by addition
- Fourth block of N/4 produces 9 by subtraction
- Bit reversed DIT sequence numbers are same i.e., 2
Show all calculations & find the weighted parameters. Furthermore if the speed
improvement factor (SIF) of all the four N/4 block accumulates to 16, then show
that the SIF will become half, if calculated for the following two N/2 blocks.