Continuous Time Signal Analysis: the Fourier Transform. Lathi Chapter 4

Similar documents
Continuous-Time Fourier Transform

Notes 07 largely plagiarized by %khc

The Continuous-time Fourier

Review of Fourier Transform

13. Power Spectrum. For a deterministic signal x(t), the spectrum is well defined: If represents its Fourier transform, i.e., if.

The Discrete-time Fourier Transform

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

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

Fourier analysis of discrete-time signals. (Lathi Chapt. 10 and these slides)

Fourier Transform for Continuous Functions

Review: Continuous Fourier Transform

EA2.3 - Electronics 2 1

LECTURE 12 Sections Introduction to the Fourier series of periodic signals

The Continuous Time Fourier Transform

Signals and Systems Spring 2004 Lecture #9

Lecture 27 Frequency Response 2

06EC44-Signals and System Chapter Fourier Representation for four Signal Classes

Aspects of Continuous- and Discrete-Time Signals and Systems

4 The Continuous Time Fourier Transform

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

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

3. Frequency-Domain Analysis of Continuous- Time Signals and Systems

Ch.11 The Discrete-Time Fourier Transform (DTFT)

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

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.

ELEG 3124 SYSTEMS AND SIGNALS Ch. 5 Fourier Transform

2.1 Basic Concepts Basic operations on signals Classication of signals

Question Paper Code : AEC11T02

信號與系統 Signals and Systems

3.2 Complex Sinusoids and Frequency Response of LTI Systems

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

CH.4 Continuous-Time Fourier Series

Review of Analog Signal Analysis

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

The Discrete Fourier Transform. Signal Processing PSYCH 711/712 Lecture 3

Information and Communications Security: Encryption and Information Hiding

Laplace Transforms and use in Automatic Control

Chapter 4 The Fourier Series and Fourier Transform

GATE EE Topic wise Questions SIGNALS & SYSTEMS

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

Topic 3: Fourier Series (FS)

Representation of Signals and Systems. Lecturer: David Shiung

Basic Procedures for Common Problems

Time and Spatial Series and Transforms

EE Introduction to Digital Communications Homework 8 Solutions

Fourier transform. XE31EO2 - Pavel Máša. EO2 Lecture 2. XE31EO2 - Pavel Máša - Fourier Transform

Fourier Series and Transforms. Revision Lecture

System Identification & Parameter Estimation

Square Root Raised Cosine Filter

EE 224 Signals and Systems I Review 1/10

Discrete-Time Fourier Transform

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

Tutorial Sheet #2 discrete vs. continuous functions, periodicity, sampling

Laplace Transforms Chapter 3

ESS Finite Impulse Response Filters and the Z-transform

ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin

The Discrete-Time Fourier

Chapter 4 The Fourier Series and Fourier Transform

The Hilbert Transform

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

Solutions to Problems in Chapter 4

2.161 Signal Processing: Continuous and Discrete Fall 2008

3 Fourier Series Representation of Periodic Signals

MITOCW MITRES_6-007S11lec09_300k.mp4

Fourier Series and Fourier Transforms

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

The Laplace Transform

University Question Paper Solution

Chapter 3 Fourier Representations of Signals and Linear Time-Invariant Systems

Digital Baseband Systems. Reference: Digital Communications John G. Proakis

Continuous and Discrete Time Signals and Systems

Systems & Signals 315

Ch 4: The Continuous-Time Fourier Transform

A3. Frequency Representation of Continuous Time and Discrete Time Signals

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

Theory and Problems of Signals and Systems

Homework 5 EE235, Summer 2013 Solution

Problem Sheet 1 Examples of Random Processes

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

SYLLABUS. osmania university CHAPTER - 1 : TRANSIENT RESPONSE CHAPTER - 2 : LAPLACE TRANSFORM OF SIGNALS

Discrete-time Signals and Systems in

EE 261 The Fourier Transform and its Applications Fall 2006 Midterm Exam Solutions

Signals can be classified according to attributes. A few such classifications are outlined

Module 3 : Sampling and Reconstruction Lecture 22 : Sampling and Reconstruction of Band-Limited Signals

Signals and Systems: Part 2

EEO 401 Digital Signal Processing Prof. Mark Fowler

Networks and Systems Prof V.G K. Murti Department of Electrical Engineering Indian Institute of Technology, Madras Lecture - 10 Fourier Series (10)

Elec4621 Advanced Digital Signal Processing Chapter 11: Time-Frequency Analysis

Line Spectra and their Applications

