0% found this document useful (0 votes)
93 views5 pages

DSP 1st Exam Solutions

This document contains the solutions to 4 questions on a Digital Signal Processing exam. Q1 involves convolving and decimating signals. The convolution of two signals X(n) and a filter [1,1] is shown to produce the signal Y(n). Decimation is performed on Y(n) to produce Y3(n) and Y4(n). Upscaling and convolving with other filters produces additional signals. Q2 involves finding the sampling frequency of various signals obtained by filtering and decimating a signal. The least common multiple and fundamental common multiple of the sampling frequencies is found. Q3 analyzes properties of a system with output Y(n)=cos(n
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
0% found this document useful (0 votes)
93 views5 pages

DSP 1st Exam Solutions

This document contains the solutions to 4 questions on a Digital Signal Processing exam. Q1 involves convolving and decimating signals. The convolution of two signals X(n) and a filter [1,1] is shown to produce the signal Y(n). Decimation is performed on Y(n) to produce Y3(n) and Y4(n). Upscaling and convolving with other filters produces additional signals. Q2 involves finding the sampling frequency of various signals obtained by filtering and decimating a signal. The least common multiple and fundamental common multiple of the sampling frequencies is found. Q3 analyzes properties of a system with output Y(n)=cos(n
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/ 5

Digital Signal Processing (DSP)

1st Exam Solutions 11\11\2021


By : Student name
“IIPS”

Q1)
X (n) * [1,1]

Y1(n) = X (n) * [-1, 1] 4 2 -1 3


1 4 2 -1 3
1 4 2 -1 3

4 6 1 2 3

Y2(n) =

4 2 -1 3
-1 -4 -2 1 -3
1 4 2 -1 3
-4 2 3 -4 3

Index 0 1 2 3 4
Y1(n) 4 6 1 2 3

Index 0 1 2 3 4
Y2(n) -4 2 3 -4 3

So the y1(n) becomes y3(n) after decimation = [ 6,2]

Old Index 1 3
New index 0 1
Y3(n) 6 2
1
So the y2(n) becomes y4(n) after decimation = [ 2,-4]

Old Index 1 3
New index 0 1
Y4(n) 2 -4

Let the (h ↑ ) operator be an up sampling ( interpolation ) equal to 2

Y5(n) = [ 6,0,2]

Y6(n) = [ 2,0,-4]

y5 (n) * 0.5[1,1]

6 0 2
0.5 3 0 1
0.5 3 0 1

3 3 1 1
y7(n) = Y6 (n) * 0.5[1,-1]

2 0 -4
y8(n) = 0.5 1 0 -2
-0.5 -1 0 2

1 -1 -2 2
y7+y8 = y9(n)

[3,3,1,1] + [1,-1,-2, 2] = [4,2,-1,3] = y(n)

Y(n) = X(n)

2
Q2)
( ) ( ) ( )
( )
( ) ( ) ( )

y1(n)= ( )

N1=r*R R=2 =10 r=1 N1=10

Y2(n)= ( )

N2=r*R R= 2 =20/3 r=3 N2=20

Y3(n)= ( )

N3= r*R R= 2 /0.4 =20/4 =5 r=1 N3=5

LCM=[ 10,20,5]=20

Y4(n)= ( )

N4=r*R R= =8 r=1 N4=8

Y5(n)= ( )

N5=r*R R= = 6 r=1 N5=6

Y6(n)= ( )

N6=r*R R= =4 r=1 N6=4

FCM=[8,6,4] =2

N=20/2=10 periodic

3
Q3)
1- Y(n)=cos(n+1) X(n-2)

Y(-2)= cos(-1)x(-4)

Y(-1)= cos(0)x(-3)

Y(0)= cos(1)x(-2)

Y(1)= cos(2)x(-1)

Y(2)= cos(3)x(0)

System is causal because y(n) depends on x(n-2) in time n (depends on past)

2-
Y1(n)= cos(n+1)x1(n-2)
Y2(n)= cos(n+1)x2(n-2)
Y1(n) + Y2(n)= cos(n+1)x1(n-2) + cos(n+1)x2(n-2)
= cos(n+1)[x1(n-2) + x2(n-2)]
X(n)= x1(n) + x2(n)
Y(n)= cos(n+1)[x1(n-2) + x2(n-2)]
y(n)= Y1(n) + Y2(n)
System is linear
3-
Let | ( )|
( ) has a limited value between -1 and 1 (limited output for all n)
( )
System is stable
4-
Delay:
( ) ( ) ( )
Replace
( ) ( ) ( )

System is time variant

4
Q4) For x(n)=[1,1,1,1,2] plot the signals :

a) x(n-1) δ(n)

b) x(3-n)

c) x(n)u(n-1)

d) x(4n)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy