Exponential Sawtooth

Similar documents
EECE 301 Signals & Systems Prof. Mark Fowler

Laplace Transform. Inverse Laplace Transform. e st f(t)dt. (2)

CHAPTER. Forced Equations and Systems { } ( ) ( ) 8.1 The Laplace Transform and Its Inverse. Transforms from the Definition.

6.8 Laplace Transform: General Formulas

Chapter 6. Laplace Transforms

To become more mathematically correct, Circuit equations are Algebraic Differential equations. from KVL, KCL from the constitutive relationship

EE Control Systems LECTURE 2

18.03SC Unit 3 Practice Exam and Solutions

Mon Apr 2: Laplace transform and initial value problems like we studied in Chapter 5

Chapter 9 - The Laplace Transform

CONTROL SYSTEMS. Chapter 3 Mathematical Modelling of Physical Systems-Laplace Transforms. Prof.Dr. Fatih Mehmet Botsalı

Discussion Session 2 Constant Acceleration/Relative Motion Week 03

Chapter 6. Laplace Transforms

Let. x y. denote a bivariate time series with zero mean.

Algorithmic Discrete Mathematics 6. Exercise Sheet

Continuous Time Linear Time Invariant (LTI) Systems. Dr. Ali Hussein Muqaibel. Introduction

t )? How would you have tried to solve this problem in Chapter 3?

Chapter 7: Inverse-Response Systems

23.2. Representing Periodic Functions by Fourier Series. Introduction. Prerequisites. Learning Outcomes

d 1 = c 1 b 2 - b 1 c 2 d 2 = c 1 b 3 - b 1 c 3

23.5. Half-Range Series. Introduction. Prerequisites. Learning Outcomes

Interpolation and Pulse Shaping

Laplace transfom: t-translation rule , Haynes Miller and Jeremy Orloff

( ) ( ) if t = t. It must satisfy the identity. So, bulkiness of the unit impulse (hyper)function is equal to 1. The defining characteristic is

Additional Methods for Solving DSGE Models

LAPLACE TRANSFORMS. 1. Basic transforms

2. VECTORS. R Vectors are denoted by bold-face characters such as R, V, etc. The magnitude of a vector, such as R, is denoted as R, R, V

Randomized Perfect Bipartite Matching

, the. L and the L. x x. max. i n. It is easy to show that these two norms satisfy the following relation: x x n x = (17.3) max

More on ODEs by Laplace Transforms October 30, 2017

EE202 Circuit Theory II

MATH 4330/5330, Fourier Analysis Section 6, Proof of Fourier s Theorem for Pointwise Convergence

CONTROL SYSTEMS. Chapter 10 : State Space Response

CHAPTER 7. Definition and Properties. of Laplace Transforms

5.2 GRAPHICAL VELOCITY ANALYSIS Polygon Method

Sample Final Exam (finals03) Covering Chapters 1-9 of Fundamentals of Signals & Systems

Problem Set If all directed edges in a network have distinct capacities, then there is a unique maximum flow.

EECE 301 Signals & Systems Prof. Mark Fowler

ME 452 Fourier Series and Fourier Transform

Challenge Problems. DIS 203 and 210. March 6, (e 2) k. k(k + 2). k=1. f(x) = k(k + 2) = 1 x k

e 2t u(t) e 2t u(t) =?

The Residual Graph. 11 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm

EE 313 Linear Signals & Systems (Fall 2018) Solution Set for Homework #8 on Continuous-Time Signals & Systems

13.1 Accelerating Objects

dt = C exp (3 ln t 4 ). t 4 W = C exp ( ln(4 t) 3) = C(4 t) 3.

6.302 Feedback Systems Recitation : Phase-locked Loops Prof. Joel L. Dawson

CHAPTER 7: SECOND-ORDER CIRCUITS

SOLUTIONS TO ECE 3084

1 CHAPTER 14 LAPLACE TRANSFORMS

CHAPTER 2 Signals And Spectra

PHYSICS 151 Notes for Online Lecture #4

Math 2142 Exam 1 Review Problems. x 2 + f (0) 3! for the 3rd Taylor polynomial at x = 0. To calculate the various quantities:

