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

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

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

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

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

EEL3135: Homework #4

Your solutions for time-domain waveforms should all be expressed as real-valued functions.

Review of Discrete-Time System

Review of Fundamentals of Digital Signal Processing

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

ELEN 4810 Midterm Exam

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

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

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

Chap 2. Discrete-Time Signals and Systems

Discrete Time Fourier Transform (DTFT)

Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is

Discrete-Time Fourier Transform (DTFT)

Discrete Time Fourier Transform

Digital Signal Processing. Midterm 1 Solution

Multidimensional digital signal processing

Review of Fundamentals of Digital Signal Processing

Z-TRANSFORMS. Solution: Using the definition (5.1.2), we find: for case (b). y(n)= h(n) x(n) Y(z)= H(z)X(z) (convolution) (5.1.

EE-210. Signals and Systems Homework 7 Solutions

Signals and Systems. Problem Set: The z-transform and DT Fourier Transform

Digital Signal Processing. Lecture Notes and Exam Questions DRAFT

Signals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions

ECE 301. Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3


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

ECGR4124 Digital Signal Processing Final Spring 2009

Lecture 14: Windowing

Final Exam January 31, Solutions

Stability Condition in Terms of the Pole Locations

EE 3054: Signals, Systems, and Transforms Spring A causal discrete-time LTI system is described by the equation. y(n) = 1 4.

Discrete-Time Signals and Systems. The z-transform and Its Application. The Direct z-transform. Region of Convergence. Reference: Sections

Lecture 13: Discrete Time Fourier Transform (DTFT)

The Discrete-Time Fourier

Digital Signal Processing Lecture 3 - Discrete-Time Systems

Lecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev.

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

Discrete Fourier Transform

ESE 531: Digital Signal Processing

Transform Analysis of Linear Time-Invariant Systems

ECE-314 Fall 2012 Review Questions for Midterm Examination II

Computer Engineering 4TL4: Digital Signal Processing

Digital Signal Processing. Midterm 2 Solutions

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

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

ECE 301 Division 1, Fall 2006 Instructor: Mimi Boutin Final Examination

Question Bank. UNIT 1 Part-A

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

Digital Filters Ying Sun

2.161 Signal Processing: Continuous and Discrete Fall 2008

ECE 301 Division 1, Fall 2008 Instructor: Mimi Boutin Final Examination Instructions:

Frequency-Domain C/S of LTI Systems

ECE538 Final Exam Fall 2017 Digital Signal Processing I 14 December Cover Sheet

Problem Score Total

University Question Paper Solution

University of Illinois at Urbana-Champaign ECE 310: Digital Signal Processing

EE 521: Instrumentation and Measurements

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

ESE 531: Digital Signal Processing

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science Discrete-Time Signal Processing Fall 2005

EE482: Digital Signal Processing Applications

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

Discrete-time signals and systems

EDISP (NWL2) (English) Digital Signal Processing Transform, FT, DFT. March 11, 2015

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

z-transform Chapter 6

Ch.11 The Discrete-Time Fourier Transform (DTFT)

Signals & Systems Handout #4

Question Paper Code : AEC11T02

Chapter 7: The z-transform

8 The Discrete Fourier Transform (DFT)

7.17. Determine the z-transform and ROC for the following time signals: Sketch the ROC, poles, and zeros in the z-plane. X(z) = x[n]z n.

Very useful for designing and analyzing signal processing systems

EC Signals and Systems

Final Exam of ECE301, Section 3 (CRN ) 8 10am, Wednesday, December 13, 2017, Hiler Thtr.

Solutions. Number of Problems: 10

Discrete Fourier transform (DFT)

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

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

Multirate signal processing

Topics: Discrete transforms; 1 and 2D Filters, sampling, and scanning

( ) John A. Quinn Lecture. ESE 531: Digital Signal Processing. Lecture Outline. Frequency Response of LTI System. Example: Zero on Real Axis

Lecture 7 Discrete Systems

GATE EE Topic wise Questions SIGNALS & SYSTEMS

School of Information Technology and Electrical Engineering EXAMINATION. ELEC3004 Signals, Systems & Control

SIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals

Discrete-Time Signals and Systems. Frequency Domain Analysis of LTI Systems. The Frequency Response Function. The Frequency Response Function

Signal Analysis. Filter Banks and. One application for filter banks is to decompose the input signal into different bands or channels

EE538 Final Exam Fall :20 pm -5:20 pm PHYS 223 Dec. 17, Cover Sheet

EECE 301 Signals & Systems Prof. Mark Fowler

Discrete Time Systems

Two Channel Subband Coding

Chapter 7 Wavelets and Multiresolution Processing

ECE 413 Digital Signal Processing Midterm Exam, Spring Instructions:

Grades will be determined by the correctness of your answers (explanations are not required).

NAME: 11 December 2013 Digital Signal Processing I Final Exam Fall Cover Sheet

Lecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE

Transcription:

EEE400F EXAM DIGITAL SIGNAL PROCESSING PART A Basic digital signal processing theory.. A sequencex[n] has a zero-phase DTFT X(e jω ) given below: X(e jω ) University of Cape Town Department of Electrical Engineering π π/3 π/3 Sketch the DTFT of the sequence2x[n]e jπn/3. π ω (5 marks) The exam is closed-book. There are two parts to this exam. June 203 3 hours Information Part A has six questions totalling 50 marks. You must answer all of them. Part B has ten questions totalling 50 marks. You must answer all of them. 2. Find the impulse response corresponding to the system function H(z) = 7z2 4z z 2 3 2 z for each possible region of convergence. In each case comment on the causality and stability properties of the system. (0 marks) 3. Let x[n] be a discrete-time signal obtained by sampling the continuous signalx(t) at a sampling ratef s = /T Hz: x[n] = x(nt). Assume that no aliasing occurs. Describe by sketching a block diagram and providing a clear explanation, how you would implement a discrete-time system with inputx[n] and outputy[n] that delaysx[n] by half a sample, so Parts A and B must be answered in different sets of exam books, which will be collected separately. A table of standard Fourier transform and z-transform pairs appears at the end of this paper. You have 3 hours. y[n] = x(nt T/2). Hint: make use of upsamplers, downsamplers, and ideal filters. (5 marks) 2

4. Consider the following discrete-time sequences: x[n] = 2δ[n]+3δ[n ]+δ[n 2]+5δ[n 3] y[n] = δ[n] 2δ[n 3]. (a) Write an expression for the4-point DFT X[k] ofx[n], and find the valuex[]. (b) Find the4-point inverse DFT ofx[k]w k 4, where X[k] is the4-point DFT ofx[n] and W 4 = e j 2π 4. (c) Find the 4-point circular convolution ofx[n] withy[n]. (d) Explain how you would calculate the result for part (c) using the fast Fourier transform (FFT). (e) How could you use the FFT to calculate the linear convolution ofx[n] and y[n]? (0 marks) 6. Consider a causal LTI system with the system function where a is real. H(z) = a z az (a) Write a difference equation that relates the input and the output of this system (b) For what range of values ofais the system stable? (c) Fora = /2 plot the pole-zero diagram and show the ROC. (d) Find the impulse responseh[n] for this system fora = /2. (e) Determine and plot the magnitude response of this system fora = /2. What type of system is it? (0 marks) 5. A discrete-time, causal, linear time-invariant filterh(z) has six zeros located at: z = e ±jπ/8,z = e ±j7π/8,z = ± and six poles located at: z = ±j0.95,z = 0.95e ±j9π/20,z = 0.95e ±jπ/20. (a) Plot the pole-zero diagram ofh(z) in the z-plane and provide its region of convergence. (b) Sketch the magnitude response H(e jω ) directly from the pole-zero plot, and indicate the approximate gain at ω = π/2. (c) What type of frequency-selective filter is H(e jω )? Explain your answer. (d) Answer the following questions, explaining your answers: i. Is H(z) an IIR or FIR filter? ii. Is H(z) a stable filter? iii. Is h[n], the impulse response of the filter, a real function? (0 marks) 3 4

PART B Wavelets and frames. P: Let the functionf(t) be defined by sin(nπt) < t < f(t) = 0 elsewhere () P2: Consider the following complete set of orthonormal functions on the interval(,): 2,{cos(nπt) n N},{sin(nπt) n N} (2) Utilizing Dirac s bracket notation, consider the following resolution of identity for the L 2 space of functions with support(,): I = >< + cos(nπt) >< cos(nπt) 2 2 P-a: Calculate f(t) 2, thel 2 norm off(t). P-b: Let f(t) denotef(t) normalized; i.e., f(t) 2 =. Write down the expression for f(t). + sin(nπt) >< sin(nπt) (3) Let the functionf(t) satisfy Dirichlet s conditions on the interval(,), and be zero outside this interval. In bracket notation write f(t) > forf(t). Operate (3) from the left onto the function f(t) > to obtain: I f(t) >= >< f(x) > + cos(nπt) >< cos(nπt) f(t) > 2 2 + sin(nπt) >< sin(nπt) f(t) > It is self-evident that certain groups of terms in (4) vanish for even- or odd-functions, and thus the Eq. (4) simplifies for such functions. P2-a: Simplify the expression on the right-hand side of the Eq. (4) for functionsf(t) satisfying the conditionf( t) = f(t) on the interval(,). P2-b: Deduce from your result obtained in P2-a the expression for the resolution of identity, which characterizes the space of even functions with support(,). (4) P2-c: Simplify the expression on the right-hand side of the Eq. (4) for functionsf(t) satisfying the condition f( t) = f(t) on the interval(, ). P2-d: Deduce from your result obtained in P2-c the expression for the resolution of identity, which characterizes the space of odd functions with support(,). 5 6

P3: Let the functionsϕ(t) and ψ(t) denote the scaling function and the wavelet for a Multiresolution Analysis (MRA) in Hilbert space. Let the functionϕ(t) generate the function spaceν 0. Let the functionψ(t) and its compressed versions generate the spaces W 0, W, W 2,. Assume the following representation forf(t) is valid: f(t) = k= c k ϕ(t k)+ Consider the right-hand side of (5). P3-a: Why is the first term a single series? j=0 k= d j,k 2 j 2 ψ(2 j t k) (5) P3-b: Why is the second term (following the summation sign) a double series? P3-c: Write down the expression for c k. P3-d: Write down the expression for d j,k. P3-e: Utilize Dirac s bracket notation, and consider the results obtained in P3-c and P3-d. In the light of your results deduce the expression for the resolution of identity from (5). P3-f: Let j run from to. Considering the result obtained in the previous step, deduce the expression for the resolution of identity, when j varies from to. (6 marks) P4-a: Given the general low pass filter coefficient h(n) write down the two-scale dilation equation for the scaling function. P4-b: Given the general high pass filter coefficients g(n) write down the two-scale dilation equation for the wavelet. P5-a: Determine the filter coefficients h(n) for the triangle (piece-wise linear) scaling function. P5-b: The coefficientsh(n), characterizing the triangle (piece-wise linear) scaling function, constitute a low pass filter. Why? P5-c: Determine the filter coefficients g(n) for the triangle (piece-wise linear) wavelet. P5-d: The coefficientsg(n), characterizing the triangle (piece-wise linear) wavelet, constitute a high pass filter. Why? P6: Given a fairly general functionf(t). Apply Meyer s orthogonalization technique to f(t). (4 marks) P7: Using the general dilation equation for the waveletψ(t), express the three-generations compressed normalized wavelet in terms of2 4 2ϕ(2 4 t n) summed overn. 2 3 2 ψ(2 3 t m) (4 marks) P8: The Mexican-hat waveletm h (t) can be obtained by taking the second derivative of the negative Gaussian function: Sketch the Mexican-hat waveletm h (t). G(t) = 2 e t2 7 8

P9: Ordinarily signal-analysis and signal -synthesis are carried out by using a system of orthonormal basis (ONB) functions. However, if the orthonormality condition of the analysis basis functions is violated, a system of dual basis functions is required for accomplishing the synthesis of signals. The following problem illustrates the content of this concept in terms of vectors. Let e > and e 2 > be unit normal vectors in the(x,y) plane. Let the vectors f > and f 2 > be defined by the following equations: f > = 2 e > + e 2 > (6a) f 2 > = 2 e > +4 e 2 > (6b) Evidently, the vectors f > and f 2 > are neither normal nor orthogonal. Provide a sketch of the vectors f > and f 2 >. Construct the dual vectors< f and < f 2 corresponding to f > and f 2 >, respectively, first graphically and then analytically. Employ Dirac s bracket notation. Resolve the identity operatoriin the plane (i.e., the2 2 unity matrix) in terms of the ket-vectors f > and f 2 > and their dual bra-vectors< f and < f 2. (3 marks) P0: In the foregoing problem it was mentioned that customarily signal-analysis and signal-synthesis are carried out by using a system of orthonormal basis (ONB) functions. However, if the analysis functions are over-complete (they constitute a frame), a system of over-complete functions (dual frames) is required for accomplishing the synthesis of signals. The following problem illustrates the content of this concept in terms of vectors. Let e > and e 2 > denote unit normal vectors in the(x,y) plane. Let the ket vectors f >, f 2 > and f 3 > be defined by the following equations: f > = e > (7a) f 2 > = e > e 2 > (7b) f 3 > = e > + e 2 > (7c) The over-complete set of vectors f >, f 2 > and f 3 > constitutes a frame. The dual frame (bra vectors)< f, < f 2 and < f 3 are given as follows: < f = 3 < e < f 2 = 3 < e 2 < e 2 < f 3 = 3 < e + 2 < e 2 (8a) (8b) (8c) Resolve the identity operatoriin the plane (i.e., the2 2 unity matrix) in terms of the frame vectors f >, f 2 > and f 3 > and their dual frame vectors< f,< f 2 and< f 3. (7 marks) 9 0

Fourier transform properties Sequencesx[n],y[n] Transforms X(e jω ), Y(e jω ) Property ax[n] + by[n] ax(e jω ) + by(e jω ) Linearity x[n n d] e jωn dx(e jω ) Time shift e jω 0 n x[n] X(e j(ω ω 0 ) ) Frequency shift x[ n] X(e jω ) Time reversal nx[n] j dx(ejω ) dω Frequency diff. x[n] y[n] X(e jω )Y(e jω ) Convolution x[n]y[n] 2π Common Fourier transform pairs Sequence π π X(ejθ )Y (e j(ω θ) )dθ Fourier transform δ[n] Modulation δ[n n 0] e jωn 0 ( < n < ) k= 2πδ(ω + 2πk) a n u[n] ( a < ) u[n] ae jω e jω + k= πδ(ω + 2πk) (n + )a n u[n] ( a < ) {( ae jω ) 2 sin(ωcn) ω < πn X(e jω ωc ) = 0 ω c < ω π { 0 n M sin[ω(m+)/2] x[n] = e jωm/2 sin(ω/2) 0 otherwise e jω 0 n k= 2πδ(ω ω0 + 2πk) Common z-transform pairs { a n Sequence Transform ROC δ[n] All z u[n] z z > u[ n ] z z < δ[n m] z m All z except 0 or a n u[n] az a n u[ n ] az na n az u[n] ( az ) 2 na n az u[ n ] ( az ) 2 0 n N, 0 otherwise cos(ω 0n)u[n] r n cos(ω 0n)u[n] z > a z < a z > a z < a a N z N az z > 0 cos(ω 0 )z 2cos(ω 0 )z +z 2 z > r cos(ω 0 )z 2r cos(ω 0 )z +r 2 z 2 z > r