Homework 4. May An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt

Similar documents
EE 224 Signals and Systems I Review 1/10

Chapter 5 Frequency Domain Analysis of Systems

Homework 7 Solution EE235, Spring Find the Fourier transform of the following signals using tables: te t u(t) h(t) = sin(2πt)e t u(t) (2)

EE 3054: Signals, Systems, and Transforms Summer It is observed of some continuous-time LTI system that the input signal.

Chapter 5 Frequency Domain Analysis of Systems

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

ECE 301 Fall 2011 Division 1 Homework 10 Solutions. { 1, for 0.5 t 0.5 x(t) = 0, for 0.5 < t 1

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

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

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.

2A1H Time-Frequency Analysis II Bugs/queries to HT 2011 For hints and answers visit dwm/courses/2tf

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

2A1H Time-Frequency Analysis II

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

ECE 3084 QUIZ 2 SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING GEORGIA INSTITUTE OF TECHNOLOGY APRIL 2, Name:

Chap 4. Sampling of Continuous-Time Signals

Signal and systems. Linear Systems. Luigi Palopoli. Signal and systems p. 1/5

EC Signals and Systems

Signals and Systems Spring 2004 Lecture #9

Fourier transform representation of CT aperiodic signals Section 4.1

EE Homework 13 - Solutions

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

2.1 Basic Concepts Basic operations on signals Classication of signals

IB Paper 6: Signal and Data Analysis

Homework 5 EE235, Summer 2013 Solution

DEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING EXAMINATIONS 2010

ANALOG AND DIGITAL SIGNAL PROCESSING CHAPTER 3 : LINEAR SYSTEM RESPONSE (GENERAL CASE)

Homework: 4.50 & 4.51 of the attachment Tutorial Problems: 7.41, 7.44, 7.47, Signals & Systems Sampling P1

2.161 Signal Processing: Continuous and Discrete

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

2.161 Signal Processing: Continuous and Discrete

FROM ANALOGUE TO DIGITAL

Signals & Systems. Lecture 5 Continuous-Time Fourier Transform. Alp Ertürk

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

Question Paper Code : AEC11T02

Review: Continuous Fourier Transform

ELEN 4810 Midterm Exam

ECE 301: Signals and Systems Homework Assignment #7

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

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

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.

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

ECE 3620: Laplace Transforms: Chapter 3:

Problem Value

Homework 6 Solutions

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

1.1 SPECIAL FUNCTIONS USED IN SIGNAL PROCESSING. δ(t) = for t = 0, = 0 for t 0. δ(t)dt = 1. (1.1)

Assignment 4 Solutions Continuous-Time Fourier Transform

Professor Fearing EECS120/Problem Set 2 v 1.01 Fall 2016 Due at 4 pm, Fri. Sep. 9 in HW box under stairs (1st floor Cory) Reading: O&W Ch 1, Ch2.

4 The Continuous Time Fourier Transform

06/12/ rws/jMc- modif SuFY10 (MPF) - Textbook Section IX 1

Massachusetts Institute of Technology

Core Concepts Review. Orthogonality of Complex Sinusoids Consider two (possibly non-harmonic) complex sinusoids

Mathematical Foundations of Signal Processing

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

Fourier transform. Stefano Ferrari. Università degli Studi di Milano Methods for Image Processing. academic year

CH.3 Continuous-Time Linear Time-Invariant System

Ch 4: The Continuous-Time Fourier Transform

Continuous-Time Frequency Response (II) Lecture 28: EECS 20 N April 2, Laurent El Ghaoui

Fourier series for continuous and discrete time signals

Figure 1 A linear, time-invariant circuit. It s important to us that the circuit is both linear and time-invariant. To see why, let s us the notation

4.1 Introduction. 2πδ ω (4.2) Applications of Fourier Representations to Mixed Signal Classes = (4.1)

MEDE2500 Tutorial Nov-7

ECEN 420 LINEAR CONTROL SYSTEMS. Lecture 2 Laplace Transform I 1/52

DESIGN OF CMOS ANALOG INTEGRATED CIRCUITS

Problem Value

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

1 Understanding Sampling

Bridge between continuous time and discrete time signals

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

Solutions to Problems in Chapter 4

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

Chapter 4 The Fourier Series and Fourier Transform

ECG782: Multidimensional Digital Signal Processing

Review of Fourier Transform

ESE 531: Digital Signal Processing

Lecture 8: Signal Reconstruction, DT vs CT Processing. 8.1 Reconstruction of a Band-limited Signal from its Samples

Module 4. Related web links and videos. 1. FT and ZT

PART 1. Review of DSP. f (t)e iωt dt. F(ω) = f (t) = 1 2π. F(ω)e iωt dω. f (t) F (ω) The Fourier Transform. Fourier Transform.

Homework 6 EE235, Spring 2011

Digital Signal Processing. Midterm 1 Solution

Laplace Transforms and use in Automatic Control

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

6.003 Homework #10 Solutions

Lecture 27 Frequency Response 2

Review of Discrete-Time System

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) =