Lecture 28 Continuous-Time Fourier Transform 2

Lecture 7 ELE 301: Signals and Systems

BME 50500: Image and Signal Processing in Biomedicine. Lecture 2: Discrete Fourier Transform CCNY

Chapter 6: Applications of Fourier Representation Houshou Chen

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

Lecture 1 January 5, 2016

Stability. X(s) Y(s) = (s + 2) 2 (s 2) System has 2 poles: points where Y(s) -> at s = +2 and s = -2. Y(s) 8X(s) G 1 G 2

EE303: Communication Systems

Wave Phenomena Physics 15c. Lecture 11 Dispersion

LOPE3202: Communication Systems 10/18/2017 2

Lab10: FM Spectra and VCO

Transcription:

Continuous Time Signal Analysis: the Fourier Transform Lathi Chapter 4

Topics Aperiodic signal representation by the Fourier integral (CTFT) Continuous-time Fourier transform Transforms of some useful functions Properties of the Fourier Transform Filtering Modulation 2

Aperiodic signal representation by the Fourier Integral What happens if the signal is NOT periodic? How can we represent it over the whole temporal axis?

Towards the CTFT Starting from Fourier series, we will derive the CTFT by a trick First, we will build a periodic signal starting from time-limited f(t) Then, we will represent a NON periodic signal as a limit case of a periodic signal when the period goes to infinity Finally, we will derive the CTFT and analyze the link with FS

Towards CTFT: steps 1 and 2 Neuroimaging Lab. - Dept. of Computer Science

Towards CTFT Since f T0 (t) is periodic, we can represent it by the exponential FS But: Z T0 /2 T 0 /2 f T0 (t)dt = Z +1 1 f(t)dt

Towards CTFT Thus D n = 1 T 0 Z +1 1 f(t)e jn! 0t dt Let s then define the continuous function F( ) F (!) = Z +1 1 f(t)e j!t dt D n = 1 T 0 F (n! 0 ) The Fourier series coefficients D n are (1/T 0 ) times the coefficients of F( ) uniformly distributed over the frequency axis with spacing 0

CFTF vs FS CTFT is the envelop of the coefficients of the FS or, alternatively, the FS can be seen as a sampled version of the CTFT

Approaching the limit When T0 goes to infinity we recover the non-period signal f(t) the DS samples get progressively closer to each other The relative shape of the spectrum with respect to F( ) stays unchanged However Each single spectral component has an amplitude that decreases to zero T 0!1! 0! 0 D n! 0 We have nothing of everything, yet we have something

Solving the paradox Even though each individual component has vanishing amplitude, we can group components across intervals of infinitesimal width and make them working in team f T0 (t) = +1X n= 1 F (n! 0 ) T 0 e jn! 0t! 0! 0di erent notation!!! = 2! T 0 = 2 T 0! f T0 (t) = +1X n= 1 F (n!)! 2 jn!t e Weight of the component of frequency

Getting to the CTFT When T 0 goes to infinity, the sum can be replaced by an integral leading to the CTFT f(t) = lim f T 0 (t) = T 0!1 lim!!0 1 2 +1X n= 1 F (n!)e jn!t!

Neuroimaging Lab. - Dept. of Computer Science CTFT qui Fourier integral Z +1 1 f (t) = F (!)ej!t d! 2 1 Z +1 F (!) = f (t)e j!t dt Analysis formula Synthesis formula 1 Fourier domain Signal domain

Amplitude and Phase spectra For real signals

Existence of the FT Dirichlet conditions (sufficient) Not necessary There exist functions not satisfying condition (4.13) still having a Fourier transform, like the sinc(t) The CTFT always exists for real (measured) signals

Linearity of the CTFT Neuroimaging Lab. - Dept. of Computer Science

LTIC systems response using the CTFT Back to the response to the everlasting exponential

LTIC systems response using the CTFT Neuroimaging Lab. - Dept. of Computer Science

Time vs Frequency domain Neuroimaging Lab. - Dept. of Computer Science

CTFT of some useful functions Rectangular function Bandwidth sinc(! 2 )

CTFT of some useful functions Neuroimaging Lab. - Dept. of Computer Science

Example: rect(t/τ) sin(! 2 )=0 sin(! 2 )=1 sin(! 2 )= 1! 2k = k!! = 2! 2 = k 2!! = k! 2 = k 3 2!! = k3

CTFT of some useful functions Impulse

CTFT of some useful functions Constant function Derived as the inverse CTFT of the delta in Fourier domain

