Scribd
Upload
136 views

17EC3601 - DSP - Assignment - I Questions - 2020-21

This document contains 14 questions related to digital signal processing concepts like the discrete Fourier transform (DFT), fast Fourier transform (FFT), linear convolution, circular convolution, and properties of the DFT. The questions ask the student to compute DFTs and IDFTs of sequences, determine the number of operations required for an N-point DFT, explain overlap-add and overlap-save methods for filtering long sequences, and utilize properties of the DFT like linearity, time shifting, and frequency shifting.

Uploaded by

Mmk Reddy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
136 views

17EC3601 - DSP - Assignment - I Questions - 2020-21

This document contains 14 questions related to digital signal processing concepts like the discrete Fourier transform (DFT), fast Fourier transform (FFT), linear convolution, circular convolution, and properties of the DFT. The questions ask the student to compute DFTs and IDFTs of sequences, determine the number of operations required for an N-point DFT, explain overlap-add and overlap-save methods for filtering long sequences, and utilize properties of the DFT like linearity, time shifting, and frequency shifting.

Uploaded by

Mmk Reddy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

V R Siddhartha Engineering College (Autonomous): E C E Department: Vijayawada

3/4 B. Tech VI – Semester Sections: A, B, C & D Year: 2020-21


17EC3601 – Digital Signal Processing
Assignment - I Questions
1. How many complex and real multiplication and addition operations are required to compute N-
point Direct DFT?
2. Find the four point DFT and IDFT of the sequence x ( n ) = {1, −1,1, −1} . Plot their magnitude and
phase responses.
3. State and Prove [a] Linearity, [b] Periodicity, [c] Time reversal, [d[ Circular time shift, [e] Circular
frequency shift, [f ] Complex Conjugate, [g] Multiplication , [h] Circular Convolution , [i] Parseval’s
theorem properties of DFT.
4. Explain the filtering of long data sequences using DFT. i) Overlap save method and ii) Overlap add
method.
5. Given the system impulse h(n) = { 1, 0, 1 } and input sequence x(n) = { -1, 2, -1, 0, 1, 3, -2, 1, -3, -2, -1,
0, -2 }. Compute y(n) = x(n) * h(n) using Overlap-Add and Overlap-Save methods.
6. Draw the butterfly diagram for 8-point FFT calculation and briefly explain. Use Decimation in Time
and Decimation in Frequency approach.
7. Compute DFT of the sequence x(n)={2,1,2,1,1,2,1,2} using radix-2 DITFFT and DIFFFT algorithms.
8. Consider the 12 length sequence, defined for 0 ≤ n ≤ 11 , x[n] = {3, −1, 2, 4, −3, −2, 0,1, −4, 6, 2,5}
11 11
without computing DFT find the following i) X(0) ii) X(6) iii) ∑ X (k )
k =0
iv) ∑e
k =0
− j 4π k /6
X (k )

11 2

v) ∑
k =0
X (k ) .

9. The 14 point DFT of x[n] is X(k) with first eight DFT coefficients X(0)=12, X(1)=-1+j3, X(2)=3+4j,
X(3)=1-j5, X(4)=-2+2j, X(5)=6+3j, X(6)=-2-j3, X(7)=10. Determine the remaining samples of X(k).
Evaluate the following functions of x[n] without computing IDFT of X(k). i) x(0) ii)x(7)
13 13
iii) ∑ x[n]
n=0
iv) Signal Energy v) ∑e
n =0
j 4π n /7
x[n] vi) DFT(x(n-2)) vii)DFT( x∗ (n) )
2
viii)DFT (x(-n)) ix) DFT( x (n) ) x) DFT( x(n) ⊗ x(n) )

10. An input sequence x[n] = {2,1,3, 4} is applied to discrete time system with impulse response
h[n] = {1, 2,1} . Determine the response of the system using (i) Linear convolution, ii) Linear through
circular convolution using DFT & IDFT approach.
11. The 4-point DFT of a real discrete time sequence x(n) is given by X [ k ] , where n=0,1,2,3 and
k=0,1,2,3. If X[0]=5; X[1]= 1+j1; X[2]=0.5; find X[k] at k=3 and x(n) at n=0.
12. The 4-point DFT of a sequence is given by X [ k ] = {4, − j 2, 0, j 2} . Find the DFT of x 2 ( n )
N −1
2π 2π
13. If x 1 (n) = cos( n) and x2 (n) = sin( n) , then compute ∑ x1 (n).x2∗ (n) .
N N n =0

n
1
14. Compute the DFT of the following finite length sequence x ( n ) =   u ( n + 3) ; n=0, 1, 2, 3.
2

17EC3601 – Digital Signal Processing 1

You might also like