KEY. Math 334 Midterm I Fall 2008 sections 001 and 003 Instructor: Scott Glasgow

ES.1803 Topic 22 Notes Jeremy Orloff

Echocardiography Project and Finite Fourier Series

HOMEWORK # 2: MATH 211, SPRING Note: This is the last solution set where I will describe the MATLAB I used to make my pictures.

Module 2 F c i k c s la l w a s o s f dif di fusi s o i n

Piecewise-Defined Functions and Periodic Functions

Physics 240: Worksheet 16 Name

Main Reference: Sections in CLRS.

Section 3.5 Nonhomogeneous Equations; Method of Undetermined Coefficients

ECE Spring Prof. David R. Jackson ECE Dept. Notes 39

CHAPTER 3 SIGNALS & SYSTEMS. z -transform in the z -plane will be (A) 1 (B) 1 (D) (C) . The unilateral Laplace transform of tf() (A) s (B) + + (D) (C)

Chapter 2. First Order Scalar Equations

Linear Time-invariant systems, Convolution, and Cross-correlation

EECE 301 Signals & Systems Prof. Mark Fowler

The complex Fourier series has an important limiting form when the period approaches infinity, i.e., T 0. 0 since it is proportional to 1/L, but

Some Basic Information about M-S-D Systems

The Residual Graph. 12 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm

Serial : 4LS1_A_EC_Signal & Systems_230918

6.003 Homework #9 Solutions

Motion In One Dimension. Graphing Constant Speed

Simulation-Solving Dynamic Models ABE 5646 Week 2, Spring 2010

Laplace Transforms. Examples. Is this equation differential? y 2 2y + 1 = 0, y 2 2y + 1 = 0, (y ) 2 2y + 1 = cos x,

Notes 04 largely plagiarized by %khc

EECS 2602 Winter Laboratory 3 Fourier series, Fourier transform and Bode Plots in MATLAB

MATH 31B: MIDTERM 2 REVIEW. x 2 e x2 2x dx = 1. ue u du 2. x 2 e x2 e x2] + C 2. dx = x ln(x) 2 2. ln x dx = x ln x x + C. 2, or dx = 2u du.

Chapter 8: Response of Linear Systems to Random Inputs

Network Flows: Introduction & Maximum Flow

MATH 2050 Assignment 9 Winter Do not need to hand in. 1. Find the determinant by reducing to triangular form for the following matrices.

ln y t 2 t c where c is an arbitrary real constant

From Complex Fourier Series to Fourier Transforms

u(t) Figure 1. Open loop control system

ADDITIONAL PROBLEMS (a) Find the Fourier transform of the half-cosine pulse shown in Fig. 2.40(a). Additional Problems 91

Financial Econometrics Jeffrey R. Russell Midterm Winter 2009 SOLUTIONS

Math 334 Fall 2011 Homework 11 Solutions

Guest Lectures for Dr. MacFarlane s EE3350 Part Deux

Algorithms and Data Structures 2011/12 Week 9 Solutions (Tues 15th - Fri 18th Nov)

Math 333 Problem Set #2 Solution 14 February 2003

6.003: Signals and Systems. Relations among Fourier Representations

Chapter 15: Phenomena. Chapter 15 Chemical Kinetics. Reaction Rates. Reaction Rates R P. Reaction Rates. Rate Laws

Flow networks. Flow Networks. A flow on a network. Flow networks. The maximum-flow problem. Introduction to Algorithms, Lecture 22 December 5, 2001

Vehicle Arrival Models : Headway

SMT 2014 Calculus Test Solutions February 15, 2014 = 3 5 = 15.

t is a basis for the solution space to this system, then the matrix having these solutions as columns, t x 1 t, x 2 t,... x n t x 2 t...

EECE 301 Signals & Systems Prof. Mark Fowler

6.003 Homework #8 Solutions

Graphs III - Network Flow

Math 221: Mathematical Notation

Predator - Prey Model Trajectories and the nonlinear conservation law

Transcription:

ECPE 36 HOMEWORK 3: PROPERTIES OF THE FOURIER TRANSFORM SOLUTION. Exponenial Sawooh: The eaie way o do hi problem i o look a he Fourier ranform of a ingle exponenial funcion, () = exp( )u(). From he able in Appendix II of he Roden book, we know ha he following are Fourier ranform pair: exp( )u() ψ! +jßf I hen become much eaier o calculae he Fourier erie coefficien for he awooh waveform: y() = X n= exp( [ n]) u( n) The funcion () i replicaed and hifed over ineger period of econd o form he periodic funcion y(). Since he period of y() i econd, he fundamenal frequency f i equal o = Hz. Thu, he nh complex Fourier coefficien igiven by he following formula developed in Lecure 5: c n = S(nf) = S(n=) = +jßn Thi i he final anwer.. Malab Analyi: The iniial wo graph of he exercie were plo of he periodic exponenial awooh and i Fourier ranform:

SOLUTION. Exponenial Sawooh. ignal.8.6.. 5 5 (econd) 7 Fourier Tranform of Exponenial Sawooh 6 5 pecrum 3 8 6 6 8 f (Hz) Since he waveform i periodic, he pecrum coni of pecral line. Ploing a ingle exponenial waveform in he ime domain produce he following graph:

ECPE 36 HOMEWORK 3: PROPERTIES OF THE FOURIER TRANSFORM 3 Exponenial ignal.9.8.7.6.5..3.. 5 5 (econd) The following Malab command were ued o conruc hi graph: yy =.5*(+ign(-.)).*exp(-); plo(,yy); e(gca,'fonsize',); xlabel(' (econd)'); ylabel('ignal'); ile('exponenial'); The Fourier ranform of he exponenial wa graphed wih he following command: plo(f,ab(ffhif(ff(yy)))); e(gca,'fonsize',); xlabel('f (Hz)'); ylabel('pecrum'); ile('fourier Tranform of Exponenial'); Thi produce he following graph in he frequency domain:

SOLUTION Fourier Tranform of Exponenial pecrum 8 6 8 6 6 8 f (Hz) Noe ha he hape of he periodic exponenial Fourier ranform and he hape of he ingle exponenial Fourier ranform are idenical. The key difference i ha he periodic exponenial Fourier ranform coni of pecral line inead of a coninuou pecrum. 3. Pareval' Theorem: a. Fir, we recognize ha if we have a ignal (x) = +ß x, hen we can apply Pareval' heorem a follow: + R ( + ß x ) dx = = + R j(x)j dx + R js(f)j df where (x) and S(f) are Fourier ranform pair. (Don' be confued by he ue of x inead of f i' ju a variable name and doe no affec he mahemaic. If i ge oo confuing, ju ubiue everywhere you ee x) The acual Fourier ranform pair ha we ue o evaluae hi inegral may be found in App. II: +ß x ψ! exp( jfj)

ECPE 36 HOMEWORK 3: PROPERTIES OF THE FOURIER TRANSFORM 5 Subiuing he frequency domain funcion exp( jf j)ino he above equaion produce + R ( + ß x ) dx = = = = + R j exp( jfj)j df + R + R + R exp( jfj) df exp( f) df + exp( f) df = exp( f) fi fifi + R exp(+f) df = b. Recognize ha if we have a ignal ( ) = a follow: + R + R in ß d = = in ß, hen we can apply Pareval' heorem + R j( )j d + R js(f)j df where ( ) and S(f) are he Fourier ranform pair (from App. II): jfj in ß ψ! ßu Subiuing he frequency domain funcion ßu jfj a box funcion from f = = o f = += ino he above equaion produce in ß d = + R fi fi jfj fi ßu fi df uni ep quared i ill a uni ep + R = ß jfj u df inegral i zero for f< = and f>= = ß += R df over =» f» += uni ep i = = ß Noe ha he clever ue of Pareval' Theorem urn nearly-impoible inegral ino much eaier inegral.. Omied hi week ince we did no cover he maerial in ime.

