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

Similar documents
Lecture 19 IIR Filters

Digital Signal Processing Lecture 4

Digital Signal Processing, Homework 2, Spring 2013, Prof. C.D. Chung. n; 0 n N 1, x [n] = N; N n. ) (n N) u [n N], z N 1. x [n] = u [ n 1] + Y (z) =

VU Signal and Image Processing

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 )

Chap 2. Discrete-Time Signals and Systems

III. Time Domain Analysis of systems

EEL3135: Homework #4

Linear Convolution Using FFT

Digital Signal Processing Lecture 3 - Discrete-Time Systems

Examples. 2-input, 1-output discrete-time systems: 1-input, 1-output discrete-time systems:

ECE-314 Fall 2012 Review Questions for Midterm Examination II

SIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals

X (z) = n= 1. Ã! X (z) x [n] X (z) = Z fx [n]g x [n] = Z 1 fx (z)g. r n x [n] ª e jnω

Stability Condition in Terms of the Pole Locations

Lecture 11 FIR Filters

Chapter 2 Time-Domain Representations of LTI Systems

Chapter Intended Learning Outcomes: (i) Understanding the relationship between transform and the Fourier transform for discrete-time signals

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

EE123 Digital Signal Processing

(i) Represent discrete-time signals using transform. (ii) Understand the relationship between transform and discrete-time Fourier transform

ESE 531: Digital Signal Processing

Transform analysis of LTI systems Oppenheim and Schafer, Second edition pp For LTI systems we can write

Basic concepts in DT systems. Alexandra Branzan Albu ELEC 310-Spring 2009-Lecture 4 1

Digital Signal Processing Lecture 5

3.2 Complex Sinusoids and Frequency Response of LTI Systems

UNIT 1. SIGNALS AND SYSTEM

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

Z-Transform. x (n) Sampler

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 signals and systems

EE482: Digital Signal Processing Applications

Chapter 7: The z-transform

Review of Fundamentals of Digital Signal Processing

ESE 531: Digital Signal Processing

Multidimensional digital signal processing

! z-transform. " Tie up loose ends. " Regions of convergence properties. ! Inverse z-transform. " Inspection. " Partial fraction

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

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

Discrete-time Signals and Systems in

ECE 301 Fall 2011 Division 1 Homework 5 Solutions

Review of Discrete-Time System

2. CONVOLUTION. Convolution sum. Response of d.t. LTI systems at a certain input signal

Responses of Digital Filters Chapter Intended Learning Outcomes:

8 The Discrete Fourier Transform (DFT)

# FIR. [ ] = b k. # [ ]x[ n " k] [ ] = h k. x[ n] = Ae j" e j# ˆ n Complex exponential input. [ ]Ae j" e j ˆ. ˆ )Ae j# e j ˆ. y n. y n.

The z-transform Part 2

Cosc 3451 Signals and Systems. What is a system? Systems Terminology and Properties of Systems

Discrete-Time Systems

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

Module 4 : Laplace and Z Transform Problem Set 4

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

ELEG 305: Digital Signal Processing

Lecture 7 - IIR Filters

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

Rui Wang, Assistant professor Dept. of Information and Communication Tongji University.

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

Discrete-Time Fourier Transform

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

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

University Question Paper Solution

Therefore the new Fourier coefficients are. Module 2 : Signals in Frequency Domain Problem Set 2. Problem 1

EE 210. Signals and Systems Solutions of homework 2

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

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

Review of Fundamentals of Digital Signal Processing

Lecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE

Analog vs. discrete signals

Module 1: Signals & System

Solutions: Homework Set # 5

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

Z Transform (Part - II)

PROBLEM SET 3. Note: This problem set is a little shorter than usual because we have not covered inverse z-transforms yet.

Very useful for designing and analyzing signal processing systems

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

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

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

Digital Signal Processing. Midterm 1 Solution

Use: Analysis of systems, simple convolution, shorthand for e jw, stability. Motivation easier to write. Or X(z) = Z {x(n)}

Lecture 18: Stability

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

Introduction to DSP Time Domain Representation of Signals and Systems

The Discrete-Time Fourier


EEE 303 HW#2 Solutions 1.43 a.

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

Final Exam January 31, Solutions

E : Lecture 1 Introduction

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

Fourier Analysis and Spectral Representation of Signals

LTI Systems (Continuous & Discrete) - Basics

Lecture 2 Discrete-Time LTI Systems: Introduction

EE Homework 5 - Solutions

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.

z-transform Chapter 6

Discrete-Time Signals & Systems

Z-Transform. 清大電機系林嘉文 Original PowerPoint slides prepared by S. K. Mitra 4-1-1

Discrete-Time Fourier Transform (DTFT)

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

Transcription:

