/ (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

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

Question Bank. UNIT 1 Part-A

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

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

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

DEPARTMENT OF EI DIGITAL SIGNAL PROCESSING ASSIGNMENT 1

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

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

R13 SET - 1

EEL3135: Homework #4

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

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

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

University Question Paper Solution

Computer Engineering 4TL4: Digital Signal Processing

E : Lecture 1 Introduction


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

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

EE 521: Instrumentation and Measurements

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 )

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

INSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad

Discrete-time signals and systems

Digital Signal Processing. Midterm 1 Solution

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)

UNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.

Lecture 7 Discrete Systems

ELEG 305: Digital Signal Processing

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

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

Digital Signal Processing. Midterm 2 Solutions

Lecture 19 IIR Filters

Question Paper Code : AEC11T02

Each problem is worth 25 points, and you may solve the problems in any order.

Stability Condition in Terms of the Pole Locations

Responses of Digital Filters Chapter Intended Learning Outcomes:

Digital Signal Processing Lecture 4

Review of Fundamentals of Digital Signal Processing

ELEG 305: Digital Signal Processing

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

Exercises in Digital Signal Processing

Linear Convolution Using FFT

DIGITAL SIGNAL PROCESSING

Discrete-Time David Johns and Ken Martin University of Toronto

Digital Signal Processing

Multidimensional digital signal processing

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

Review of Fundamentals of Digital Signal Processing

EEE4001F EXAM DIGITAL SIGNAL PROCESSING. University of Cape Town Department of Electrical Engineering PART A. June hours.

Discrete Time Systems

Digital Filters Ying Sun

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

EC Signals and Systems

Discrete Fourier Transform

Chap 2. Discrete-Time Signals and Systems

E2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2)

UNIVERSITY OF OSLO. Faculty of mathematics and natural sciences. Forslag til fasit, versjon-01: Problem 1 Signals and systems.

ESE 531: Digital Signal Processing

Module 3. Convolution. Aim

Introduction to Digital Signal Processing

Chapter 7: IIR Filter Design Techniques

PS403 - Digital Signal processing

Digital Signal Processing, Homework 1, Spring 2013, Prof. C.D. Chung

ECGR4124 Digital Signal Processing Final Spring 2009

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

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

Theory and Problems of Signals and Systems

Radar Systems Engineering Lecture 3 Review of Signals, Systems and Digital Signal Processing

The Johns Hopkins University Department of Electrical and Computer Engineering Introduction to Linear Systems Fall 2002.

ECE-314 Fall 2012 Review Questions for Midterm Examination II

Digital Signal Processing Lecture 3 - Discrete-Time Systems

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

Discrete Time Systems

Digital Signal Processing Lecture 8 - Filter Design - IIR

LAB 6: FIR Filter Design Summer 2011

Review of Discrete-Time System

Fall 2011, EE123 Digital Signal Processing

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

Digital Signal Processing. Lecture Notes and Exam Questions DRAFT

ECGR4124 Digital Signal Processing Exam 2 Spring 2017

Solution 7 August 2015 ECE301 Signals and Systems: Final Exam. Cover Sheet

ELEG 5173L Digital Signal Processing Ch. 5 Digital Filters

DEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING EXAMINATIONS 2010

Discrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz

Lecture 3 - Design of Digital Filters

EECE 301 Signals & Systems Prof. Mark Fowler

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

APPLIED SIGNAL PROCESSING

Z Transform (Part - II)

Discrete-Time Signals and Systems

SIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals

Module 4 : Laplace and Z Transform Problem Set 4

Discrete-Time Fourier Transform (DTFT)

New Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2015 Final Exam

1 1.27z z 2. 1 z H 2

Lecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE

