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

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

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

Final Exam ECE301 Signals and Systems Friday, May 3, Cover Sheet

NAME: 13 February 2013 EE301 Signals and Systems Exam 1 Cover Sheet

EE538 Digital Signal Processing I Session 13 Exam 1 Live: Wed., Sept. 18, Cover Sheet

EEL3135: Homework #4

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

EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 20, Cover Sheet

Solution 10 July 2015 ECE301 Signals and Systems: Midterm. Cover Sheet

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

EE538 Final Exam Fall 2007 Mon, Dec 10, 8-10 am RHPH 127 Dec. 10, Cover Sheet

EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, Cover Sheet

NAME: ht () 1 2π. Hj0 ( ) dω Find the value of BW for the system having the following impulse response.

ELEN 4810 Midterm Exam

NAME: 20 February 2014 EE301 Signals and Systems Exam 1 Cover Sheet

ECGR4124 Digital Signal Processing Final Spring 2009

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

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

ECE 350 Signals and Systems Spring 2011 Final Exam - Solutions. Three 8 ½ x 11 sheets of notes, and a calculator are allowed during the exam.

Digital Signal Processing. Lecture Notes and Exam Questions DRAFT

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

NAME: 23 February 2017 EE301 Signals and Systems Exam 1 Cover Sheet

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

Digital Signal Processing. Midterm 2 Solutions

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

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

Solutions. Number of Problems: 10

ECE 413 Digital Signal Processing Midterm Exam, Spring Instructions:

ECGR4124 Digital Signal Processing Midterm Spring 2010

Final Exam of ECE301, Section 1 (Prof. Chih-Chun Wang) 1 3pm, Friday, December 13, 2016, EE 129.

Question Paper Code : AEC11T02

Computer Engineering 4TL4: Digital Signal Processing

Multirate signal processing

CITY UNIVERSITY LONDON. MSc in Information Engineering DIGITAL SIGNAL PROCESSING EPM746

Chap 2. Discrete-Time Signals and Systems

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

Digital Signal Processing. Midterm 1 Solution

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

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

Final Exam of ECE301, Prof. Wang s section 1 3pm Tuesday, December 11, 2012, Lily 1105.

New Mexico State University Klipsch School of Electrical Engineering. EE312 - Signals and Systems I Spring 2018 Exam #1

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

Q1 Q2 Q3 Q4 Q5 Total

ECGR4124 Digital Signal Processing Exam 2 Spring 2017

Quiz. Good luck! Signals & Systems ( ) Number of Problems: 19. Number of Points: 19. Permitted aids:

Stability Condition in Terms of the Pole Locations

Analog vs. discrete signals

ECE-314 Fall 2012 Review Questions for Midterm Examination II

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

Review of Discrete-Time System

x(t) = t[u(t 1) u(t 2)] + 1[u(t 2) u(t 3)]

8 The Discrete Fourier Transform (DFT)

Communications and Signal Processing Spring 2017 MSE Exam

SIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals

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

Final Exam January 31, Solutions


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

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

Question Bank. UNIT 1 Part-A

University Question Paper Solution

Flash File. Module 3 : Sampling and Reconstruction Lecture 28 : Discrete time Fourier transform and its Properties. Objectives: Scope of this Lecture:

ECE 301 Division 1 Exam 1 Solutions, 10/6/2011, 8-9:45pm in ME 1061.

Module 3. Convolution. Aim

New Mexico State University Klipsch School of Electrical Engineering. EE312 - Signals and Systems I Fall 2017 Exam #1

Multidimensional digital signal processing

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM. COURSE: ECE 3084A (Prof. Michaels)

Final Exam of ECE301, Prof. Wang s section 8 10am Tuesday, May 6, 2014, EE 129.

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

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

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

Digital Signal Processing Lecture 4

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

R13 SET - 1

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

E : Lecture 1 Introduction

ECE503: Digital Signal Processing Lecture 5

