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

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

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

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

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

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

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

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

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

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

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

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

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

EEL3135: Homework #4

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

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

ECE 301 Division 1 Final Exam Solutions, 12/12/2011, 3:20-5:20pm in PHYS 114.

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

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

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

EE301 Signals and Systems Spring 2016 Exam 2 Thursday, Mar. 31, Cover Sheet

Responses of Digital Filters Chapter Intended Learning Outcomes:

ELEN 4810 Midterm Exam

EECS 20N: Structure and Interpretation of Signals and Systems Final Exam Department of Electrical Engineering and Computer Sciences 13 December 2005

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

Computer Engineering 4TL4: Digital Signal Processing

Digital Signal Processing. Midterm 1 Solution

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

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

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

Stability Condition in Terms of the Pole Locations

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

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

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.

ECGR4124 Digital Signal Processing Exam 2 Spring 2017

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

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

EECE 301 Signals & Systems Prof. Mark Fowler

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 )

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

GATE EE Topic wise Questions SIGNALS & SYSTEMS

Digital Signal Processing. Midterm 2 Solutions

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

ECE 413 Digital Signal Processing Midterm Exam, Spring Instructions:

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

EE123 Digital Signal Processing

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

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

Final Exam 14 May LAST Name FIRST Name Lab Time

ECE-314 Fall 2012 Review Questions for Midterm Examination II

Problem Value

ECE503: Digital Signal Processing Lecture 5

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

LAST Name FOURIER FIRST Name Jean Baptiste Joseph Lab Time 365/24/7

UNIT-II Z-TRANSFORM. This expression is also called a one sided z-transform. This non causal sequence produces positive powers of z in X (z).

Discrete Time Fourier Transform (DTFT)

EE482: Digital Signal Processing Applications

Digital Filters Ying Sun

ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization

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

Continuous and Discrete Time Signals and Systems

Digital Signal Processing

Lecture 11 FIR Filters

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

Digital Signal Processing. Lecture Notes and Exam Questions DRAFT

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

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

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING

Test 2 Electrical Engineering Bachelor Module 8 Signal Processing and Communications

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

Problem Weight Score Total 100

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.

Discrete-time Signals and Systems in

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

The Z-Transform. Fall 2012, EE123 Digital Signal Processing. Eigen Functions of LTI System. Eigen Functions of LTI System

The Discrete Fourier Transform

Aspects of Continuous- and Discrete-Time Signals and Systems

DSP-I DSP-I DSP-I DSP-I

Generalizing the DTFT!

EE123 Digital Signal Processing

3.2 Complex Sinusoids and Frequency Response of LTI Systems

1 1.27z z 2. 1 z H 2

Chirp Transform for FFT

Problem Value

EE-210. Signals and Systems Homework 7 Solutions

ELEG 305: Digital Signal Processing

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

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

EECS 123 Digital Signal Processing University of California, Berkeley: Fall 2007 Gastpar November 7, Exam 2

Q1 Q2 Q3 Q4 Q5 Total

