VSA GROUP OF INSTITUTIONS,SALEM-10 DEPT OF ECE DIGITAL SIGNAL PROCESSING UNIT-1:QUESTION BANK PART-A 1.

Define DFT of a discrete time sequence.(Nov-11) The DFT is used to convert finite discrete time sequence x (n) to an N- point frequency domain sequence denoted X (K). The N-point DFT of a finite duration sequence x (n) of length L, where L<=N is defined as,

Where is a primitive N'th root of unity. 2. Define IDFT(nov-11) The IDFT is used to convert the N-point frequency domain sequence denoted X(k) to an N-point time domain sequence. The IDFT of a finite duration sequence X (k) of length L defined as,

3. Give the application of DFT.(apr-06) a). The DFT is used for spectral analysis using a digital computer. b). The DFT is used to perform filtering operations on signals using digital computer. 4. Compute the number of multiplications needed in the FFT computation of DFT of a 64 point sequence.(nov/dec-2010) The number of complex multiplications required using direct computation is N2 = 642 = 4096. The number of complex multiplications required using FFT is N log2 N = 64 log264 = 192 5. Define DFT pairs.(Nov/dec-10)

X(n)---DFT----X(K) 6. What are the applications of FFT algorithms?(may/june-09) The applications of FFT algorithm includes, a). Linear Filtering b). Correlation c). Spectrum analysis. d)Filter simulation e)Pattern regulation. 7. What are the advantages of FFT algorithm over DFT?(may/june-07) i.FFT algorithms reduces the computation time required to compute DFT.

ii. FFT algorithms are computationally efficient. iii. FFT algorithms exploit the periodicity and symmetry properties of DFT. iv.FFT results in fast computation and save memory requirement 8. Draw and explain the basic butterfly diagram of DIF radix-2 FFT algorithm.(nov-07) 9. compute radix 4 DIT-FFT For given sequence x(n)={1,-1,1,-1} 10. Compute DFT of the sequence x(n) = {1,2} {April -2004} SOLUTION: X(K) = x(n) e^(-j2nk/N) K=0,1,2N-1 For N=2, X(K) = x(n) e^(-j2nk/2) K=0,1 For K=0, X(0) = x(n) = x(0)+x(1) =1+2 ; X (0) = 3 For K=1, X(1) = x(n) e^(-jn/2) = x(0)+x(1) e^(-j/2) = 1+2(cos /2 j sin /2) = 1+2(0-j)=1-2j X(k)={3,1-2j} 11. What is phase factor or twiddle factor? (nov-11) The complex number WN is called phase factor or twiddle factor. The WN represent a complex number e^ (-j2 /N). It also represents an Nth root of unity. PART-B 1. 2. 3. 4. Find DFT of a sequence x(n)={1,1,0,0} (8) Find IDFT of a sequence X(K)={1,0,1,0} (8) Find DFT of a sequence x(n)={1,1,-2,-2} (8) Find DFT of a sequence x(n)=1,0 n7 =0,otherwise And also plot magnitude and phase plot. (16) 5. Find DFT of a sequence x(n)={1,1,1,1,1,1,0,0} And also plot magnitude and phase plot. (16) 6. Find IDFT of a sequence X(k)={5,0,1-j,0,1,0,1+j,0 } And also plot magnitude and phase plot. (16)

7. Find DIT-FFT of a sequence x(n)=1,0 n7 =0,otherwise (16) 8. Find DIT-FFT of a sequence x(n)=cos(n/4), 0 n7 (16)