Scribd
Upload
62 views

Assignment FALL2018

This document contains 20 questions related to digital signal processing concepts like impulse response, linearity, causality, stability, discrete time systems, difference equations, discrete convolution, discrete Fourier transform (DFT), inverse discrete Fourier transform (IDFT), and z-transform. The questions cover topics such as determining if a system is causal/stable, testing for linearity, constructing block diagrams, computing convolutions, taking DFTs and IDFTs, and finding z-transforms and regions of convergence.

Uploaded by

Uday
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
62 views

Assignment FALL2018

This document contains 20 questions related to digital signal processing concepts like impulse response, linearity, causality, stability, discrete time systems, difference equations, discrete convolution, discrete Fourier transform (DFT), inverse discrete Fourier transform (IDFT), and z-transform. The questions cover topics such as determining if a system is causal/stable, testing for linearity, constructing block diagrams, computing convolutions, taking DFTs and IDFTs, and finding z-transforms and regions of convergence.

Uploaded by

Uday
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/ 2

DIGITAL ASSIGNMENT NO 1

ECE 2006 DIGITAL SIGNAL PROCESSING

A1 SLOT FALL 2018-19

1. For each impulse response determine whether the corresponding system is causal and stable

i) h (n) = sin (nπ/2)

ii) e2n u(n-1)

2. Test the linearity of the system y (n) =x (n) – b x(n-1)

3. Test the causality of the systems i) y (n2) ii) y (n) = x (2n)

4. Test the stability of the system y (n) = x (-n-2)

5. Construct the block diagram and signal flow graph of the discrete time systems whose input –

output relations are described by the difference equations

y(n) = 0.25 y(n-1) + 0.5 x(n) + 0.75 x(n-1)

6.Find the discrete convolution of the sequences x(n) = { 1,2,-1,1} ,h(n) = {1,0,1,1}

7. Compute the convolution y (n) = x (n) * h (n) of the signals

X (n) = {1, 1, 0, 1, 1} and h (n) = {1, -2, -3, 4}

8. Find the DFT of the sample data sequence x (n) = {1, 1, 2, 2, 3, 3 } and compute the

corresponding amplitude and phase spectrum.


9. Determine the 8 point DFT of the sequence x (n) = { 1, 1, 1, 1, 1, 1, 0, 0}

10. Determine the IDFT of X (K) = {3, (2+j), 1, (2-j)}

11.Find the DFT of a sequence x(n) = { 1, 2, 3, 4, 4, 3, 2, 1} using DIT FFT algorithm.

12. Compute IDFT of the sequence

X(k) = {7, -0.707 – j 0.707 ,-j, 0.707-j0.707, 1, 0.707 + j0.707, j, -0.707+j0.707 }

13. Find the DFT of the sequence x(n) ={1, 0, 0, 1} using DIF algorithm.

14.Find the 8 point DFT sequence x(n) ={1, 2, 2, 1, 1 ,2 , 2, 1} using DIF FFT algorithm.

15. Find the IDFT of the sequence X (k)= {1, 1+j, 2, 1-j2, 0, 1+2j, 0, 1-j}

16. Compute 4 point DFT of x (n) = {5, 0, 1-j, 0, 1, 0, 1+j, 0}

17. Find the z transform and ROC of the signal x (n)= [3(3)n – 4(2)n] u(n)

18. Find the z transform of the discrete time signal and ROC x (n) = u(n-2)

19. Find the 4-point DFT of the sequence x (n) = cos (nπ/4).

20. Determine the IDFT of X (k) = { 3, (2+j), 1, (2-j) }

You might also like