LAB 6: FIR Filter Design Summer 2011

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

EE-210. Signals and Systems Homework 7 Solutions

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

Ch. 7: Z-transform Reading

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

Introduction to DSP Time Domain Representation of Signals and Systems

Course and Wavelets and Filter Banks. Filter Banks (contd.): perfect reconstruction; halfband filters and possible factorizations.

Linear Convolution Using FFT

Problem Value

Detailed Solutions to Exercises

ENEE630 ADSP RECITATION 5 w/ solution Ver

Lecture 14: Windowing

Very useful for designing and analyzing signal processing systems

Basic Multi-rate Operations: Decimation and Interpolation

ESE 531: Digital Signal Processing

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

DIGITAL SIGNAL PROCESSING LECTURE 1

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

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

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

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

VII. Discrete Fourier Transform (DFT) Chapter-8. A. Modulo Arithmetic. (n) N is n modulo N, n is an integer variable.

Transcription:

ECE58 Final Exam Fall 7 Digital Signal Processing I December 7 Cover Sheet Test Duration: hours. Open Book but Closed Notes. Three double-sided 8.5 x crib sheets allowed This test contains five problems. You must show all work for each problem to receive full credit. No. Topic(s) of Problem Points. OFDM. Noble s Identities. Perfect Reconstruction Filter Bank. DFT s and Time-Domain Aliasing 5. Z-Transform, Difference Eqns., Bilinear Transform

Problem. An OFDM signal is synthesized as a sum of four sinewaves of length as x[n] = b k e jπk n {u[n] u[n ]} k= Each of the four values b k is one of the four QPSK values listed in the symbol alphabet below. b k {+j, j, +j, j} k =,,, We know in advance that the signal we transmit will be convolved with a filter of length L =. Thus, we add a cyclic prefix of length which effective creates a sum of sinewaves of length 7 as prescribed below: x[n] = b k e jπ k n {u[n+] u[n ]} k= The sequence of length 7 above is convolved with the filter below of length h[n] = {8,,} = 8δ[n]+δ[n ]+δ[n ] This ultimately yields the following sequence of length 7+- = 9 y[n] = x[n] h[n] = {+j, +6j,+7j,5 j,7+j, +5j,+7j,+j,+j} Your task is to determine the numerical values of each of the four symbols: b, b, b, and b. Explain and show all the steps in determining your answers. Please lay your work out nicely with logical ordering. Your work will be more important than your final answers.

This page left intentionally blank for student work.

This page left intentionally blank for student work.

This page left intentionally blank for student work. 5

