DSP Assignment-1: H(S) 2/ (S +1) (S +2) Into H (Z) - Assume T 1 Sec
The document discusses different digital signal processing concepts including linear and circular convolution, DFT, FIR and IIR filters, impulse invariance method, DIF and DIT FFT algorithms, twiddle factors, applications of DSP, circular convolution, comparing FIR and IIR filters, DIT FFT algorithm, overlap add and save methods, 4-point and 8-point DFT, and bilinear transformation.
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
0 ratings0% found this document useful (0 votes)
43 views1 page
DSP Assignment-1: H(S) 2/ (S +1) (S +2) Into H (Z) - Assume T 1 Sec
The document discusses different digital signal processing concepts including linear and circular convolution, DFT, FIR and IIR filters, impulse invariance method, DIF and DIT FFT algorithms, twiddle factors, applications of DSP, circular convolution, comparing FIR and IIR filters, DIT FFT algorithm, overlap add and save methods, 4-point and 8-point DFT, and bilinear transformation.
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/ 1
DSP ASSIGNMENT-1
1) Differentiate between linear convolution and circular
convolution. 2) Find 4-point DFT of the sequence x (n) = [-1,2,0,1] plot magnitudes and phases of DFT and comment on result. 3) Compare FIR and IIR filters. 4) Using impulse invariance method transform H(s) =2/(s +1) (s +2) into H (z). Assume T = 1 sec. 5) What are the differences and similarities between DIF and DIT algorithms? 6) Compute 4-Pt DFT of x[n] = {1, 2, 3, 4} using DIF – FFT algorithm. 7) What is twiddle factor? 8) What are applications of Digital Signal Processing? 9) Find the circular convolution of x1(n)= {1, 1, 1, 1} and x2(n) = {1,2, 2, 1}. 10) Differentiate between FIR and IIR filters. 11) Determine 8-Pt DFT of the sequence x(n) ={1, 2, 3, 2, 1, 2, 3, 2} using DIT – FFT algorithm. 12) Compare overlap - add & overlap - save methods. 13) Find 4-point DFT and 8-point DFT of the sequence x (n) = [1 1 1] plot magnitudes and phases of DFT and comment on result. 14) Explain bilinear transformation techniques briefly. 15) Using Bilinear transformation obtain H(z) if H(S)=2/(s+1)(s+2) assume T=1 sec