LTI Systems (Continuous & Discrete) - Basics

This homework will not be collected or graded. It is intended to help you practice for the final exam. Solutions will be posted.

Discussion Section #2, 31 Jan 2014

2.161 Signal Processing: Continuous and Discrete Fall 2008

Discrete Time Fourier Transform

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

Problem Value

Chapter 6 THE SAMPLING PROCESS 6.1 Introduction 6.2 Fourier Transform Revisited

Properties of LTI Systems

Massachusetts Institute of Technology

X. Chen More on Sampling

EECE 3620: Linear Time-Invariant Systems: Chapter 2

ENSC327 Communications Systems 2: Fourier Representations. School of Engineering Science Simon Fraser University

Transcription:

Homework 4 May 2017 1. An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt Determine the impulse response of the system. Rewriting as y(t) = t e (t t ) x(t 2)dt y(t) = Let t 2 = τ in the original equation and y(t) = t 2 h(t τ)x(τ)dτ e (t 2 τ) x(τ)dτ h(t) = e (t 2) u(t 2) 2. Determine the minimum sampling frequency, f s, required to sample the following signals without aliasing (a) x(t) = (sin(1000πt)/πt) y(t) where y(t) is any signal in time domain Let k(t) = sin(1000πt)/πt) { 1 ω < 1000π K(jω) = 0 otherwise Now, X(jω) = K(jω)Y (jω) ω max in X(jω) is 1000π f s 2ω max = 1kHz 1

(b) f(t) = cos(6000πt) + 2 F (jω) = π[δ(ω 6000π) + δ(ω + 6000π)] + 4πδ(ω) (c) h(t) = f(t) sin(1000πt)/πt = ω max = 6000π = f s 2ω max G(jω) = { 1 ω < 1000π 0 ω > 1000π = 6kHz H(jω) = 1 F (jω) G(jω) = 1 2 [G(j(ω 6000π))+G(j(ω+6000π))]+G(jω)) = ω max = 7000π = f s 2ω max = 7kHz (d) x(t) = 3 cos(50πt) + 10 sin(300πt) cos(100πt) The frequencies of the signals are 25Hz, 150Hz and 50Hz. As the highest frequency is 150Hz, the Nyquist rate is 300Hz (e) x(t) = sinc(200πt) Fourier transform of x(t) will be a rectangular pulse with the highest angular frequency, ω max = 200π. Therefore, the Nyquist rate is 400π rad/sec or 200Hz. Note: Use the FT of K(jω) from part a) with appropriate scaling. (f) x(t) = sinc 2 (200πt) Let k(t) = sinc(200πt), then X(jω) = K(jω) K(jω) K(jω) is a rectangular pulse of bandwidth 400π rad/sec around 0, i.e. ω max = 200π rad/sec for rectangular pulse. The convolution of two rectangular pulse will be a triangular pulse with ω max = 400π rad/sec. Thus, the minimum sampling frequency is 400 Hz. (g) x(t) = sinc(200πt) + sinc 2 (200πt) ω max = 400π rad/sec from part e) and f). Thus minimum sampling frequency is 400 Hz. 3. The signal y(t) is generated by convolving a band-limited signal x 1 (t) with another band limited signal x 2 (t), that is, y(t) = x 1 (t) x 2 (t) 2

