DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
ASSIGNMENT -4(UNIT IV)
COURSE: DIGITAL SIGNAL PROCESSING CODE: BEC-503
YEAR/SEM: 3rd/ Vth SESSION: 2024-25
ALL QUESTIONS ARE FROM CO 4
CO 4: Define the principle of discrete Fourier transform & its various properties and concept of circular
and linear convolution. Also, students will be able to define and implement FFT i.e. a fast computation
method of DFT.
Note: Solve any 5 Questions
1. Compute (a) linear and (b) circular periodic convolutions of the two sequences
x1(n)= {1,1,2,2} and x2(n)= {1,2,3,4}. (c) Also find circular convolution using the
DFT and IDFT.
2. Find the convolution of two finite duration sequences
1, −1 ≤ 𝑛 ≤ +1 1, −1 ≤ 𝑛 ≤ +1
𝑥 (𝑛 ) = { and ℎ (𝑛 ) = {
0, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒 0, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
3. What is difference between linear and circular convolution
4. Determine the IDFT of X(k) = {3,(2+j),1,(2-j)}.
5. Given x(n) = {0,1,2,3,4,5,6,7}, find X(k) using DIF FFT algorithm.
6. Given x(n) = {0,1,2,3,4,5,6,7}, find X(k) using DIT FFT algorithm.
7. Given x(n) = 2n and N=8, find X(k) using DIT FFT algorithm.
8. Explain DIF FFT algorithm
FACULTY:
Prof. (Dr) Seema Nayak
