Fourier Series and Fourier Transforms

Similar documents
CHAPTER 4 FOURIER SERIES S A B A R I N A I S M A I L

Chapter 4 The Fourier Series and Fourier Transform

Chapter 4 The Fourier Series and Fourier Transform

CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation

The Fourier Transform (and more )

IB Paper 6: Signal and Data Analysis

Amplitude and Phase A(0) 2. We start with the Fourier series representation of X(t) in real notation: n=1

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

CMPT 889: Lecture 2 Sinusoids, Complex Exponentials, Spectrum Representation

Lecture 27 Frequency Response 2

Assignment 3 Solutions

Review of Linear Time-Invariant Network Analysis

Properties of Fourier Series - GATE Study Material in PDF

Sinusoids. Amplitude and Magnitude. Phase and Period. CMPT 889: Lecture 2 Sinusoids, Complex Exponentials, Spectrum Representation

Review of Discrete-Time System

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

ω 0 = 2π/T 0 is called the fundamental angular frequency and ω 2 = 2ω 0 is called the

16.362: Signals and Systems: 1.0

Signals, Systems, and Society. By: Carlos E. Davila

PS403 - Digital Signal processing

EA2.3 - Electronics 2 1

3 What You Should Know About Complex Numbers

LECTURE 12 Sections Introduction to the Fourier series of periodic signals

SIGNALS AND SYSTEMS: PAPER 3C1 HANDOUT 6. Dr Anil Kokaram Electronic and Electrical Engineering Dept.

SIGNALS AND SYSTEMS: PAPER 3C1 HANDOUT 6a. Dr David Corrigan 1. Electronic and Electrical Engineering Dept.

Signals and Systems Lecture (S2) Orthogonal Functions and Fourier Series March 17, 2008

Lecture 7 ELE 301: Signals and Systems

Music 270a: Complex Exponentials and Spectrum Representation

Phasor mathematics. Resources and methods for learning about these subjects (list a few here, in preparation for your research):

Fourier Analysis and Spectral Representation of Signals

2 Fourier Transforms and Sampling

Fourier Transform. Find the Fourier series for a periodic waveform Determine the output of a filter when the input is a periodic function

Mathematical Review for Signal and Systems

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

EC Signals and Systems

Solutions to Problems in Chapter 4

5. THE CLASSES OF FOURIER TRANSFORMS

D.S.G. POLLOCK: BRIEF NOTES

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

Representing a Signal

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

Notes on the Periodically Forced Harmonic Oscillator

Series FOURIER SERIES. Graham S McDonald. A self-contained Tutorial Module for learning the technique of Fourier series analysis

Signals and Systems Spring 2004 Lecture #9

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

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

LOPE3202: Communication Systems 10/18/2017 2

Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is

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

The Discrete Fourier Transform

Course Notes for Signals and Systems. Krishna R Narayanan

2.3 Oscillation. The harmonic oscillator equation is the differential equation. d 2 y dt 2 r y (r > 0). Its solutions have the form

Overview - Previous lecture 1/2

The Discrete-Time Fourier

Fourier Transform for Continuous Functions

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

Chapter 2: Complex numbers

ENGIN 211, Engineering Math. Fourier Series and Transform

(Refer Slide Time: 01:28 03:51 min)

Complex symmetry Signals and Systems Fall 2015

Fourier Analysis and Spectral Representation of Signals

MITOCW MITRES_6-007S11lec09_300k.mp4

Mathematical methods and its applications Dr. S. K. Gupta Department of Mathematics Indian Institute of Technology, Roorkee

Lecture 34. Fourier Transforms

Discrete Systems & Z-Transforms. Week Date Lecture Title. 9-Mar Signals as Vectors & Systems as Maps 10-Mar [Signals] 3

Figure 3.1 Effect on frequency spectrum of increasing period T 0. Consider the amplitude spectrum of a periodic waveform as shown in Figure 3.2.

CS711008Z Algorithm Design and Analysis

Circuits and Systems I

Fourier transform representation of CT aperiodic signals Section 4.1

(Refer Slide Time: 01:30)

LECTURE 13 Introduction to Filtering

2.161 Signal Processing: Continuous and Discrete

Signals and Systems Lecture Notes

Unstable Oscillations!

George Mason University Signals and Systems I Spring 2016

Lecture 28 Continuous-Time Fourier Transform 2

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

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

Today s lecture. The Fourier transform. Sampling, aliasing, interpolation The Fast Fourier Transform (FFT) algorithm

Sinusoidal steady-state analysis