where, X 1 (ω) = 0 for ω > 1000π X 2 (ω) = 0 for ω > 2000π Impluse train sampling is performed on y(t) to obtain y p (t) = n= y(nt )δ(t nt ) Specify the range of values for the sampling period T which ensures that y(t) is recoverable from y p (t) Using the properties fo the Fourier transform we obtain Therefore Y (ω) = X 1 (ω)x 2 (ω) Y (ω) = 0 for ω > 1000π This implies that the Nyquist rate for y(t) is 2000π rad/sec. Therefore, the sampling period T can at most be 2000π = 10 3 sec. Therefore, T 10 3 sec in order to be able to recover y(t) from y p (t) 4. The sampling theorem, as we have derived it, states that a signal x(t) must be sampled at a rate higher than its bandwidth (or equivalently, a rate greater than its highest frequency). This implies that if x(t) has a spectrum as indicated by X(ω) (in the figure below) then x(t) must be sampled at a rate higher then 2ω 2. However, since the signal has most of its energy concentrated in a narrow band, it would seem reasonable to expect that a sampling rate lower than twice highest frequency could be used. When x(t) is real, a procedure for bandpass sampling and reconstruction is as outlined in this problem. It consists of multiplying x(t) by a complex exponential and then sampling the product. The sampling system is shown in Figure block diagram below. With x(t) real and with X(ω) nonzero only for ω 1 < ω < ω 2, the frequency is chosen to be ω 0 = (ω 1 + ω 2 )/2, and the lowpass filter H 1 (ω) has cutoff frequency ( 1 2 )(ω 2 ω 1 ) 3

(a) For X(ω) as shown in the figure sketch X p (ω) Let X 1 (ω) denote the Fourier transform of the signal x 1 (t) obtained by multiplying x(t) with e jω0t. Let X 2 (ω) be the Fourier transform of the signal x 2 (t) obtained at the output of the lowpass filter. Then, X 1 (ω), X 2 (ω) and X p (ω) are as shown in figure below. (b) Determine the maximum sampling period T such that x(t) is recoverable from x p (t) The Nyquist rate for the signal x 2 (t) is 2 ω2 ω1 2 = ω 2 ω 1. Therefore, the sampling period T must be at most avoid aliasing. ω 2 ω 1 in order to (c) Determine a system to recover x(t) from x p (t) A system that can be used to recover x(t) from x p (t) is shown in figure below 4

