DEPARTMENT OF EI DIGITAL SIGNAL PROCESSING ASSIGNMENT 1

Similar documents
DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A

SIDDHARTH GROUP OF INSTITUTIONS:: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE)

R13 SET - 1

VALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF INFORMATION TECHNOLOGY. Academic Year

Question Bank. UNIT 1 Part-A

DFT & Fast Fourier Transform PART-A. 7. Calculate the number of multiplications needed in the calculation of DFT and FFT with 64 point sequence.

IT DIGITAL SIGNAL PROCESSING (2013 regulation) UNIT-1 SIGNALS AND SYSTEMS PART-A

/ (2π) X(e jω ) dω. 4. An 8 point sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute 8 point DFT of x(n) by


DIGITAL SIGNAL PROCESSING

INSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad

Chapter 7: IIR Filter Design Techniques

ELEG 5173L Digital Signal Processing Ch. 5 Digital Filters

EE 521: Instrumentation and Measurements

Digital Signal Processing. Lecture Notes and Exam Questions DRAFT

Vel Tech High Tech Dr.Ranagarajan Dr.Sakunthala Engineering College Department of ECE

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

Roll No. :... Invigilator s Signature :.. CS/B.Tech (EE-N)/SEM-6/EC-611/ DIGITAL SIGNAL PROCESSING. Time Allotted : 3 Hours Full Marks : 70

Lecture 7 Discrete Systems

UNIVERSITI SAINS MALAYSIA. EEE 512/4 Advanced Digital Signal and Image Processing

MAHALAKSHMI ENGINEERING COLLEGE-TRICHY

Course Name: Digital Signal Processing Course Code: EE 605A Credit: 3

1 1.27z z 2. 1 z H 2

ELEG 305: Digital Signal Processing

DISCRETE-TIME SIGNAL PROCESSING

Lecture 3 - Design of Digital Filters

Module 3. Convolution. Aim

Filter Analysis and Design

Computer Engineering 4TL4: Digital Signal Processing

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

ELEG 305: Digital Signal Processing

EE 225D LECTURE ON DIGITAL FILTERS. University of California Berkeley

EC PRINCIPLES OF DIGITAL SIGNAL PROCESSING 2 MARKS UNIT I - DISCRETE FOURIER TRANSFORM

Digital Signal Processing

ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin

LECTURE NOTES DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13)

Digital Signal Processing. Midterm 2 Solutions

EEL3135: Homework #4

Discrete-time signals and systems

Digital Signal Processing Lecture 9 - Design of Digital Filters - FIR

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

Digital Signal Processing

Introduction to Digital Signal Processing

Multimedia Signals and Systems - Audio and Video. Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2

Digital Signal Processing Lecture 4

Chapter 8 The Discrete Fourier Transform


E : Lecture 1 Introduction

EE482: Digital Signal Processing Applications

Filter structures ELEC-E5410

EE-210. Signals and Systems Homework 7 Solutions

ECGR4124 Digital Signal Processing Final Spring 2009

Lecture 19 IIR Filters

APPLIED SIGNAL PROCESSING

Discrete-Time David Johns and Ken Martin University of Toronto

How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches

! Circular Convolution. " Linear convolution with circular convolution. ! Discrete Fourier Transform. " Linear convolution through circular

DIGITAL SIGNAL PROCESSING UNIT III INFINITE IMPULSE RESPONSE DIGITAL FILTERS. 3.6 Design of Digital Filter using Digital to Digital

EE123 Digital Signal Processing. M. Lustig, EECS UC Berkeley

ECGR4124 Digital Signal Processing Exam 2 Spring 2017

DSP Algorithm Original PowerPoint slides prepared by S. K. Mitra

Digital Signal Processing

ELEG 305: Digital Signal Processing

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.

VU Signal and Image Processing. Torsten Möller + Hrvoje Bogunović + Raphael Sahann

Discrete-Time Signals and Systems

Multidimensional digital signal processing

Definition. A signal is a sequence of numbers. sequence is also referred to as being in l 1 (Z), or just in l 1. A sequence {x(n)} satisfying

1. Calculation of the DFT

V. IIR Digital Filters

2.161 Signal Processing: Continuous and Discrete Fall 2008

! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals

Fourier Methods in Digital Signal Processing Final Exam ME 579, Spring 2015 NAME

Digital Signal Processing IIR Filter Design via Bilinear Transform

INF3440/INF4440. Design of digital filters

PS403 - Digital Signal processing

ELEG 305: Digital Signal Processing

LAB 6: FIR Filter Design Summer 2011

Let H(z) = P(z)/Q(z) be the system function of a rational form. Let us represent both P(z) and Q(z) as polynomials of z (not z -1 )

(Refer Slide Time: 01:28 03:51 min)

Convolution. Define a mathematical operation on discrete-time signals called convolution, represented by *. Given two discrete-time signals x 1, x 2,

Exercises in Digital Signal Processing

The Fourier transform allows an arbitrary function to be represented in terms of simple sinusoids. The Fourier transform (FT) of a function f(t) is

DSP-CIS. Chapter-4: FIR & IIR Filter Design. Marc Moonen

Digital Signal Processing:

Digital Signal Processing I Final Exam Fall 2008 ECE Dec Cover Sheet

Linear Convolution Using FFT