ECE 301 Fall 2010 Division 2 Homework 10 Solutions. { 1, if 2n t < 2n + 1, for any integer n, x(t) = 0, if 2n 1 t < 2n, for any integer n.

MAHALAKSHMI ENGINEERING COLLEGE-TRICHY

Transcription:

Code No: RR320402 Set No. 1 III B.Tech II Semester Regular Examinations, Apr/May 2006 DIGITAL SIGNAL PROCESSING ( Common to Electronics & Communication Engineering, Electronics & Instrumentation Engineering, Electronics & Control Engineering, Electronics & Telematics and Instrumentation & Control Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks 1. (a) The unit-sample response of a linear-shift-invariant system is known to be zero. Except in the interval N 0 n N 1. The input x(n) is known to be zero except in the interval N 2 n N 3. As a result, the output is constrained to be zero except in some interval N 4 n N 5. Determine N 4 andn 5 in terms of N 0, N 1, N 2 andn 3. (b) By direct evaluation of the convolution sum, determine the step response of a Linear shift-invariant system whose unit-sample response h(n) is given by h(n) = a n u( n), 0 < a < 1. [8+8] 2. (a) Let x(n) and X(e jw ) denote a sequence and its Fourier transform. Show that x(n) x (n) = 1 π / (2π) X(e jω ) dω n= π This is one form of Parseval s theorem (b) For a real sequence show that magnitude spectrum is even and phase spectrum is odd. [8+8] 3. (a) Distinguish between DFT and DTFT. (b) Consider a sequence x(n) of length L. Consider its DTFT X d (w) is sampled and N is the number of frequency samples. Discuss the relation between L and N for inverse DTFT = inverse DFT comment on the aliasing problem. (c) Compute the DFT of x(n) = {1, 0, 0, 0} and compare with X d (w). [4+6+6] 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 (a) radix - 2 D I T F F T (b) radix - 2 D I F FF T Also sketch magnitude and phase spectrum. [16] 5. (a) An LTI system is described by the equation y(n)=x(n)+0.81x(n-1)-0.81x(n- 2)-0.45y(n-2). Determine the transfer function of the system. Sketch the poles and zeroes on the Z-plane. (b) Define stable and unstable system test the condition for stability of the firstorder IIR filter governed by the equation y(n)=x(n)+bx(n-1). [8+8] 6. (a) What is an IIR digital filter? 1 of 2

Code No: RR320402 Set No. 1 (b) How are IIR digital filter realized? (c) What are the various realizability constraints imposed on transfer function of an IIR digital filter. [4+4+6] 7. A low pass{ filter is to be designed with the following desired frequency response. e H d (e jω ) = j2ω, π/4 ω π/4 0, π/4 ω π Determine { the filter coefficients h d (n) if the window function is defined as 1, 0 n 4 ω(n) = 0, otherwise Also determine the frequency response H(e jω ) of the designed filter. And plot the magnitude and phase spectra. [16] 8. (a) Explain the parallel form realisation for IIR system and obtain the direct form I, direct form II realisation of the LTI systems governed by the equation. y(n) = 3 3 1 y(n 1) + y(n 2) + y(n 3) + x(n) + 3x(n 1) + 2x(n 2) 8 32 64 (b) Compare cascade and parallel form relations. [12+4] 2 of 2

Code No: RR320402 Set No. 2 III B.Tech II Semester Regular Examinations, Apr/May 2006 DIGITAL SIGNAL PROCESSING ( Common to Electronics & Communication Engineering, Electronics & Instrumentation Engineering, Electronics & Control Engineering, Electronics & Telematics and Instrumentation & Control Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks 1. (a) Let e(n) be an exponential sequence, i.e., e(n)=x n, for all n and let x(n) and y(n) denote two arbitrary sequences, Show that [e(n)x(n)]*[e(n)y(n)] = e(n)[x(n)*y(n)] (b) Consider a discrete-time linear shift-invariant system with unit-sample response h(n). If the input x(n) is a periodic sequence with period N. Show that the output y(n) is also a periodic sequence with period N. [8+8] 2. A LTI system is described by the difference equation y(n)=ay(n-1)+bx(n). Find the impulse response, magnitude function and phase function. Find the value of b if H(jw) = 1. Sketch the magnitude and phase response for a=0.9. [16] 3. (a) State and prove the circular time shifting and frequency shifting properties of the DFT. (b) Compute the circular convolution of the sequences x 1 (n) = {1, 2, 0, 1} and x 2 (n) = {2, 2, 1, 1} Using DFT approach. [8+8] 4. (a) Draw the butterfly line diagram for 8 - point FFT calculation and briefly explain. Use decimation -in-time algorithm. (b) What is FFT? Calculate the number of multiplications needed in the calculation of DFT using FFT algorithm with 32 point sequence. [8+8] 5. (a) Explain how the analysis of discrete time invariant system can be obtained using convolution properties of Z transform. (b) Determine the impulse response of the system described by the difference equation y(n)-3y(n-1)-4y(n-2)=x(n)+2x(n-1) using Z transform. [8+8] 6. Design a Digital IIR low pass filter with pass band edge at 1000 Hz and stop band edge at 1500 Hz for a sampling frequency of 5000 Hz. The filter is to have a pass band ripple of 0.5 db and stop band ripple below 30 db. Design Butter worth filler using both impulse invariant and Bilinear transformations. [16] 7. (a) Design a Finite Impulse Response low pass filter with a cut-off frequency of 1 khz and sampling rate of 4 khz with eleven samples using Fourier series method. (b) Show that an FIR filter is linear phase if h(n) = h(n-1-n). [8+8] 1 of 2

Code No: RR320402 Set No. 2 8. (a) Explain the structures for realisation of FIR system and draw the direct form structure of the FIR system described by the transfer function H(Z) = 1 + 1 2 Z 1 + 3 4 Z 2 + 1 4 Z 3 + 1 2 Z 4 + 1 8 Z 5 (b) Realize the following IIR system by cascade and parallel forms. y(n) + 1 y(n 1) 1 y(n 2) = x(n) 2x(n 1) + x(n 2) [8+8] 4 8 2 of 2

Code No: RR320402 Set No. 3 III B.Tech II Semester Regular Examinations, Apr/May 2006 DIGITAL SIGNAL PROCESSING ( Common to Electronics & Communication Engineering, Electronics & Instrumentation Engineering, Electronics & Control Engineering, Electronics & Telematics and Instrumentation & Control Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks 1. (a) Write four advantages of Digital Signal Processing over Analog Signal Processing. (b) A signal y(n) is governed by the recursive equation y(n) = 2y(n 1) + δ(n)withy(0) = 4. Find y(-2),y(3). Is the signal bounded or not? (c) Convolve the two signals x(n) = ( 1 / 2 ) n x(n)and h(n) = u(n) u(n 10) where u(n) is unit step function. [6+4+6] 2. (a) Prove that the convolution in time domain leads to multiplication in frequency domain for discrete time signals (b) The out put y(n) for a linear shit invariant system, with the input x(n) is given by Y(n) = x(n)-2x(n-1)+x(n-2) Compute and sketch the magnitude and phase response of the system w π [8+8] 3. (a) What is padding with Zeros with an example, Explain the effect of padding a sequence of length N with L Zeros or frequency resolution. (b) Compute the DFT of the three point sequence x(n) = {2, 1, 2}. Using the same sequence, compute the 6 point DFT and compare the two DFTs. [8+8] 4. (a) Draw the butterfly line diagram for 8 - point FFT calculation and briefly explain. Use decimation -in-time algorithm. (b) What is FFT? Calculate the number of multiplications needed in the calculation of DFT using FFT algorithm with 32 point sequence. [8+8] 5. (a) Explain how the analysis of discrete time invariant system can be obtained using convolution properties of Z transform. (b) Determine the impulse response of the system described by the difference equation y(n)-3y(n-1)-4y(n-2)=x(n)+2x(n-1) using Z transform. [8+8] 6. (a) Using Bilinear transformation on an analog filter transfer function Ha(S), given the following S plane points. S = 0.2++j0, -0.1+j0.3, -0.1+j0.6 Find the corresponding Z plane points. Also plot the resulting Z plane points. 1 of 2

Code No: RR320402 Set No. 3 (b) A signal x(t) = 5Sin5πt is passed through a filter. If the signal is samples at T=1/50 seconds and number of sampling intervals equals 150 then sketch the input signal x(nt) and the output of the filter. [8+8] 7. (a) What is the principle of designing FIR filters using windows. (b) Using a rectangular window technique design a low pass filter with pass band gain of unity, cut-off frequency of 1kHz and working at a sampling frequency of 5 khz. The length of the impulse response should be 7. [6+10] 8. (a) Obtain the cascade and parallel form realisation of the LTI system governed by the equation. (b) Compare cascade and performance of direct and canonic forms. [12+4] 2 of 2

Code No: RR320402 Set No. 4 III B.Tech II Semester Regular Examinations, Apr/May 2006 DIGITAL SIGNAL PROCESSING ( Common to Electronics & Communication Engineering, Electronics & Instrumentation Engineering, Electronics & Control Engineering, Electronics & Telematics and Instrumentation & Control Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks 1. (a) Consider a discrete linear time invariant system described by the difference equation: Y(n)-(3/4)y(n-1)+(1/8)y(n-2)=x(n))+(1/3)x(n-1) Where y(n) is the output and x(n) is the input. Assuming that the system is relaxed initially obtain the unit sample response of the system. (b) Find the: i. impulse response ii. output response for a step input applied at n=0 of a discrete time linear time invariant system whose difference equation is given by y(n) = y(n- 1)+0.5 y(n-2)+x(n)+x(n-1). [8+8] 2. (a) If x(n) x(e jω ) Constitute a Fourier transform pair. Prove the following: Sequence Fourier Transform i. x*(-n) X (e jω ) ii. j Im[x(n)] X 0 (e jω ) (b) Prove that the convolution in time domain leads to multiplication in frequency domain for discrete time signals. [8+8] 3. (a) If x(n) is a periodic sequence with a period N, also periodic with period 2N. X 1 (K) denotes the discrete Fourier series coefficient of x(n) with period N and X 2 (k) denote the discrete Fourier series coefficient of x(n) with period 2N. Determine X 2 (K) in terms of X 1 (K). (b) Prove the following properties. i. W n N x(n) X ((K + 1)) N R N(K) ii. x (n) X (( K)) N R N (K) [8+8] 4. (a) Implement the decimation in time FFT algorithm for N=16. (b) In the above Question how many non - trivial multiplications are required. [10+6] 5. (a) Explain how the analysis of discrete time invariant system can be obtained using convolution properties of Z transform. 1 of 2

Code No: RR320402 Set No. 4 (b) Determine the impulse response of the system described by the difference equation y(n)-3y(n-1)-4y(n-2)=x(n)+2x(n-1) using Z transform. [8+8] 6. (a) Derive a relationship between complex variable S used in Laplace Transform (for analog filters) and complex variation Z used in Z-transform (for digital filters) (b) Discuss the various properties of Bilinear transformation method. [8+8] 7. (a) Design a low pass filter by the Fourier series method for a seven stage with cut-off frequency at 300 Hz if t s = 1msec. Use hanning window. (b) Explain in detail, the linear phase response and frequency response properties of Finite Impulse Response filters. [8+8] 8. (a) Realize the following systems with minimum number of multipliers. H(Z) = 1 4 + 1 2 Z 1 + 3 4 Z 2 + 1 2 Z 3 + 1 4 Z 4 H(Z) = [ 1 + 1 2 Z 1 + Z 2][ 1 + 1 4 Z 1 + Z 2] (b) Explain the principles of VOCODERS. [10+6] 2 of 2