X(t)e 2πi nt t dt + 1 T

Similar documents
Fourier Analysis Linear transformations and lters. 3. Fourier Analysis. Alex Sheremet. April 11, 2007

LINEAR SYSTEMS. J. Elder PSYC 6256 Principles of Neural Coding

Fourier Analysis and Power Spectral Density

How many initial conditions are required to fully determine the general solution to a 2nd order linear differential equation?

Chapter 4 The Fourier Series and Fourier Transform

Wave Phenomena Physics 15c

Notes 07 largely plagiarized by %khc

George Mason University Signals and Systems I Spring 2016

Fourier Analysis and Sampling

Experimental Fourier Transforms

Chapter 2: Complex numbers

Fundamentals of the Discrete Fourier Transform

Chapter 4 The Fourier Series and Fourier Transform

A6523 Linear, Shift-invariant Systems and Fourier Transforms

EA2.3 - Electronics 2 1

Notes on Fourier Series and Integrals Fourier Series

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

Introduction to Fourier Transforms. Lecture 7 ELE 301: Signals and Systems. Fourier Series. Rect Example

5. THE CLASSES OF FOURIER TRANSFORMS

Assignment #09 - Solution Manual

A523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011

MEDE2500 Tutorial Nov-7

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

a k cos kω 0 t + b k sin kω 0 t (1) k=1

Superposition of electromagnetic waves

23.6. The Complex Form. Introduction. Prerequisites. Learning Outcomes

Fourier series. Complex Fourier series. Positive and negative frequencies. Fourier series demonstration. Notes. Notes. Notes.

Ver 3808 E1.10 Fourier Series and Transforms (2014) E1.10 Fourier Series and Transforms. Problem Sheet 1 (Lecture 1)

Physics 351 Monday, January 22, 2018

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

Advanced Quantum Mechanics

Fourier Series and Integrals

The Discrete Fourier Transform (DFT) Properties of the DFT DFT-Specic Properties Power spectrum estimate. Alex Sheremet.

A6523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring

Fourier Series. Fourier Transform

Spectral Analysis of Random Processes

Chapter 6 THE SAMPLING PROCESS 6.1 Introduction 6.2 Fourier Transform Revisited

Fourier transform representation of CT aperiodic signals Section 4.1

2.1 Basic Concepts Basic operations on signals Classication of signals

Fourier Analysis Overview (0A)

Calculus II Practice Test Problems for Chapter 7 Page 1 of 6

ELEMENTS OF PROBABILITY THEORY

Signals and Systems Spring 2004 Lecture #9

Question Paper Code : AEC11T02

Energy during a burst of deceleration

Assignment 8. [η j, η k ] = J jk

Lecture 7 ELE 301: Signals and Systems

Solutions for homework 5

THE FOURIER TRANSFORM (Fourier series for a function whose period is very, very long) Reading: Main 11.3

MATH 350: Introduction to Computational Mathematics

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

Starting from Heat Equation

Homework 9 Solutions

FOURIER TRANSFORMS. 1. Fourier series 1.1. The trigonometric system. The sequence of functions

Periodic functions: simple harmonic oscillator

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

2.1 The electric field outside a charged sphere is the same as for a point source, E(r) =

PHY 396 K. Problem set #5. Due October 9, 2008.

GATE EE Topic wise Questions SIGNALS & SYSTEMS

Ch 4: The Continuous-Time Fourier Transform

Table 1: Properties of the Continuous-Time Fourier Series. Property Periodic Signal Fourier Series Coefficients

This is a Gaussian probability centered around m = 0 (the most probable and mean position is the origin) and the mean square displacement m 2 = n,or

MATH 3150: PDE FOR ENGINEERS FINAL EXAM (VERSION A)

CT Rectangular Function Pairs (5B)

multiply both sides of eq. by a and projection overlap

Acceleration, Velocity and Displacement Spectra Omega Arithmetic

Time-Dependent Statistical Mechanics A1. The Fourier transform

= 4. e t/a dt (2) = 4ae t/a. = 4a a = 1 4. (4) + a 2 e +j2πft 2

The Continuous-time Fourier

Table 1: Properties of the Continuous-Time Fourier Series. Property Periodic Signal Fourier Series Coefficients

Lecture 11: Spectral Analysis

A sufficient condition for the existence of the Fourier transform of f : R C is. f(t) dt <. f(t) = 0 otherwise. dt =

LECTURE 12 Sections Introduction to the Fourier series of periodic signals

