0% found this document useful (0 votes)
54 views3 pages

Digital Signal Processing Concepts and Techniques

The document covers key concepts in digital signal processing, including linear shift invariant systems, discrete Fourier transforms, FIR and IIR filters, and finite word length effects in digital filters. It also includes model question papers with various problems related to these topics. Additionally, it lists textbooks and references for further reading.

Uploaded by

B. V.SAHRUDHY
Copyright
© © All Rights Reserved
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% found this document useful (0 votes)
54 views3 pages

Digital Signal Processing Concepts and Techniques

The document covers key concepts in digital signal processing, including linear shift invariant systems, discrete Fourier transforms, FIR and IIR filters, and finite word length effects in digital filters. It also includes model question papers with various problems related to these topics. Additionally, it lists textbooks and references for further reading.

Uploaded by

B. V.SAHRUDHY
Copyright
© © All Rights Reserved
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/ 3

MTIE 1.

2- DIGITAL SIGNAL PROCESSING


Linear Shift Invariant Systems
Signals, systems and signal processing, discrete time signals, discrete time systems, analysis of
linear time invariant systems, classification of discrete time systems, block diagram and signal
flow graphs, structures for realization for IIR systems, structures for realization of FIR systems.

Discrete Fourier Transforms


Introduction, Circular shift and circular symmetries of a sequence, properties of DFT, linear
convolution, circular convolution, performing linear convolution using DFT, sectioned
convolution, Fast Fourier Transforms, Decimation – in time FFT, Decimation –in- frequency
FFT, computation of IDFT through FFT.

FIR Filters
LTI systems as frequency selective filters, FIR filters, characteristics of FIR filters with linear
phase, frequency response of linear phase FIR filters, Design techniques for linear phase FIR
filters, Fourier series method of FIR filter design, windows, FIR filter design using windows,
Design of FIR filters by frequency sampling technique.

IIR Filters
Introduction, Impulse Invariant transformation, Bilinear Transformation, specifications of the
low pass filter, design of low pass digital Butterworth filter, Design ofloa pass digital Chebyshev
filter, Frequency transformation.

Finite Word Length Effects in Digital Filters


Introduction, representation of numbers in Digital system, Types of arithmetic in digital systems,
quantization by truncation and rounding, quantization of input data, quantization of filter
coefficients, product quantization error, limit cycles in recursive systems.

Text Books
1. John G Proakis,” Digital Signal Processing: Principles, Algorithms and Applications,” Pearson
Education, 4th Edition 2007.
2. Alan V Openhiem, Ronald W Schafer , “Digital Signal Processing,” PHI learning Pvt. Ltd,
1975

References
1. Manson H Hayes,” Digital Signal Processing,” TMH Publications, 2004.
2. P.RameshBabu,” Digital Signal Processing ,” Scitech Publications.
MODEL QUESTION PAPER
DIGITAL SIGNAL PROCESSING (MTIE- 1.2)
1. a) Test the following systems for time invariance, linearity. (7m)
(i) y(n)= x(n)-x(-n-1)+x(n-1)
(ii) y(n)=x(n)+x2(n-1)
b) Obtain direct form – I, cascade realization of the LTI system (7m)
y(n)=x(n)+3/4x(n-1)+3/8x(n-2)+1/8y(n-1)+1/2y(n-2)
OR
2. a) Check whether the following systems are causal and BIBO stable or not. (6m)
y(n)=ax(n)+b
y(n)=ax(n+1)+bx(n-1)
b) Construct a block diagram for the discrete time system whose input output relation is
described by the difference equation y(n)=0.24x(n)-0.46x(n-1)+0.68y(n-1)+0.7y(n-2) (4m)
c) What are the advantages of using direct form – II realization in comparison to direct form
– I realization. (2m)
d) Define a time-invariant system. (2m)

3. a) Perform circular convolution of the two sequences, x1(n)={1,2,1,2} and x2(n)={2,4,2,1}


(6m)
b) Compute 8-point DFT of x(n) by radix – 2 DIT-FFT (8m)
x(n)={1,3,2,2,1,3,2,2}
OR
4. a) Perform linear convolution of the following sequence using overlap add method.
x(n)={-1,1,2,-1,1,2,-1,1,-1} and h(n)={2,3,-2} (8m)
b) Explain in detail the properties of DFT. (6m)
5. a) What are the steps involved in FIR filter design? (3m)
b) Write the sequence of hamming window function. (3m)
c) Design a bandstop filter to reject frequencies in the range 2 to 2.5 rad/sec using rectangular
window. (8m)
OR
6. a) Compare rectangular window and hanning window. (5m)
b) Design a highpass filter with a cutoff frequency of 0.8π rad/sec using rectangular window.
(9m)
7. a) Compare analog and digital filters. (6m)
2
b) For the analog transfer function, Ha(s)= , determine H(z) if T=1sec. (6m)
( s+1)( s+2)
c) What is bilinear transformation? (2m)
OR
8. a) What is frequency warping?
b) Design a butterworth lowpass filter satisfying the following specifications.
Sampling time = 1sec
Passband frequency = 0.06 π rad/sec
Stopband frequency = 0.75 π rad/sec
Passband attenuation = 6dB
Stopband attenuation = 20dB
9. a) Explain the following terms:
Truncation
Rounding
Twiddle factor
Zero padding
b) What is the binary representation of 178.25 10.
OR
10. a) What is product quantization error?
b) Determine the response of the system whose input x(n) and impulse response h(n) are
given by x(n)={1,2,3,1} and h(n)={1,2,1,-1}
↑ ↑

You might also like