Digital Signal Processing, Homework, Spring 203, Prof. C.D. Chung. (0.5%) Page 99, Problem 2.2 (a) The impulse response h [n] of an LTI system is known to be zero, except in the interval N 0 n N. 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 and N 5 in terms of N 0, N, N 2, and N 3. (b) If x [n] is zero, except for N consecutive points, and h [n] is zero, except for M consecutive points, what is the maximum number of consecutive points for which y [n] can be nonzero? Sol: For an LTI system, the output is obtained from the convolution of the input with the impulse response of the system: y [n] (a) Since h [k] 6 0, for (N 0 n N ), y [n] k XN The input, x [n] 6 0, for (N 2 n N 3 ), so h [k] x [n k] kn 0 h [k] x [n k] x [n k] 6 0, for N 2 n k N 3 Note that the minimum value of (n k) is N 2. Thus, the lower bound on n, which occurs for k N 0 is N 4 N 0 + N 2. Using a similar argument, Therefore, the output is nonzero for N 5 N + N 3. (N 0 + N 2 ) n (N + N 3 ). (b) If x [n] 6 0, for some n 0 n (n 0 + N ), h [k] 6 0, for some n n (n + M ), the results of part (a) imply that the output is nonzero for: (n 0 + n ) n (n 0 + n + M + N 2) So the output sequence is M + N samples long. This is an important quality of the convolution for nite length sequences as we shall see in Chapter 8. 2. (0.5%) Page 99, Problem 2.7 Determine whether each of the following signals is periodic. If the signal is periodic, state its period.

(a) x[n] e j(n6) (b) x[n] e j(3n4) (c) x[n] [sin(n5)](n) (d) x[n] e jnp 2 Sol: x [n] is periodic with period N if x [n] x [n + N] for some integer N. (a) x [n] is periodic with period 2: e j( n) 6 e j( 6 n)(n+n) e j( n+2k) 6 ) 2k N, for intergers k; N 6 Making k and N 2 shows that x [n] has period 2. (b) x [n] is periodic with period 8: e j( 3 4 n) e j( 3 4 n)(n+n) e j( 3 n+2k) 4 ) 2k 3 N, for intergers k; N 4 ) N 8 k, for intergers k; N 3 The smallest k for which both k and N are integers is 3, resulting in the period N being 8. (c) x [n] [sin (n5)] (n) is not periodic because the denominator term is linear in n. (d) We will show that x [n] is not periodic. Suppose that x [n] is periodic for some period N: e j p2 n (n+n) e j p2 n+2k e j p2 n ) 2k p 2 N, for intergers k; N ) N 2 p 2k, for intergers k; N There is no integer k for which N is an integer. Hence x[n] is not periodic. 3. (0.5%) Page 0, Problem 2.5 Consider the system illustrated in Figure P2.5. The output of an LTI system with an impulse response h[n] ( 4 )n u [n + 0] is multiplied by a unit step function u [n] to yield the output of the overall system. Answer each of the following questions, and brie y justify your answers: 2

(a) Is the overall system LTI? (b) Is the overall system causal? (c) Is the overall system stable in the BIBO sense? Sol: x [n] is periodic with period N if x [n] x [n + N] for some integer N. (a) No. Consider the following input/output: x [n] [n] ) y [n] 4 n u [n] x 2 [n] [n ] ) y 2 [n] 4 n u [n] Even though x 2 [n] x [n ] ; y 2 [n] 6 y [n ] 4 n u [n ]. (b) No. Consider the input/output pair x 2 [n] and y 2 [n] above. x 2 [n] 0 for n <, but y 2 [0] 6 0. (c) Yes. Since h [n] is stable and multiplication with u [n] will not cause any sequences to become unbounded, the entire system is stable. 4. (0.5%) Page 03, Problem 2.23 For each of the following systems, determine whether the system is () stable, (2) causal, (3) linear, and (4) time invariant. (a) T (x [n]) (cos n) x [n] (b) T (x [n]) x [n 2 ] (c) T (x[n]) x [n] [n k] (d) T (x[n]) Sol: kn k0 x [k] : (a) Since cos (n) only takes on values of + or, this transformation outputs the current value of x [n] multiplied by either. T (x [n]) ( ) n x [n]. Hence, it is stable, because it doesn t change the magnitude of x [n] and hence satis es bounded-in/bounded-out stability. It is causal, because each output depends only on the current value of x [n]. It is linear. Let y [n] T (x [n]) cos (n) x [n], and y 2 [n] T (x 2 [n]) cos (n) x 2 [n]. Now T (ax [n] + bx 2 [n]) cos (n) (ax [n] + bx 2 [n]) ay [n] + by 2 [n] It is not time-invariant. If y [n] T (x [n]) ( ) n x [n], then T (x [n ]) ( ) n x [n ] 6 y [n ]. (b) This transformation simply samples x [n] at location which can be expressed as k 2. The system is stable, since if x [n] is bounded, x [n 2 ] is also bounded. 3

