Scribd
Upload
66 views1 page

DSP-exam Question

The document outlines an end-semester exam for a Digital Signal Processing course, featuring various questions on discrete-time signals, sampling rates, convolution, discrete Fourier transforms, system linearity, digital filter design, and frequency response. It includes specific calculations and theoretical inquiries related to signal processing concepts. The exam requires students to demonstrate their understanding of key principles and apply mathematical techniques to solve problems.

Uploaded by

enisknlbs1
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
66 views1 page

DSP-exam Question

The document outlines an end-semester exam for a Digital Signal Processing course, featuring various questions on discrete-time signals, sampling rates, convolution, discrete Fourier transforms, system linearity, digital filter design, and frequency response. It includes specific calculations and theoretical inquiries related to signal processing concepts. The exam requires students to demonstrate their understanding of key principles and apply mathematical techniques to solve problems.

Uploaded by

enisknlbs1
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/ 1

Student name: …………………………………………….. Date: ………………….

DIGITAL SIGNAL PROCESSING, ERASMUS course 2020


End-semester Exam
1. Give the formula for the discrete-time signal x(n) obtained after sampling the continuous-time signal
xa (t )  5t  e 4 t sin(6 t ) at time instants tn=n Ts with sampling period Ts=0.5s.
2. What will be the apparent (true or aliased) frequency of a signal harmonic component of frequency
f0 = 5kHz, if the signal is sampled with a) fs = 8 ksamples/s, b) fs = 12 ksamples/s? Give c) the minimum
theoretical sampling rate of this component to avoid aliasing, d) a practical selection of the sampling rate
that ensures smooth representation of the component (minimum 10 samples per period).

3. Calculate the convolution x(n)  y (n)   x(n  k ) y(k ) of the following finite sequences of samples:
k 
x={1,5,0,-2}, y={4,3,2,1). Underlining indicates values for n=0.
n -1 0 1 2 3
x(n)*y(n)

4. a) Calculate the discrete Fourier transform


N 1
2m
DFT [ x( n)]  X (m)   x(n)e  jnm ,  m  , m  0,1,..., N  1
n0 N
for the the sequence of N=4 recorded samples x={1,1,0,0}. What are the frequencies of the DFT coefficients
from question 6 in Hz if the sampling period Ts = 2 ms?
5. Determine whether the discrete-time systems described by the following I/O equations are linear and/or
time-invariant: a) y(n)= x2(n−1)+x(2n), b) y(n)= nx(n − 3)+3x(n).
6. Write the difference equation (in the discrete time domain) of a digital filter whose transfer function is
H ( z )  (1  z 1 ) 2 and calculate initial samples of the filter step response for n=0,1,2,3,4. a) Is it a IIR or
FIR filter? b) Is it stable? c) Is its phase response linear or not?
n 0 1 2 3 4
x(n) = 1(n) 1 1 1 1 1
y(n)

7. Give the transfer function H(z)=Y(z)/X(z) and the difference equation of the filter shown in the diagram.
Calculate the pole(s) of the filter. Determine the range of values of parameter a, for which the filter is stable.
x(n) y(n)
0.5

a z-1

8. Write the transfer function H(z)=Y(z)/X(z) of a digital filter described by difference equation
y (n)  y (n  1)  0.25 y (n  2)  x(n) . Calculate initial samples of the filter impulse response (x(n)=(n)) for
n=0,1,2,3,4. Is it a IIR or FIR filter? Is it stable?
n 0 1 2 3 4
x(n)=(n) 1 0 0 0 0
y(n)= h(n)

9. Determine and sketch the frequency response (magnitude M()=|H(ej)| and phase shift ()=H(ej)) of a
filter H ( z )  z 2 . The spectral transfer function H (e j )  H ( z ) | j
z e

10. Give transfer functions and difference equations of discrete-time equivalents of an analog integrator
Ha(s)=1/s, obtained using: a) backward Euler transformation H ( z )  H a ( s ) 1 z 1 , b) bilinear
s
Ts
transformation H ( z )  H a ( s ) 2 1 z . Calculate initial values of the discrete-time integrators step
1
s 
Ts 1 z 1
responses. Assume sampling period Ts=1s and complete the table.
n 0 1 2 3 4
x(n) = 1(n) 1 1 1 1 1
y(n) (backward Euler)
y(n) (bilinear)

You might also like