0% found this document useful (0 votes)
13 views6 pages

Ee1671 DSP M3

The document outlines various topics related to signal processing, including definitions and relationships between impulse, step, and ramp functions, as well as concepts like sampling, aliasing, and Nyquist rate. It also covers analysis of discrete time systems, Z-transforms, DFT computations, filter design, and DSP processor architecture. Additionally, it includes practical exercises and questions for determining properties of signals and systems.

Uploaded by

dinakarexam27
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
13 views6 pages

Ee1671 DSP M3

The document outlines various topics related to signal processing, including definitions and relationships between impulse, step, and ramp functions, as well as concepts like sampling, aliasing, and Nyquist rate. It also covers analysis of discrete time systems, Z-transforms, DFT computations, filter design, and DSP processor architecture. Additionally, it includes practical exercises and questions for determining properties of signals and systems.

Uploaded by

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

Part A

1 Give the relationship between unit impulse


function , step function and ramp
function .
2 Define Periodic and Non Periodic signal with
an example.

3 What is meant by sampling?


4 What is meant by Aliasing Effect?
5 What is meant by Nyquist rate?

Part b
1 Determine whether following signals are
energy or power Signals.

2 Determine whether the following Discrete


Time systems are
a) Linear or non linear
b) Time Invariant or time variant
c) Static or dynamic
d) Causal or non Causal
e) Stable or unstable

3 Determine whether the following Discrete


Time systems are
a) Linear or non linear
b) Time Invariant or time variant
c) Static or dynamic
d) Causal or non Causal
e) Stable or unstable

4 Determine whether the following Discrete


Time systems are
b) Linear or non linear
b) Time Invariant or time variant
c) Static or dynamic
d) Causal or non Causal
e) Stable or unstable

5 Determine whether the following Discrete


Time systems are
c) Linear or non linear
b) Time Invariant or time variant
c) Static or dynamic
d) Causal or non Causal
e) Stable or unstable

Part a
1 Define Z – transform
2 What is meant by region of convergence?

3 Determine the Z-transform and ROCfor the


signal x(n)=δ(n-k)+ δ(n+k).
4 Determine the Z-transform of x(n)=anu(n)
5
Determine the Z Transform and ROC of the

following finite duration signals

x(n)= {-3,0,2,5,0,1}
6 Obtain the circular convolution of x1(n)=
{1,2,3}, x2(n)= {-3,1,-2}

Part b
1 Determine impulse Response of the following
Difference Equation when the system is
causal, Anti Causal, Non Causal, Stable and
unstable.
2 Compute the response of the system

to input x(n) = nu(n). Is the system stable?


3 Find the inverse Z transform of

ROC |Z| >3


4 State and proof any four properties of Z-
transform.
Part a
1 Draw the basic butterfly diagram for Radix 2 DIT
FFT.
2 Compute the IDFT of the four point DFT
sequence, .
3 Draw the basic butterfly diagram for Radix 2 DIF
FFT.
4 The first five points of the eight-point DFT of a
real-valued sequence are
{0.25, 0.125 − j0.3018, 0, 0.125 − j0.0518, 0}.
Determine the remaining three points.
5 List any four properties of DFT.
6 What is zero padding? What are its uses?
Part b
1 Compute the eight point DFT of the sequence,
, Using radix-2 Fast
Fourier Transform- Decimation in Time
algorithm.
2 Compute the eight point DFT of the sequence,
, Using radix-2 Fast
Fourier Transform- Decimation in Frquency
algorithm.
3 Compute the eight point DFT of the sequence,
, Using radix-2 Fast
Fourier Transform- Decimation in Time
algorithm.
4 Determine the DFT of the given sequence
x(n) = {1,-1,-1,-1,1,1,1,-1}using DIT-FFT
algorithm.
5 Compute the eight point DFT of the sequence,
.Using radix-2 Fast
Fourier Transform- Decimation in Time
algorithm.
Part a
1 Obtain the direct form-I realization for the given
difference equation,
2 Mention the advantages of FIR filters over IIR
filters.
3 Write the advantages and disadvantages of digital
filters.
4 Define pre-warping effect? Why it is employed?
5 What is Gibbs phenomenon?
6 Write Difference between Direct form-I and
Direct form-II.

PART B

1 Design an ideal low pass filter with a frequency

response

Find the values of for N=7 using Hanning

Window. Find H(z) and filter coefficients.


2 Design an ideal low pass filter with a frequency

response

Find the values of for N=11 using


Rectangular Window. Find H(z) and filter
coefficients.
3 Obtain the direct form I, direct form II for the
following system,
.
4 Obtain the cascade form and parallel form for the
following system,

.
5 Design a Butterworth filter for the following
specification using Impulse Invarient
transformation.
0.8≤ |H(ejω| ≤ 1 0≤ ω≤ 0.2π

|H(e | ≤ 0.2 0.6π≤ ω≤ π
6 Design a Butterworth filter Low Pass filter for
the following specification using Bilinear
transformation.
0.707≤ |H(ejω| ≤ 1 0≤ ω≤ 0.5π
|H(ejω| ≤ 0.2 (3π)/4≤ ω≤ π
Part a
1 What are the different stages in pipelining?
2 What are the applications of PDSPs?
3 Compare the RISC and CISC processors.
4 Write some commercial DSP Processors.
5 Give the data format of any one DSP
processor.

Part b
1 Describe in detail the architecture of TMS
320C 54 DSP processor and state the main
features of this processor.
2 Explain the addressing modes of a DSP
processor with suitable examples.
3 Explain Von Neumann, Harvard architecture
and modified Harvard architecture for the
computer.
4 Discuss the architecture of any one
commercial DSP and explain with necessary
diagram.

Important question

1 Obtain the cascade form and parallel form for the


following system,

2 Compute the eight point DFT of the sequence,


, Using radix-2 Fast
Fourier Transform- Decimation in Frquency
algorithm.

3.Consider the analog signal

a) What is the Nyquist rate for this signal.

b) Assume now that we sample this signal

using sampling rate 5000 samples/s. What is

the Discrete time signal obtained after

sampling.
What is the analog signal that we reconstruct
from the samples.

You might also like