Department of Electrical and Telecommunications Engineering Technology TEL (718) FAX: (718) Courses Description:

-Digital Signal Processing- FIR Filter Design. Lecture May-16

Implementation of Discrete-Time Systems

DIGITAL SIGNAL PROCESSING. Chapter 6 IIR Filter Design

Lecture 16: Filter Design: Impulse Invariance and Bilinear Transform

Digital Power System Protection

UNIT 1. SIGNALS AND SYSTEM

University Question Paper Solution

EDISP (NWL3) (English) Digital Signal Processing DFT Windowing, FFT. October 19, 2016

Digital Signal Processing Lecture 8 - Filter Design - IIR

Discrete Time Systems

ECE503: Digital Signal Processing Lecture 6

UNIT - III PART A. 2. Mention any two techniques for digitizing the transfer function of an analog filter?

Transcription:

This PDF is Created by Simpo PDF Creator unregistered version - http://wwwsimpopdfcom Study hard, for the well is deep, and our brains are shallow DEPARTMENT OF EI DIGITAL SIGNAL PROCESSING ASSIGNMENT 1 Q1 What are the advantages of representing a digital filter in the block diagram form Q2 Determine the cascade and parallel realizations for the system described by the system function: Q3 Obtain the direct form I and II structures for a third order IIR transfer function which is given as: Q4 What are canonic and non-canonic structures? Q5 Explain parallel form realization Q6 Draw the direct-form I realization structure of 3rd order system Q7 Explain advantage of direct form structures Q8 What is ladder structure? Q9 Explain continued fraction expansion method? Explain with an example

This PDF is Created by Simpo PDF Creator unregistered version - http://wwwsimpopdfcom ASSIGNMENT 2 Q1 Explain the mapping from s-plane to z-plane Q2 Explain the magnitude characteristics of the physically realizable filter Q3 Use impulse invariance method to design a digital filter from an analog prototype that have a system function : ( ) Q4 Describe the complete mapping with the expressions and diagrams from splane to z-plane if bilinear transformation is used What do you mean by frequency warping effect and pre-warping with respect to bilinear transformation Q5 Make use of bilinear transformation to obtain H(z) if it is given that : Ha(s) ( ) and T 01s Q6 Design a digital Butterworth filter using impulse invariant method if: 0707 H (ejww) 1 H (ejww) 02 w 05π, 0 w, w π π w Q7 Write short note: a) Butterworth filter b) Chebyshev filter Q8 Describe the complete mapping with the expressions and diagrams from splane to z-plane if impulse invariant transformation is used

This PDF is Created by Simpo PDF Creator unregistered version - http://wwwsimpopdfcom ASSIGNMENT 3 Q1 Explain symmetric and anti-symmetric FIR filters Q2 What is meant by linear phase response? Prove that filter with the following response has linear phase response: h(n) [2 1 1 2] Q3 Show that if z1 is the zero of the linear phase FIR filter, then 1/ z1 is also zero of the filter Q4 Design an FIR filter to meet the following specifications: Pass band edge frequency2 KHz Stop band edge frequency5 KHz Stop band attenuation50db Sampling frequencyfs20 KHz Use Hamming Window Q5 Design an FIR linear phase filter using Kaiser window to meet the following specifications: w 019π 099 H (ejww) 101, 0 w H (ejww) 001, 021π w w π Q6 Compare the frequency domain characteristics of the different types of window Q7 Design a bandpass filter which approximates the ideal filter with cut-off frequencies at 02 rad/sec and 03 rad/sec The filter order is M7 Use the Hanning window function Q8 Explain Gibb`s phenomenon Q9 Explain Window function

This PDF is Created by Simpo PDF Creator unregistered version - http://wwwsimpopdfcom ASSIGNMENT 4 Q1 What are the advantages of DSP over ASP? Q2 State and prove the symmetry property of DFT Q3 Obtain DFT of unit impulse function d(t) Q4 compute the DFT of following window function : w(n) u(n) u(n-n) Q5 Determine DFT of four point sequence x(n) [1 2 3 4] Q6 Explain the relation of DFT to Z-transform Q7 State and prove Duality property of DFT Q8 Compute circular convolution of : x(n) [0 1 2 3] and h(n) [1 5 3 5] Q9 Compute linear convolution using circular convolution of sequences x (n) [1 2 3] and h(n) [1 2] Q10 DFT of a sequence x(n) is given by X(k) [4 property only determine x*(n) 12j j 1-3j] Using DFT

This PDF is Created by Simpo PDF Creator unregistered version - http://wwwsimpopdfcom ASSIGNMENT 5 Q1 Derive DIT FFT flowgraph for N4 Q2 Derive DIF FFT flowgraph for N16 Q3 Compare the number of multiplications and additions which are needed for direct computation of DFT with those needed for radix-2 FFT algorithms Q4 Determine how a 2N-point DFT of a real valued sequence may be computed using an N-point FFT algorithm Q5 Determine the four point DFT of the sequence x(n){1 0 2 1} using DIT FFT algorithm Q6 Explain In-Place computation for DFT Q7Discuss the FFT algorithms for composite value of N Q8 Derive the DIT IDFT FFT flowgraph for N4 Q9 Determine eight point DFT of the sequence x(n)[1 2 3 4] using DIT FFT Q10 Determine IDFT of X(k)[10,-22j,-2,-2-2j] using DIT FFT