It is not causal. For example, T (x [4]) x [6]. It is linear. Let y [n] T (x [n]) x [n 2 ], and y 2 [n] T (x 2 [n]) x 2 [n 2 ]. Now T (ax [n] + bx 2 [n]) ax n 2 + bx 2 n 2 ay [n] + by 2 [n] It is not time-invariant. If y [n] T (x [n]) x [n 2 ], then T (x [n ]) x [n 2 ] 6 y [n ]. (c) First notice that [n k0 k] u [n] So T (x [n]) x [n] u [n]. This transformation is therefore stable, causal, linear, but not time-invariant. To see that it is not time invariant, notice that T ( [n]) [n], but T ( [n + ]) 0. (d) T (x[n]) P kn x [k] : This is not stable. For example, for T (u[n]) all n. It is not causal, since it sums forward in time. It is linear, since kn It is time-invariant. Let ax [k] + bx 2 [k] a kn y [n] T (x [n]) x [k] + b kn x [k], kn x 2 [k] then T (x [n n 0 ]) x [k] y [n n 0 ]. kn n 0 5. (0.5%) Page 04, Problem 2.28 Consider the di erence equation y [n] + 5 y [n ] 2 y [n 2] x [n]. 5 (a) Determine the general form of the homogeneous solution to this equation. (b) Both a causal and an anticausal LTI system are characterized by the given di erence equation. Find the impulse responses of the two systems. (c) Show that the causal LTI system is stable and the anticausal LTI system is unstable. 4

(d) Find a particular solution to the di erence equation when x [n] (35) n u [n]. Sol: (a) The homogeneous solution y h [n] solves the di erence equation when x [n] 0. It is in the form y h [n] P A (c) n, where the c s solve the quadratic equation c 2 + 5 c 2 5 0 So for c 3 and c 25, the general form for the homogeneous solution is : n n 2 y h [n] A + A 2 3 5 (b) We use the z-transform, and use di erent ROCs to generate the causal and anticausal impulses responses: H (z) 5 z + 2 z z + 6 3 5 3 + 2z 5 n u [n] + 6 n 2 u [n] h c [n] 5 3 n 5 h ac [n] u [ n ] 3 5 6 n 2 u [ n ] 5 (c) Since h c [n] is causal, and the two exponential bases in h c [n] are both less than, it is absolutely summable. h ac [n] grows without bounds as n approaches. (d) Y (z) X (z) H (z) 3 5 + 2z 3 5 2544 3z + 255 + 25z + 2720 35z n 25 y [n] u [n] + 55 n 2 u [n] + 27 n 3 u [n] 44 3 2 5 20 5 6. (0.5%) Page 05, Problem 2.29 Three systems A, B, and C have the inputs and outputs indicated in Figure P2.29. Determine whether each system could be LTI. If your answer is yes, specify whether there could be more than one LTI system with the given input-output pair. Explain your answer. 5

Sol: x [n] is periodic with period N if x [n] x [n + N] for some integer N. System A: n x [n] 2 This input is an eigenfunction of an LTI system. That is, if the system is linear, the output will be a replica of the input, scaled by a complex constant. Since y [n] 4 n, System A is NOT LTI. System B: The Fourier transform of x [n] is X(e j! ) The output is y [n] 2x [n], thus x [n] e jn8 u [n] Y e j! n n0 e jn8 u [n] e j!n e j(! 8)n e j(! 8). 2 e j(! 8). Therefore, the frequency response of the system is H e j! Y (ej! ) X(e j! ) 2. Hence, the system is a linear ampli er. We conclude that System B is LTI, and unique. 6

System C : Since x [n] e jn8 is an eigenfunction of an LTI system, we would expect the output to be given by y [n] e jn8 ; where is some complex constant, if System C were indeed LTI. The given output, y [n] 2e jn8, indicates that this is so. Hence, System C is LTI. However, it is not unique, since the only constraint is that H e j! j!8 2. 7. (0.5%) Page 05, Problem 2.30 If the input and output of a causal LTI system satisfy the di erence equation y[n] ay[n ] + x[n], then the impulse response of the system must be h[n] a n u[n]. (a) For what values of a is this system stable? (b) Consider a causal LTI system for which the input and output are related by the di erence equation y[n] ay[n ] + x[n] a N x[n N], where N is a positive integer. Determine and sketch the impulse response of this system. Hint: Use linearity and time-invariance to simplify the solution. (c) Is the system in part (b) an FIR or an IIR system? Explain. (d) For what values of a is the system in part (b) stable? Explain. Sol: (a) LTI systems are stable i Then n jh [n]j < (the summation should converge). S n jaj n n0 jaj n u [n] S will converge only when jaj < and S jaj <. Therefore the system is stable for jaj <. 7