Communication Signals (Haykin Sec. 2.4 and Ziemer Sec Sec. 2.4) KECE321 Communication Systems I

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

Sinc Functions. Continuous-Time Rectangular Pulse

e iωt dt and explained why δ(ω) = 0 for ω 0 but δ(0) =. A crucial property of the delta function, however, is that

EEL3135: Homework #3 Solutions

ELEG 3143 Probability & Stochastic Process Ch. 6 Stochastic Process

Review of Fourier Transform

13.42 READING 6: SPECTRUM OF A RANDOM PROCESS 1. STATIONARY AND ERGODIC RANDOM PROCESSES

Chapter 2: The Fourier Transform

Signal Processing COS 323

6.003 Homework #10 Solutions

EECS 20. Midterm No. 2 Practice Problems Solution, November 10, 2004.

CS-9645 Introduction to Computer Vision Techniques Winter 2018

Fourier Series. Spectral Analysis of Periodic Signals

Discrete-Time Signals: Time-Domain Representation

6 From Analog to Discrete Signals

Wave Phenomena Physics 15c. Lecture 10 Fourier Transform

6. Molecular structure and spectroscopy I

Fourier Series : Dr. Mohammed Saheb Khesbak Page 34

( ) f (k) = FT (R(x)) = R(k)

221B Lecture Notes on Resonances in Classical Mechanics

Fourier Series and Transform KEEE343 Communication Theory Lecture #7, March 24, Prof. Young-Chai Ko

In this Lecture. Frequency domain analysis

16.362: Signals and Systems: 1.0

Fourier transforms. Definition F(ω) = - should know these! f(t).e -jωt.dt. ω = 2πf. other definitions exist. f(t) = - F(ω).e jωt.

Sampling and Discrete Time. Discrete-Time Signal Description. Sinusoids. Sampling and Discrete Time. Sinusoids An Aperiodic Sinusoid.

1 Simple Harmonic Oscillator

Transcription:

HOMEWORK 31 I) Use the Fourier-Euler formulae to show that, if X(t) is T -periodic function which admits a Fourier series decomposition X(t) = n= c n exp (πi n ) T t, then (1) if X(t) is even c n are all real, c n = c n () if X(t) is odd c n are all imaginary If X(t) is aperiodic and has a Fourier Transform pair ˆX(f), show that (1) if X(t) is real and even ˆX(f) is real and even, ˆX( f) = ˆX(f) () if X(t) is real and odd ˆX(f) is imaginary and odd, ˆX( f) = ˆX(f) Proof If X(t) is a T -periodic real function which admits a Fourier series decomposition X(t) = n= c n exp (πi n ) T t then (1) if X( t) = X(t) = 1 T = T X(t)e πi nt t dt = 1 T X( t)e πi n T t dt + 1 T X(t) cos (π n ) T t dt, X(t)e πi nt t dt + 1 T and c n = c n = c n since c n R () Similarly, if X( t) = X(t) = 1 T = i T X(t)e πi nt t dt = 1 T X(t)e πi n T t dt = 1 T X(t)e πi nt t dt + 1 T X( t)e πi n T t dt + 1 T X(t) sin (π n ) T t dt X(t)e πi n T t dt = 1 T X(t)e πi n T t dt = X(t) ( e πi n T t + e πi n T t) dt = X(t)e πi n T t dt = Similarly, if X(t) is real aperiodic and has a Fourier Transform pair ˆX(f), (1) if ˆX( f) = ˆX(f) ˆX(f) = X(t)e πift dt = () if ˆX( f) = ˆX(f) ˆX(f) = X(t)e πift dt = X(t)e πift dt + X(t)e πift dt + 1 X(t)e πift dt = X(t) ( e πi n T t e πi n T t) dt = X(t)e πift dt = i X(t) cos (πft) dt X(t) sin (πft) dt

II) Assuming suitable periodicity conditions, for the ramp function X(t) defined by X(t) = t for 1 t 1, (1) calculate the Fourier series coefficients, () calculate the Fourier Transform Proof (1) To construct a Fourier series representation, assume that the ramp function X(t) is T -periodic X(t + nt ) = t, with T t T and n N with T = ; the coefficients of the Fourier series representations are te iωnt dt with = π n ; setting T u = t, du = dt dv = e iωnt dt, v = i e iωnt one obtains (integration by parts) = i [ e iωn T udv = 1 T [uv]t/ 1 T ( i ] T + e i 1 T vdu = ) [ e it ] T/ = since [e iωnt ] T/ = T e iωn e iωn T T = i sin c n = ( 1) n i πn () The Fourier transform is ˆX(ω) = X(t) e iωt dt = i 1 [ ] te it T/ T i 1 T/ e iωnt dt = T i T cos = i ( 1)n = For T =, t e iωt dt The integral is similar with the previous one, with the difference that the exponent is now iωt instead of i t Integrating by parts as before we get ˆX(ω) = it [ ] ( ) e iω T + e iω T i [ ] e iωt T/ ω ω = it ω cos ωt + i ω sin ωt The transform is imaginary and odd, as expected