2. Typical Discrete-Time Systems All-Pass Systems (5.5) 2.2. Minimum-Phase Systems (5.6) 2.3. Generalized Linear-Phase Systems (5.

SAMPLE EXAMINATION PAPER (with numerical answers)

EE 224 Signals and Systems I Review 1/10

The Cooper Union Department of Electrical Engineering ECE111 Signal Processing & Systems Analysis Final May 4, 2012

Optimum Ordering and Pole-Zero Pairing of the Cascade Form IIR. Digital Filter

ESE 531: Digital Signal Processing

EE123 Digital Signal Processing

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

Signals and Systems Spring 2004 Lecture #9

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

Transcription:

EE538 Digital Signal Processing I Session 3 Exam Live: Wed., Sept. 8, 00 Cover Sheet Test Duration: 50 minutes. Coverage: Sessions -0. Open Book but Closed Notes. Calculators not allowed. This test contains three problems. All work should be done in the blue books provided. You must show all work for each problem to receive full credit. Do not return this test sheet, just return the blue books. Prob. No. Topic(s) Points. DT Correlation 30. LTI Systems (Causal): 30 Properties, Frequency Response Interconnection, Pole-Zero Diagram 3. Digital Upsampling 0

Problem. [30 points] Consider a very simplistic CDMA system with only two users assigned the following length orthogonal complex-value codes, respectively, which are two rows of a -point DFT matrix: User s code: c [n] ={, j,,j} User s code: c [n] ={,j,, j} Consider transmitting a block of two QAM symbols for each of the two users, User s two info. symbols: b [n] ={b [0],b []} User s two info. symbols: b [n] ={b [0],b [], } where b k [n] can take on one of four different complex values (for each value of k and n):. +j representing the bit pair {,} ;. -+j representing the bit pair {0,} ; 3. --j representing the bit pair {0,0} ;. -j representing the bit pair {,0} ; The transmitted code-division multiplexed block may be mathematically expressed as x[n] = b k [m]c k [n m], n =0,,..., 7 k= m=0 Given that the received block has the following numerical values x[n] ={ j, j, j, j, j, j, j, j} }{{} where the first entry above is the value of x[0], determine the numerical values of b [n],n= 0, andb [n],n=0,. Your answer should consist of numerical values all together. Show all work in arriving at your answer. Note that code is orthogonal to code and that the two users are synchronized.

EE538 Digital Signal Processing I Exam Fall 000 Problem. [30 points] Consider the causal, second-order difference equation below where it is noted that.905 =.95. y[n] = 0.95 y[n ] 0.905 y[n ] + x[n]+ x[n ] + x[n ] Consider implementing this second-order difference equation as two first-order systems in parallel (one pole each) as shown in the diagram. x[n] + y[n] (a) Determine and write the first-order difference equation for each of the two first-order systems in parallel. The upper first-order system has impulse response h [n] andis described by the difference equation y [n] =a () y [n ] + b () 0 x[n]+b () x[n ] The lower first-order system has impulse response h [n] and is described by the difference equation y [n] =a () y [n ] + b () 0 x[n]+b () x[n ] Determine the numerical values of a (i), b (i) 0,andb (i), i =, six values total. (b) For EACH of the two first-order systems, i =,, do the following: (i) Plot the pole-zero diagram. (ii) State and plot the region of convergence for H i (z). (iii) Determine the DTFT of h i [n] and plot the magnitude H i (ω) over the interval <ω<showing as much detail as possible. In particular, explicitly point out if there are any values of ω for which H i (ω) is exactly zero. 3

EE538 Digital Signal Processing I Exam Fall 00 Problem 3. [0 points] X a (F) /W H (ω) W W F 3 3 ω x a (t) Ideal A/D F = W s x [n] w [n] Lowpass Filter ω = ω = 3 p s gain = Figure. The analog signal x a (t) with CTFT X a (F ) shown above is input to the system above, where x[n] =x a (n/f s )withf s =W,and h [n] = sin( n) cos( n) n, <n<, n such that H (ω) =for ω, H (ω) =0for 3 ω, andh (ω) has a cosine roll-off from at ω p = to 0 at ω s = 3. Finally, the zero inserts may be mathematically described as { x( n), n even w[n] = 0, n odd (a) Plot the magnitude of the DTFT of the output y[n], Y (ω), over <ω<. (b) Given that x[n] = sin( n) <n<, n provide an analytical expression for y[n] for <n< (similar to the expression for either x[n] orh [n] above, for example.) THIS PROBLEM IS CONTINUED ON THE NEXT PAGE.

(c) The up-sampling by a factor of in Figure can be efficiently done via the block diagram in Figure below. (i) Provide an analytical expression for h 0 [n] =h [n] for <n<. Simplify as much as possible. (ii) Plot the magnitude of the DTFT of h 0 [n], H 0 (ω), over <ω<. (iii) Provide an analytical expression for the output y 0 [n] for <n<. (iv) Plot the magnitude of the DTFT of h [n], H (ω), over <ω<. (v) Plot the phase of the DTFT of h [n], H (ω), over <ω<. (vi) Provide an analytical expression for the output y [n] for <n<. 0 = =y[n] 0 y[n] x [n] interleaver = h [n+] Figure. =y[n+] 5