CTFT of some useful functions Neuroimaging Lab. - Dept. of Computer Science

CTFT of some useful functions Everlasting sinusoid 2 (!! 0 ) 2 (! +! 0 ) Eulero s formula cos(! 0 t)! 1 2 2 ( (! +! 0)+ (!! 0 )) = { (! +! 0 )+ (!! 0 )}

Symmetry of the CTFT Time-frequency duality

Symmetry properties Time-shift -> phase change in frequency domain Frequency shift (modulation) -> phase change in time domain Delaying a signal by t 0 seconds does not change the amplitude spectrum but changes the phase spectrum by!t 0

Physical explanation of the time shifting property To keep the signal spectrum unchanged after time-shifting, higher frequencies must go through larger phase shift. More precisely, the phase shift must be linear

Symmetry properties Neuroimaging Lab. - Dept. of Computer Science

Symmetry properties Neuroimaging Lab. - Dept. of Computer Science

Symmetry properties Neuroimaging Lab. - Dept. of Computer Science

Scaling The time shrinking of a signal results in a spectral expansion and, viceversa, a spectral shirking results in a temporal expansion Reciprocity of signal duration and bandwidth

Convolution Function to be transformed Hence

LTIC response Impulse response f(t) = (t) y(t) =h(t) f(t) Time domain h(t) y(t) =f(t)? h(t) Transfer function F (!) =e j!t F (!) H( ) Y (!) =H(!) Frequency domain Y (!) =F (!)H(!)

Fourier transform operations Neuroimaging Lab. - Dept. of Computer Science

Neuroimaging Lab. - Dept. of Computer Science Signal transmission through LTIC systems Signals are everywhere!

Distortionless transmission: linear phase Warning: transmission systems do not perform any filtering operations For the transmission to be distortionless, the output signal must be equal to the input signal except for a time-shift

Linear phase systems The amplitude of the spectrum is constant The phase is proportional to frequency The time-delay is the slope of the phase spectrum

Ideal filters Ideal filters are distortionless transmission systems for certain frequencies and suppress the remaining ones Ideal low-pass filter

Ideal filters Ideal high-pass and band-pass filters

Ideal filters Ideal filters are physically not realizable t d =0 Non causal, infinite length tails To make it realizable we have to cut the tails, which implies A time-delay A smoothing of the response in the frequency domain

Ideal low pass filter t d =0 t d =T 1 Smaller delay Larger filter distortion t d =T 2 T 1 Larger delay Smaller filter distortion T 2 The filter impulse response is set to zero out of the window

Implications of windowing in time-domain Time domain = x t t t Frequency domain * ω ω

Implications of windowing in time domain Neuroimaging Lab. - Dept. of Computer Science Time domain f(t) Fourier domain w(t) f(t)w(t)

Implications of windowing in time domain Time domain f(t) Fourier domain w(t) f(t)w(t)

Effect of changing window length: example

Window functions Windows of different shapes can be used Windowing in time domain Spectral spreading Spectral leakage Spreading (or smearing): the spectrum gets larger Leakage: the spectrum leaks towards frequency ranges where it is supposed to be zero Windowing in frequency domain Temporal spreading

The effect of windowing spreading leakage

Windowing: how can we remedy? Spectral spreading depends on window width increase window width Spectral rate of decay depends on the regularity of the signal: the higher the number of contiunuos derivatives, the fastest the decay choose a smooth window There is a trade-off between the two The rectangular window has the smallest spread but the largest leakage. This can be mitigated by choosing large windows Take home message: to minimize the effect of windowing choose smooth wide windows

Signal energy By definition f (t) Interchanging the order of integration Parseval s theorem

Signal energy and energy spectral density Energy of the spectral component in the band! F (!) 2 Spectral energy density (energy per unit bandwidth in Hz)

Autocorrelation function and energy spectral density Autocorrelation function f ( ) = Z +1 1 g( ) =f( )! f (t) = f (t) = Z +1 1 Z +1 1 f( )f( t)d f( )g(t )d = f(t) g(t) =f(t) f( t) f( )f( t)d! f ( t) =f( t) f(t) =f(t) f( t) = f (t) Relation to convolution The autocorrelation function is even symmetric

Autocorrelation function and power spectral density For real signals Thus Hence F {f( t)} = Z +1 1 f( t)e j!t dt = F (!) =F? (!) F {f(t)? f( t)} = F (!)F? (!) = F (!) 2 f (t)! F (!) 2 The power spectral density is the F-transform of the autocorrelation function