Let x 1 (t) be the input to the block Re{.}. X 1 (ω) is twice the left hand side triangular pulse of X(ω). Now, Re(x 1 (t)) = (x 1 (t) + x 1(t))/2. The equivalent operation is frequency domain is (X 1 (ω)+x 1 ( ω))/2. Note that for the given X 1 (ω), (X 1 (ω) + X 1 ( ω))/2 = X 1 (ω)/2 + X 1 ( ω)/2 = X(ω).Thus, x(t) is recovered at the output. 5. Let x(t) be a signal with Nyquist rate ω 0. Determine the Nyquist rate for each of the following signals: (a) x(t) + x(t 1) If the signal x(t) has Nyquist rate of ω 0, then its Fourier transform X(ω) = 0 for ω > ω 0 /2 Let signal x(t) have a Fourier transform X(ω), i.e. x(t) F X(ω)) Using the Fourier transform properties, y(t) = x(t) + x(t 1) F Y (ω) Y (ω) = X(ω) + e jω X(ω) = X(ω)(1 + e jω ) We can only guarantee that Y (ω) = 0 for ω > ω0 2. Therefore, the Nyquist rate for y(t) is also ω 0 (b) dx(t) dt Using the Fourier transform properties, y(t) = d(x(t) dt F Y (ω) Y (ω) = jωx(ω) We can only guarantee that Y (ω) = 0 for ω > ω0 2. Therefore, the Nyquist rate for y(t) is also ω 0. (c) x 2 (t) Using the Fourier transform properties, y(t) = x 2 F Y (ω) Y (ω) = 1 [X(ω) X(ω)] We can only guarantee that Y (ω) = 0 for ω > ω 0. Therefore, the Nyquist rate for y(t) is 2ω 0. 5

(d) x(t)cos(ω 0 t) Using the Fourier transform properties, y(t) = x(t)cos(ω 0 t) F Y (ω) Y (ω) = 1 2 [X(ω ω 0) + X(ω + ω 0 )] We can only guarantee that Y (ω) = 0 for ω > ω 0 + ω0 2. Therefore, the Nyquist rate for y(t) is 3ω 0. 6. Determine the convolution of each of the following pairs of signal x(t) and h(t) by calculating X(ω) and H(ω), and inverse transforming. Now verify your answers by computing the convolution in time domain. (a) x(t) = te 2t u(t), h(t) = e 4t u(t) We have Y (ω) = X(ω)H(ω) = 1 1 (2 + jω) 2 (4 + jω) Y (ω) = 1/4 4 + jω 1/4 2 + jω + 1/2 (2 + jω) 2 Taking the inverse Fourier transform we obtain y(t) = 1 4 e 4t u(t) 1 4 e 2t u(t) + 1 2 te 2t u(t) (b) x(t) = te 2t u(t), h(t) = te 4t u(t) We have 1 Y (ω) = X(ω)H(ω) = [ (2 + jω) 2 ][ 1 (4 + jω) 2 ] Y (ω) = 1/4 4 + jω + 1/4 (4 + jω) 2 + 1/4 2 + jω + 1/4 (2 + jω) 2 Taking the inverse Fourier transform we obtain y(t) = 1 4 te 4t u(t) 1 4 e 4t u(t) + 1 4 e 2t u(t) + 1 4 te 2t u(t) (c) x(t) = e t u(t), h(t) = e t u( t) We have 1 1 Y (ω) = X(ω)H(ω) = (1 + jω) (1 jω) Y (ω) = 0.5 (1 + jω) + 0.5 (1 jω) Taking the inverse Fourier transform we obtain y(t) = 1 2 e t 6

7. x(t) and h(t) are shown in the figure below. Find x(t)*h(t) The convolution is given by x(t) h(t) = x(τ)h(t τ)dτ Hence, inverting h(t) and shifting it [as denoted by h(t τ)], we find the overlap region between x(τ) and h(t τ) and find the integral 1 t < 0 0 t < 1 t y(t) = 2 e τ dτ = 2(e t e 1 ) 1 1 t < 2 0 τ y(t) = 2 e τ dτ + 2 e τ dτ = (4 2e 1 2e t ) 1 0 7

2 t < 3 0 y(t) = 2 e τ dτ + 2 1 1 0 e τ dτ = 4(1 e 1 ) 3 t < 4 0 y(t) = 2 e τ dτ + 2 t 3 1 0 e τ dτ = 4 2e 1 2e t 3 1 y(t) = 2 e τ dτ = 2(e 3 t e 1 ) t 3 8

elsewhere, y(t) = 0 Therefore, finally we have 0 t < 1 2(e t e 1 ) 1 t < 0 4 2(e t + e 1 ) 0 t < 1 y(t) = 4(1 e 1 ) 1 t < 2 4 2(e 1 + e t 3 ) 2 t < 3 2(e 3 t e 1 ) 3 t < 4 0 t 4 8. x(t) and h(t) are shown in the figure below. Find x(t)*h(t) The convolution is given by y(t) = x(t) h(t) = x(τ)h(t τ)dτ Hence, inverting h(t) and shifting it [as denoted by h(t τ)], we find the overlap region between x(τ) and h(t τ) and find the integral t 1 < 0 results in no overlap and hence the integral evaluates to zeros i.e. y(t) = 0 If t 1 > 0 and t 2 0 i.e. 1 < t 2 9

y(t) = t 1 If t 2 > 0 and t 3 0 i.e. 2 < t 3 0 ( 2)e τ dτ = 2(e (t 1) 1) y(t) = 2 t 2 If t 3 0 i.e. t 3 e τ dτ 2 t 1 0 t 2 e τ dτ = 2(1 + e (t 1) 2e (t 2) ) 10

y(t) = 2 t 2 e τ dτ 2 t 1 t 3 t 2 e τ dτ = 2(e (t 1) 2e (t 2) + e (t 3) ) Therefore, finally we have 0 t < 1 2(e (t 1) 1) 1 t 2 y(t) = 2(1 + e (t 1) 2e (t 2) ) 2 t < 3 2(e (t 1) 2e (t 2) + e (t 3) ) t > 3 11