(b) y [n] ay [n ] + x [n] a N x [n N]. Therefore, h [n] ah [n ] + [n] a N [n N]. Since the system is causal, h [ ] 0. Then h [0] 0 + 0 h [] a, h [2] a 2, h [N] a N a N 0 h [N + ] a 0 + 0 0 0. (c) We see that even though it is a recursive system (with feedback), its impulse response nite in length. The length of h [n] is N terms. Hence this system is FIR. (d) FIR systems are always stable as the sum jh [n]j has at most a nite number of nonzero terms. 8. (0.5%) Page 07, Problem 2.36 n An LTI discrete-time system has frequency response given by H(e j! ) ( je j! )( + je j! ) 0:8e j! + e j2! 0:8e j! 0:8e j! + e j2! 0:8e j!. (a) Use one of the above forms of the frequency response to obtain an equation for the impulse response h[n] of the system. (b) From the frequency response, determine the di erence equation that is satis ed by the input x[n] and the output y[n] of the system. (c) If the input to this system is x[n] 4 + 2 cos(! 0 n) for < n < for what value of! 0 will the output be of the form y[n] A constant for < n <? What is the constant A? 8

Sol: (a) (b) H(e j! j2! e ) + 0:8ej! 0:8e j! h [n] (0:8) n u [n] + (0:8) n 2 u [n 2] H(e j! ) Y (ej! ) X(e j! ) + e j2! 0:8e j! Y e j! 0:8e j! Y e j! X e j! + e j2! X e j! y [n] 0:8y [n ] x [n] + x [n 2] y [n] 0:8y [n ] + x [n] + x [n 2] (c) Using the frequency response we can write the output as y [n] H(e j0 )4 + 2 H e j! 0 cos!0 n + 6 H e j! 0. To get y [n] constant we need jh (e j! 0 )j 0, which means + e j2! 0! 0 2. Then y [n] 4 + 40. 0:8 9. (0.5%) Page 0, Problem 2.44 Consider the cascade of LTI discrete-time systems shown in Figure P2.44. 0, or The rst system is described by the equation H (e j! ) ; j!j < 0:5, 0; 0:5 j!j <, and the second system is described by the equation The input to this system is y[n] w[n] w[n ]. x[n] cos(0:6n) + 3[n 5] + 2. Determine the output y[n]. With careful thought, you will be able to use the properties of LTI systems to write down the answer by inspection. 9

Sol: First x [n] goes through a lowpass lter with cuto frequency 0:5. Since the cosine has a frequency of 0:6, it will be ltered out. The delayed impulse will be ltered to a delayed sinc and the constant will remain unchanged. We thus get: y [n] is then given by: 0. (0.5%) Page 4, Problem 2.54 sin (0:5 (n 5)) w [n] 3 + 2. (n 5) sin (0:5 (n 5)) y [n] 3 (n 5) Consider the system in Figure P2.54. 3 sin (0:5 (n 6)). (n 6) (a) Determine the impulse response h[n] of the overall system. (b) Determine the frequency response of the overall system. (c) Specify a di erence equation that relates the output y[n] to the input x[n]. (d) Is this system causal? Under what condition would the system be stable? Sol: (a) From the gure, y [n] (x [n] + x [n] h [n]) h 2 [n] (x [n] ( [n] + h [n])) h 2 [n]. Let h[n] be the impulse response of the overall system, y [n] x [n] h [n]. Comparing with the above expression, h [n] ( [n] + h [n]) h 2 [n] h 2 [n] + h [n] h 2 [n] n u [n] + (n ) u [n ]. 0

(b) Taking the Fourier transform of h[n] from part (a), H e j! h [n] e j!n n n n u [n] e j!n + n e j!n + n0 `0 (` (n ) u [n ] e j!n n ) e j!`, where we have used ` (n ) in the second sum. H e j! j! e + e j! e j! j! + e, for jj < e j! Note that the Fourier transform of n u [n] is well known, and the second term of h[n] (see part (a)) is just a scaled and shifted version of n u [n]. So, we could have used the properties of the Fourier transform to reduce the algebra. (c) We have cross multiplying, H e j! Y (ej! ) X(e j! ) j! + e e, j! Y e j! e j! X(e j! ) + e j! taking the inverse Fourier transform, we have (d) From part (a): y [n] y [n ] x [n] + x [n ]. h [n] 0; for n < 0 This implies that the system is CAUSAL. If the system is stable, its Fourier transform exists. Therefore, the condition for stability is the same as the condition imposed on the frequency response of part (b). That is, STABLE, if jj <.