SRI KRISHNADEVARAYA EDUCATIONAL TRUST
SIR M VISVESVARAYA INSTITUTE OF TECHNOLOGY
(Affiliated to VTU-Belagavi, Recognized by AICTE and Accredited by NBA & NAAC)
Krishnadevarayanagar, Off Kempegowda International Airport Road, Hunasamaranahalli, Bengaluru – 562 157
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
Subject: Digital Signal Processing Subject code: BEC502
Semester/Branch: V/ECE
Question Bank
Module 3: DFT properties & FFT Algorithms
Q. No. Question COs
1. State and prove the following properties of DFT. CO2
i) Circular Time Shift
ii) Time Reversal
iii) Circular Frequency Shift
iv) Complex Conjugate
v) Multiplication of 2 sequences
vi) Parseval’s theorem
2. For the sequence x(n)= {-1,2,3,0,-4,1,2,-3} calculate the following without CO2
computing DFT. (i)∑7𝑘=0 𝑋(𝐾) (ii)∑7𝑘=0|𝑋(𝐾)|2
3. Let x(n) be a finite length sequence with X(K)={10,1-j,4,1+j} using the properties CO2
of DFT, find the DFT of the following.
𝜋𝑛
(i)𝑥1 (𝑛) = 𝑒 𝑗 2 𝑥(𝑛) (ii) 𝑥2 (𝑛) = 𝑥((−𝑛))4
4. By means of DFT & IDFT, determine the response of the FIR filter with impulse CO2
response ℎ(𝑛) = {5, 6, 7} to the input sequence 𝑥(𝑛) = {1, 2, −1, 5, 6}.
5. Using overlap & save method, compute the output of an FIR filter with impulse CO2
response ℎ(𝑛) = {3,2, 1, 1} and input 𝑥(𝑛) = {1,2,3,3,2,1,-1,-2,-3,5,6,-1,2,0,2,1}
use only 6 – point circular convolution in your approach.
6. Using overlap & add method, compute the output of an FIR filter with impulse CO2
response ℎ(𝑛) = {1, − 2, 3} and input 𝑥(𝑛) = {2, −2, 8, −2, −2, −3, −2, 1, −1, 9, 1,
3} use only 5 – point circular convolution in your approach.
7. Derive the Radix-2 DIT-FFT algorithm and draw the signal flow graph for N=8. CO3
8. Find the DFT of x(n) = {2,4,6,8,3,6,9,12} using DIT-FFT algorithm. CO3
9. Find IDFT of X(k) = {36, -4+9.65i, -4+4i, -4+1.65i, -4, -4-1.65i, -4-4i, -4-9.65i} CO3
using DIT-FFT.
10. Determine the number of complex multiplications and complex additions required CO3
to compute N point DFT and radix 2 FFT algorithm. Compare the complex
additions and complex multiplications for the direct computation of DFT versus
FFT algorithm for N=128.
CO2: Compute the response of an LTI system using time and frequency domain techniques.
CO3: Develop algorithms for the efficient computations of DFT and IDFT.