Signals and Systems. Lecture 14 DR TANIA STATHAKI READER (ASSOCIATE PROFESSOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE LONDON

7. Find the Fourier transform of f (t)=2 cos(2π t)[u (t) u(t 1)]. 8. (a) Show that a periodic signal with exponential Fourier series f (t)= δ (ω nω 0

Periodic functions: simple harmonic oscillator

Review of Linear System Theory

Solutions 2: Simple Harmonic Oscillator and General Oscillations

Alternating Current (AC) Circuits

Chapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum

SOLVING DIFFERENTIAL EQUATIONS. Amir Asif. Department of Computer Science and Engineering York University, Toronto, ON M3J1P3

Chapter 10: Sinusoidal Steady-State Analysis

Spectral Analysis. Jesús Fernández-Villaverde University of Pennsylvania

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

Lecture 15: Time and Frequency Joint Perspective

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

Lectures on Spectra of Discrete-Time Signals

1 (2n)! (-1)n (θ) 2n

Chapter 6 THE SAMPLING PROCESS 6.1 Introduction 6.2 Fourier Transform Revisited

Lecture 04: Discrete Frequency Domain Analysis (z-transform)

A system that is both linear and time-invariant is called linear time-invariant (LTI).

A1 Time-Frequency Analysis

EE3210 Lab 3: Periodic Signal Representation by Fourier Series

Transcription:

Fourier Series and Fourier Transforms EECS2 (6.082), MIT Fall 2006 Lectures 2 and 3

Fourier Series From your differential equations course, 18.03, you know Fourier s expression representing a T -periodic time function x(t) as an infinite sum of sines and cosines at the fundamental frequency and its harmonics, plus a constant term equal to the average value of the time function over a period: x(t) = a 0 + where n=1 a n cos(nω 0 t)+b n sin(nω 0 t) (1) ω 0 = 2π T a 0 = 1 T and for integer n > 0 a n = 2 T b n = 2 T T/2 x(t) dt (2) T/2 x(t) cos(nω 0t) dt (3) T/2 x(t) sin(nω 0t) dt (4) 1

Some comments on symmetries 1. The integrals could have been taken over any interval of length T, but the symmetric interval [ T 2, T 2 ] is most convenient for us. 2. Note from the defining expressions that if x(t) is an even function of t, i.e., if x( t) = x(t), then b n = 0 for all n > 0, so only cosine terms appear in the Fourier series. Similarly, if x(t) is an odd function of t, i.e., if x( t) = x(t), then a n = 0 for all n 0, so only sine terms appear in the Fourier series. 2

Recall some useful trigonometric identities cos( p) = cos p sin( p) = sin p cos(p + q) = cos p cos q sin p sin q sin(p + q) = sin p cos q + cos p sin q The latter two are most easily derived from Euler s identity: where j = 1. e jθ = cos θ + j sin θ From the cosine-sum and sine-sum identities above, various other identities can be derived, e.g., 2 cos p cos q = cos(p + q) + cos(p q) 2 sin p sin q = cos(p q) cos(p + q) 2 sin p cos q = sin(p + q) + sin(p q) 3

Example 1 (sanity check) Suppose x(t) = K cos ω 0 t, with ω 0 > 0. Then a 1 = 2 T T/2 K cos2 (ω 0 t) dt = K while all other a n and all b n are 0. So the Fourier series for x(t) is simply K cos ω 0 t, as it should be! Similarly, the Fourier series for x(t) = K sin(ω 0 t) is just this expression itself. 4

Example 2 (magnitude and phase) Suppose x(t) = a cos(ω 0 t) + b sin(ω 0 t), with ω 0 > 0. This evidently is periodic with period T = 2π/ω 0, and its Fourier series will be the same expression again. But there s an alternative representation that yields a bit more insight: Rewrite x(t) as ( x(t) = a 2 + b 2 a cos(ω 0t) + a 2 +b 2 and let so θ = arctan a = cos θ, a 2 + b 2 b a 2 +b 2 sin(ω 0t) ( ) b a ) b = sin θ a 2 + b 2... 5

Example 2 (continued) (Construct for yourself a right-angled triangle that displays the preceding relations among a, b, and θ.) Our previous expression for x(t) then becomes ( x(t) = a 2 + b 2 cos θ cos(ω 0 t) + sin θ sin(ω 0 t) = c cos(ω 0 t θ) ) where c = a 2 + b 2 So adding a cosine and a sine of the same frequency, but possibly different amplitudes, yields (perhaps surprisingly) a pure sinusoid again, with magnitude and phase as specified above. We refer to the cosine and sine as having added in quadrature, because the two are displaced from each other by 90 degrees (π/2 radians). 6

Magnitude/phase form of Fourier series The transformation carried out on the x(t) in the previous example can be equally well applied to a typical term of the Fourier series in (1), to obtain = a n cos(nω 0 t) + b n sin(nω 0 t) ( a 2 n + b2 a n n b n a 2 n +b 2 n a 2 n +b 2 cos(nω 0 t) + n ) sin(nω 0 t) Letting and ( ) bn θ n = arctan a n c n = a 2 n + b2 n for n 0 (with c 0 = a 0 and θ 0 = 0), we get the following alternate form of (1) for a T -periodic function x(t): x(t) = n=0 c n cos(nω 0 t θ n ) (5) 7

A two-sided Fourier series It is convenient for many purposes to rewrite the Fourier series in yet another form, allowing both positive and negative multiples of the fundamental frequency. To obtain such a twosided representation, note that a n cos nω 0 t = a n 2 cos nω 0t + a n 2 cos n( ω 0)t b n sin nω 0 t = b n 2 sin nω 0t b n 2 sin n( ω 0)t Now for all integer n (negative, zero, and positive) define A n = 1 T B n = 1 T T/2 x(t) cos nω 0t dt (6) T/2 x(t) sin nω 0t dt (7) (The minus sign preceding the integral in the definition of B n serves to make our notation consistent with the notation that is widely used in engineering.)... 8

Two-sided Fourier series (continued) From the preceding definitions, we conclude that A 0 = a 0, and for n > 0 A n = a n 2 = A n B n = b n 2 = B n With these definitions, the Fourier series for a T -periodic function x(t) can be written in the form x(t) = n= A n cos nω 0 t B n sin nω 0 t (8) Note that the summation now runs symmetrically over all integer n (negative, zero, and positive), corresponding to terms at all integer multiples of the fundamental frequency. 9

Magnitude/phase form of two-sided series By defining and θ n = arctan X n = ( ) Bn A n A 2 n + B 2 n we can write A n = X n cos θ n, B n = X n sin θ n Using the now familiar procedure, we can use the preceding relations to rewrite the two-sided series in magnitude/phase form as x(t) = n= X n cos(nω 0 t + θ n ) 10

A step further Let s go a small step beyond where you left off in 18.03: If x(t) = a n cos(nω 0 t), then the average value of x 2 (t) over a period the mean square value of x(t) is 1 T T/2 x2 (t) dt = 1 T = a2 n 2 T/2 a2 n cos2 (nω 0 t) dt Extending this kind of calculation in a straightforward way, and invoking the standard trigonometric identities listed earlier, produces the various equivalent expressions shown on the next slide for the mean square value of a general periodic x(t). 11...

Parseval s theorem The mean square value of a T -periodic signal x(t) is given in terms of its Fourier series coefficients by the following expressions: 1 T = a 2 0 + 1 2 = c 2 0 + 1 2 = = T/2 x2 (t) dt n= Xn 2 n= n=1 c 2 n n=1 (a 2 n + b2 n ) (A 2 n + B2 n ) 12

Some consequences of Parseval s 1. The mean square value of x(t) is finite (for all cases of interest to us), so the infinite sums on the previous slide are all finite, which must mean that the Fourier coefficients all decay to 0 as n in particular, X n 0. 2. It is often useful or necessary to approximate x(t) by a finite number of terms from its Fourier series, for instance by x N (t) = N n= N X n cos(nω 0 t + θ n ) Note that the highest frequency in this approximating signal is Nω 0. The mean square error in this case is 1 T/2 ( ) 2 x(t) x N (t) dt = Xn 2 T T/2 n >N 13

Complex notation for compact expressions Recall x(t) = n= A n cos nω 0 t B n sin nω 0 t where A n and B n are specified by the integrals in (6), (7). Defining so X n = A n + jb n = X n e jθ n X n = 1 T T/2 x(t)e jnω 0t dt (9) allows us to rewrite the expression for x(t) as x(t) = n= X n e jnω 0t (10) (The reason the imaginary part of the sum drops out is that A n = A n and B n = B n.) Equations (9) and (10) comprise the complex form of the Fourier series representation for a T -periodic signal. 14

Non-periodic signals: to Fourier transforms From Fourier series We are often interested in non-periodic signals, for instance an x(t) of finite duration, or one that decays to 0 as t. The signals of interest to us typically satisfy x(t) dt < or x(t) 2 dt < We can consider such signals to have an infinite period, and can obtain a Fourier representation by taking the limit T, ω 0 dω, nω 0 = n 2π T ω, T X n X(ω) with summations suitably replaced by integrals. The resulting X(ω) is termed the Fourier transform of x(t). 15...

The Fourier transform The resulting expressions replace (10) and (9) respectively by and x(t) = 1 2π X(ω) = X(ω)e jωt dω (11) x(t)e jωt dt (12) The first of this pair of equations, (11), is the Fourier synthesis equation, showing how a general time function may be expressed as a weighted combination of exponentials of all frequencies ω; the Fourier transform X(ω) determines the weighting. The second of this pair of equations, (12), is the Fourier analysis equation, showing how to compute the Fourier transform from the signal. 16

Some additional observations Remember that X(ω) is in general a complex number at each ω, even though x(t) is real reflecting the earlier definition X n = A n + jb n. We shall denote the real and imaginary parts of X(ω) by A(ω) and B(ω) respectively, so X(ω) = A(ω) + jb(ω) We shall denote the magnitude and angle of X(ω) by X(ω) and θ X (ω) respectively, so X(ω) = X(ω) X(ω) = θ X (ω) Thus X(ω) = X(ω)e jθ X(ω) 17