Signals and DSP BEE502
VTU Question Bank
Module-3: Fast Fourier Transforms
1. Develop an 8-point decimation in frequency FFT algorithm. Draw the complete signal
Flow graph for N=8. 10M
2. Develop an 8-point decimation in Time FFT algorithm. Draw the complete signal
Flow graph for N=8. 10M
3. Compute the 8-Point DFT of the sequence x( n) = (1, 2, 3, 4, 4, 3, 2, 1) using Radix-2
DIT FFT algorithm. 10M
4. Compute the 8-Point DFT of the sequence x( n) = (1, 1, 1, 1, 0, 0, 0, 0) using Radix-2
DIT FFT algorithm. Draw the signal flow graph. 10M
5. Tabulate the number of complex multiplications, complex additions & Speed Improvement
factor for the direct computation of DFT and FFT algorithm for N = 8, 16, 32 &64. 8M
6. What is FFT? Discuss the advantages of FFT over DFT. 8M
7. Discuss the differences and similarities between DIT FFT and DIF FFT Algorithms. 5M
8. Given the sequences x1[n] and x2[n] below. Compute the circular convolution of x1[n] and
x2[n] for N = 4. Use-DIT-FFT algorithm. x1[n]= {2, 1, 1; 2} and x2[n] = {1, -1, -1, 1} 10M
9. First 5 samples- of the 8-point DFT of a real valued sequence is given by x(0)=0, x(1) = 2 +
j2, x(2) = -j4, x(3) = 2 - j2, x(4) = 0. Determine the remaining points, hence find the original
sequence x[n] using DIF FFT algorithm. 10M
10. Solve for the 4-point circular convolution of x(n) and h(n) using Radix-2 DIF-FFT algorithm.
x(n) = (1, 1, 1, 1) and h(n) = (1, 0, 1, 0). 10M
11. Determine the 8-Point DFT of the real valued sequence x(n)= {2,1, 4, 6, 5, 8, 3, 9}. by using
Radix-2 DIF- FFT algorithm. 10M
12. Determine the 8-Point DFT of the real valued sequence x( n) = (n + 1) by using Radix-2 DIF-
FFT algorithm. 10M
13. Determine the IDFT of the sequence x(n) using Inverse 8-Point DFT by using DIT-FFT
algorithm. X(K) ={ 4, 1-j2.414, 0, 1-j0.414, 0, 1+j0.414, 0, 1+j2.414). 10M
Department of EEE, SIRMVIT
Page 1