6 SOLUTION 5. Convoluion: The wo ignal, () and (), are convolved ogeher. The ignal are lied below: () = ( jj)u( jj) = () = u( jj) = 8 >< >: +»»»» elewhere (»» elewhere Thee wo ignal are very imple o he graphical convoluion example in he book on page 7. The mo difficul par of a convoluion problem i eing up he inegral ued o calculae he convoluion reul. A face value, i doe no look like a difficul problem ju plug he wo ignal ino he following convoluion inegral and you're done: Anwer = Z+ ( )( ) d The difficul par abou evaluaing hi inegral i ha here are wo variable in he inegrand, and. The variable i he variable of inegraion, while may be reaed a a conan. However, for differen value of, he folding-and-muliplicaion of and look very differen and require differen ype of piece-wie evaluaion of he convoluion inegral. Noe: we could have choen he convoluion inegrand o be ( )( ) and we would ge he ame anwer. Baically, a increae, ignal lide ino he non-zero range of ignal. Every ime a diconinuiy in ignal croe a diconinuiy in ignal, a new e of piece-wie inegraion mu be wrien o olve he convoluion inegral. The oluion for hi problem i wrien below. Follow he graph a he end o underand why he range and piece-wie inegraion keep changing. I. In hi region ( < ), he non-zero region of he funcion ( ) and ( ) do no overlap a all. Therefore, when hey are muliplied ogeher, he inegrand of he convoluion (and, of coure, he reul of he inegraion ielf) i zero. II. In hi region (» < ), he fir half of he riangular region of ( ) creep ino he non-zero inerval of ( ). The reuling convoluion inegrand i non-zero over he inerval [ ;+ ]. The inegral for hi region i given by Z+ ( )( ) d = Z + [+( )][] d = ( + ) fi fi fi + = +8 +8 III. In hi region (» < ), he fir half of he riangular region of ( ) i compleely underneah he non-zero inerval of ( ); he la half of he riangular funcion i alo enering hi region. The reuling convoluion inegrand i non-zero over he inerval [ ; + ]. For he ake of eaier calculaion, he inegraion will

ECPE 36 HOMEWORK 3: PROPERTIES OF THE FOURIER TRANSFORM 7 be performed in wo piece-wie egmen from [ ;] and from [; + ]. Thu, he inegral for hi region i given by Z+ ( )( ) d = Z + [+( )][] d + Z [ ( )][] d fi = (+) fi fi + fi +( ) + fi fi = IV. In hi region (» <), he la half of he riangular region of ( ) i compleely underneah he non-zero inerval of ( ); i i he fir half ha i only parially conained, runcaed a =. The reuling convoluion inegrand i non-zero over he inerval [ ; ]. The reul, like region III, mu be expreed a wo piece-wie inegraion from [ ;] and from [; ]. The reuling inegral for hi region i Z+ Z Z ( )( ) d = [+( )][] d + [ ( )][] d fi = (+) fi fi fi +( ) + fi fi = V. Thi region (» < ) ee only he la half of he riangular region of ( ) underneah he non-zero porion of ( ). The reuling convoluion inegrand i nonzero over he inerval [ ; ]. A a reul, he inegraion i Z+ Z ( )( ) d = [ ( )][] d = ( ) + fi fi fi = 8 +8 VI. The region for > i imilar o region I in ha no non-zero inerval of he funcion ( ) and ( ) line up. Thu, he convoluion inegral i equal o zero for all >. Phew! Tha wa a lo of work. The mo difficul par of convoluion problem are defining he range of inegraion for he differen inerval of ime,. Remember, when liding one funcion pa anoher along he -axi, you mu re-wrie he inegral every ime a diconinuiy in one funcion croe a diconinuiy in anoher funcion. To ummarize he oluion we ju found, we may wrie he convolved funcion a () Ω () = 8 >< >: < +8 +8» <» < 8 +8» < >

8 SOLUTION I. <- - ( ) (- ) Convoluion Inegrand ( ) (- ) - + - - - II. -<<- - + (- ) + - - - III. -<< (- ) - + + - - - IV.<< (- ) - + - - - - V. << (- ) - + - - - - VI. > (- ) - + - - -