Problem. [ points] Determine the impulse response h[n] in Figure.(b) so that the I/O relationship of the system in Figure.(b) is exactly the same as the I/O relationship of the system in Figure.(a). Plot the magnitude AND the phase (two separate plots) of the DTFT of h[n] over π < ω < π. Hint: Analyze the system of Figure.(a) in the frequency domain using one of Noble s Identities. = ( j) n sin( { π n) BP π n { Figure.(a). BP ( j) n sin( { πn) π n = =?? { Figure.(b). 6

This page left intentionally blank for student work for Problem. 7

This page left intentionally blank for student work for Problem. 8

g [n] g [n] x[n] Σ y [n] g [n] g [n] Figure (a). Analysis Filter Bank. Figure.. For Problem on Next Page. Figure (b). Synthesis Filter Bank. x[n] + s [n] y [n] h -[n] y [n] x[n-] x[n-] + + s [n] s [n] Matrix x B Matrix x A y [n] y [n] - - y [n-] y [n-] y[n] interleaver (clockwise) x[n-] + s [n] y [n] - y [n-] Figure.. For Problem on Next Page. 9

Problem. Consider the M = channel Filter Bank in Figure. on the previous page. You are to determine an efficient implementation of the entire structure having the form in Figure.. Then determine whether it achieves Perfect Reconstruction with the following causal analysis filters, each of which is of length and starts at n =. Achieving Perfect Reconstruction means the output is the same as the input except for possibly an amplitude-scaling and an integer-delay. h [n] = {,,, } h [n] = {,,, } h [n] = {,,,} h [n] = {,,,} The first element in each vector corresponds to n =. The corresponding synthesis filters are defined below. The four analysis filters and the four synthesis filters are all real-valued, and the synthesis filters are the time-reverses of the corresponding analysis filters according to g k [n] = h k [ n], k =,,, (a) Draw the efficient implementation of the top branch of the analysis side where the h [n] is followed by decimation by a factor of. The inputs for the efficient implementation should be x[n], x[n ], x[n ], x[n ]. (b) Draw the efficient implementation of the top branch of the synthesis side where zero-inserts is followed filtering by g [n] = h [ n] followed by decimation by a factor of. The outputs for the efficient implementation should be y[n], y[n ], y[n ], y[n ] and the commutator for the interleaver should operate clockwise. (c) Since all of the analysis and synthesis filters are each of length, the polyphase components are each of length. Thus, we can set h + [n] = δ[n] h + [n] = δ[n] h + [n] = δ[n] h + [n] = δ[n] h [n] = δ[n] h [n] = δ[n] h [n] = δ[n] h [n] = δ[n] With this in mind, the matrices B and A operate as follows. z [n] z [n] z [n] z [n] = b b b b b b b b b b b b b b b b x[n] x[n ] x[n ] x[n ] y[n] y[n ] y[n ] y[n ] = Determine the matrices A and B in this efficient implementation. a a a a a a a a a a a a a a a a (d) Determine if the Filter Bank achieves Perfect Reconstruction. Explain your answer. () z [n] z [n] z [n] z [n] NOTE: The matrices A and B are real-valued matrices that have nothing to do with a -pt DFT matrix.

This page left intentionally blank for student work for Problem.

This page left intentionally blank for student work for Problem.

This page left intentionally blank for student work for Problem.

Problem. Let x[n] be of length L =, i.e., x[n] = for n < and n and h[n] be of length M = 5, i.e., h[n] = for n < and n 5. Let X 6 (k) and H 6 (k) denote 6-point DFT s of x[n] and h[n], respectively. The 6-point inverse DFT of the product Y 6 (k) = X 6 (k)h 6 (k), denoted y 6 [n], produces the following values: n 5 y 6 [n] Let X 5 (k) and H 5 (k) denote the 5-point DFT s of the aforementioned sequences x[n] and h[n]. The 5-point inverse DFT of the product Y 5 (k) = X 5 (k)h 5 (k), denoted y 5 [n], produces the following values: n y 5 [n] Given y 6 [n] and y 5 [n], find the linear convolution of x[n] and h[n], i. e., list all of the numerical values of y[n] = x[n] h[n].

This page left intentionally blank for student work for Problem. 5

This page left intentionally blank for student work for Problem. 6

Problem 5. A second-order digital filter is to be designed from an analog filter having two poles in the s-plane at +j and j and two zeros at j and j, via the bilinear transformation method characterized by the mapping s = z z + (a) Is the resulting digital filter (BIBO) stable? Briefly explain why or why not. (b) Denote the frequency response of the resulting digital filter as H(ω) (the DTFT of its impulse response). You are given that in the range < ω < π, there is only one value of ω for which H(ω) =. Determine that value of ω. (c) Draw a pole-zero diagram for the resulting digital filter. Give the exact locations of the poles and zeros of the digital filter in the z-plane. (d) Plot the magnitude of the DTFT of the resulting digital filter, H(ω), over π < ω < π. You are given that H() =.8. Be sure to indicate any frequency for which H(ω) =. Also, specifically note the numerical value of H(ω) for ω = π and ω = π. (e) Determine the difference equation for the resulting digital filter. 7

This page left intentionally blank for student work for Problem 5. 8

This page left intentionally blank for student work for Problem 5. 9