III) Show that the Fourier Transform has the following properties: (1) Shift 1: F[X(t a)] = ˆX(f) exp ( πifa); () Shift : F[X(t) exp (πif t)] = ˆX(f f ); (3) Scale: F[X(at)] = 1 a ˆX( f a ); d n (4) Derivative 1: df ˆX(f) = ( πi) n F[t n X(t)]; [ n ] d n (5) Derivative : F dt X(t) = ( πif) n ˆX(f) n Proof (1) Shift 1: Change variable from t to ξ = t a, t = ξ + a, dt = dξ, F[X(t a)] = () Shift : X(t a) e πift dt = F[e πif t X(t)] = X(ξ) e πif(ξ+a) dξ = e πifa ˆX(f) X(t) e πi(f f )t dt = ˆX(f f ) (3) Scale: Let a > ; change variable from t to ξ = at, t = ξ/a, dt = dξ/a, X(ξ) e πi f a ξ dt = 1 ( a ˆX f a F[X(at)] = X(at) e πift dt = 1 a If a <, ξ = at, t = ξ/a, dt = dξ/ a F[X(at)] = X(at) e πift dt = 1 X(ξ) e πi f a ξ dξ = 1 ( ) a a ˆX f ; a (4) Derivative 1: Proving for n = 1 is sufficient, since dn df ˆX(f) = d [ (f)] ˆX(n 1) = ( ) n df d d n 1 ˆX(f) ; formally df df n 1 d df ˆX(f) = d df F X(t)e πift dt = πi ) ; tx(t)e πift dt = πi (tx(t)) = πi F[tX(t)] (5) Derivative : Again proving for n = 1 is sufficient: [ ] d [ ] d dt X(t) = dt X(t) e πift d [ dt = ] X(t) e πift dt X(t) d dt dt e πift dt = πif ˆX(f), since lim t ± X(t) = IV) 3

(1) Show that the Gaussian is invariant under the Fourier Transform, (1) F[exp( πt )] = exp( πf ) where ˆX(f) = F[X] = X(t)e πift dt () Use equation (1) to show that the Fourier Transform of X(t) = A exp ( π σ t ) [ A is ˆX(f) = exp f ] (3) Use the shifting properties of the Fourier Transform to show that if X(t) = A exp ( [ ] π σ t ) A exp (πif t) then ˆX(f) = exp (f f ) Proof (1) Gaussian is invariant to FT: F [ exp ( πt )] = e πt e πft dt = Change the variable (complete the square) e πt πift dt πt πift = π ( t + ift f ) πf = π (t + if) πf to z = π (t + if), t = F [ exp ( πt )] = z if, dt = dz yields π π where the last integral becomes Note that e π(t+if) πf dt = e πf e π(t+if) dt e π(t+if) dt = 1 π e (t+if) dt = e z dz = 1 e t dt; since f is a constant, changing from one integral to the other involves just a redefinition of the origin, from + i to + fi (a translation along the imaginary axis) () Fourier transform of X(t) = A exp ( π σ t ) = A exp [ π ( t )] [ ( ) ] = A exp π t Change the variable to ξ = at with a = Then X(t) = A Y (at) with Y (t) = e πt Using the scale theorem and the result at point 1 above 4

(3) Fourier Transform of X(t) = A exp ( π σ t ) exp (πif t) The result derives directly from the second shift theorem (proven at III); denote so that Y (t) = A exp ( π σ t ) X(t) = A exp ( π σ t ) exp (πif t) = Y (t) exp (πif t) The second shift theorem states that ˆX(f) = F[Y (t) exp (πif t)] = Ŷ (f f ) Combine with result at point above Ŷ (f) = A [ exp f ], to obtain Ŷ (f) = An application of this result: denote by [ ] A exp (f f ) = 1 ; a gaussian group of oscillations (waves) X(t) = A exp ( t ) exp (πif t) of fre- quency f and group duration has a gaussian amplitude spectrum of spectral width σ Note that the definition of implies σ = 1 π ; the narrower the spectrum, the longer the group duration 5