Scribd
Upload
29 views

DSP Iat1 Final

Uploaded by

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

DSP Iat1 Final

Uploaded by

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

MOHAMED SATHAK ENGINEERING

COLLEGE KILAKARAI 623 806


Department of Electronics & Communication Engineering
(Accredited by
NAAC)
Internal Assessment Test -I
SUBJECT CODE/NAME : EC8553- Discrete Time Signal Processing DATE : 02-09-2022

BRANCH / SEMESTER : ECE / V TIME : 2.30 -4.00 PM


ACADEMIC YEAR : 2022- 2023 MARK: 50
CO1: Able to analyze the signal performance in frequency domain using Fourier transform, FFT and also gathers knowledge about
convolution with the help of linear filtering

BLOOM'S
TAXONOMY
Remembering Applyi Evaluati
ng ng
Understanding Analyzi Creating
ng

PART A (5 x 2 = 10 marks)

CO A Indicate the number of stages, the number of complex multiplications at each stage, and the total (2)
1 1. number of additions required to compute 64-point FFT using radix-2 algorithm
CO R 2 What is in place computation and what is its advantage? (
1 . 2
)
CO R 3 What is twiddle factor? (
1 . 2
)
CO A 4 What is the relationship between DTFT and DFT? (
1 . 2
)
CO A 5 Determine the IDFT of Y(k) = {1,0,1,0} (
1 . 2
)

PART B (2 x 13 + 1*14 = 40 marks)


CO1 E 6. Determine the DFT of the sampled data sequence x(n)={1,1,2,2,3,3} and (14)
compute the corresponding amplitude and phase spectrum

CO1 E 7. Determine the DFT of the sequence x(n)={1,2,3,4,4,3,2,1} using DIT FFT (13)
Algorithm
Determine the DFT of the sequence x(n)=n+1 for N=8 using DIF FFT (13)
CO1 E 8 Algorithm
Prepared By Verified By Approved By

You might also like