Continuous-Time Fourier Transform

Slides:



Advertisements
Similar presentations
For more ppt’s, visit Fourier Series For more ppt’s, visit
Advertisements

Ch 3 Analysis and Transmission of Signals
Math Review with Matlab:
HILBERT TRANSFORM Fourier, Laplace, and z-transforms change from the time-domain representation of a signal to the frequency-domain representation of the.
Lecture 7: Basis Functions & Fourier Series
Chapter 5 The Fourier Transform. Basic Idea We covered the Fourier Transform which to represent periodic signals We assumed periodic continuous signals.
Properties of continuous Fourier Transforms
Autumn Analog and Digital Communications Autumn
PROPERTIES OF FOURIER REPRESENTATIONS
Lecture 8: Fourier Series and Fourier Transform
Lecture 9: Fourier Transform Properties and Examples
About this Course Subject: Textbook Reference book Course website
Fourier Series. is the “fundamental frequency” Fourier Series is the “fundamental frequency”
Leo Lam © Signals and Systems EE235. Leo Lam © Fourier Transform Q: What did the Fourier transform of the arbitrary signal say to.
Chapter 4 The Fourier Series and Fourier Transform
Chapter 4 The Fourier Series and Fourier Transform.
Leo Lam © Signals and Systems EE235. Leo Lam © x squared equals 9 x squared plus 1 equals y Find value of y.
Chapter 2 Discrete-Time Signals and Systems
1 Let g(t) be periodic; period = T o. Fundamental frequency = f o = 1/ T o Hz or  o = 2  / T o rad/sec. Harmonics =n f o, n =2,3 4,... Trigonometric.
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Linearity Time Shift and Time Reversal Multiplication Integration.
Fourier Transforms Section Kamen and Heck.
Fourier Series Summary (From Salivahanan et al, 2002)
1 The Fourier Series for Discrete- Time Signals Suppose that we are given a periodic sequence with period N. The Fourier series representation for x[n]
(Lecture #08)1 Digital Signal Processing Lecture# 8 Chapter 5.
The Continuous - Time Fourier Transform (CTFT). Extending the CTFS The CTFS is a good analysis tool for systems with periodic excitation but the CTFS.
Fourier Series. Introduction Decompose a periodic input signal into primitive periodic components. A periodic sequence T2T3T t f(t)f(t)
1 Fourier Representations of Signals & Linear Time-Invariant Systems Chapter 3.
Chapter 5: Fourier Transform.
Signals & systems Ch.3 Fourier Transform of Signals and LTI System 5/30/2016.
EE104: Lecture 5 Outline Review of Last Lecture Introduction to Fourier Transforms Fourier Transform from Fourier Series Fourier Transform Pair and Signal.
Signal and System I The unit step response of an LTI system.
Husheng Li, UTK-EECS, Fall  Fourier transform is used to study the frequency spectrum of signals.  Basically, it says that a signal can be represented.
Linearity Recall our expressions for the Fourier Transform and its inverse: The property of linearity: Proof: (synthesis) (analysis)
Fourier Analysis of Signals and Systems
Discrete-Time Signals and Systems
Leo Lam © Signals and Systems EE235 Leo Lam.
1 “Figures and images used in these lecture notes by permission, copyright 1997 by Alan V. Oppenheim and Alan S. Willsky” Signals and Systems Spring 2003.
Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: 2.3 Fourier Transform: From Fourier Series to Fourier Transforms.
بسم الله الرحمن الرحيم University of Khartoum Department of Electrical and Electronic Engineering Third Year – 2015 Dr. Iman AbuelMaaly Abdelrahman
Eeng360 1 Chapter 2 Linear Systems Topics:  Review of Linear Systems Linear Time-Invariant Systems Impulse Response Transfer Functions Distortionless.
Chapter 2. Signals and Linear Systems
ENEE 322: Continuous-Time Fourier Transform (Chapter 4)
Leo Lam © Signals and Systems EE235 Lecture 26.
بسم الله الرحمن الرحيم Digital Signal Processing Lecture 3 Review of Discerete time Fourier Transform (DTFT) University of Khartoum Department of Electrical.
Fourier Transform and Spectra
Fourier Transform and Spectra
EE354 : Communications System I
Signals & systems Ch.3 Fourier Transform of Signals and LTI System
UNIT-III Signal Transmission through Linear Systems
CE Digital Signal Processing Fall Discrete-time Fourier Transform
LECTURE 11: FOURIER TRANSFORM PROPERTIES
Digital Signal Processing Lecture 4 DTFT
Recap: Chapters 1-7: Signals and Systems
Chapter 2. Fourier Representation of Signals and Systems
UNIT II Analysis of Continuous Time signal
EE 638: Principles of Digital Color Imaging Systems
Advanced Digital Signal Processing
Digital Signal Processing
HKN ECE 210 Exam 3 Review Session
Signals and Systems EE235 Leo Lam ©
Fourier Transform and Spectra
6. Time and Frequency Characterization of Signals and Systems
Signals & Systems (CNET - 221) Chapter-5 Fourier Transform
Signals and Systems EE235 Lecture 23 Leo Lam ©
Continuous-Time Fourier Transform
Signals & Systems (CNET - 221) Chapter-4
4. The Continuous time Fourier Transform
Chapter 3 Sampling.
LECTURE 11: FOURIER TRANSFORM PROPERTIES
Presentation transcript:

Continuous-Time Fourier Transform 主講者:虞台文

Content Introduction Fourier Integral Fourier Transform Properties of Fourier Transform Convolution Parseval’s Theorem

Continuous-Time Fourier Transform Introduction

The Topic Time Discrete Fourier Periodic Series Transform Continuous Aperiodic

Review of Fourier Series Deal with continuous-time periodic signals. Discrete frequency spectra. A Periodic Signal T 2T 3T t f(t)

Two Forms for Fourier Series Sinusoidal Form Complex Form:

How to Deal with Aperiodic Signal? f(t) If T, what happens?

Continuous-Time Fourier Transform Fourier Integral

Fourier Integral Let

Fourier Integral F(j) Synthesis Analysis

Fourier Series vs. Fourier Integral Period Function Discrete Spectra Fourier Integral: Non-Period Function Continuous Spectra

Continuous-Time Fourier Transform

Fourier Transform Pair Inverse Fourier Transform: Synthesis Fourier Transform: Analysis

Existence of the Fourier Transform Sufficient Condition: f(t) is absolutely integrable, i.e.,

Continuous Spectra FR(j) FI(j) |F(j)| () Magnitude Phase

Example 1 -1 t f(t)

Example 1 -1 t f(t)

Example t f(t) et

Example t f(t) et

Continuous-Time Fourier Transform Properties of Fourier Transform

Notation

Linearity Proved by yourselves

Time Scaling Proved by yourselves

Time Reversal Pf)

Time Shifting Pf)

Frequency Shifting (Modulation) Pf)

Symmetry Property Pf) Interchange symbols  and t

Fourier Transform for Real Functions If f(t) is a real function, and F(j) = FR(j) + jFI(j) F(j) = F*(j)

Fourier Transform for Real Functions If f(t) is a real function, and F(j) = FR(j) + jFI(j) F(j) = F*(j) FR(j) = FR(j) FI(j) = FI(j) FR(j) is even, and FI(j) is odd. Magnitude spectrum |F(j)| is even, and phase spectrum () is odd.

Fourier Transform for Real Functions If f(t) is real and even If f(t) is real and odd F(j) is real F(j) is pure imaginary   Pf) Pf) Even Odd Real Real

Example: Sol)

Example: d/2 d/2 1 t wd(t) f(t)=wd(t)cos0t

Example: d/2 d/2 1 t wd(t) f(t)=wd(t)cos0t

d/2 d/2 1 t wd(t) Example: Sol)

Fourier Transform of f’(t) Pf)

Fourier Transform of f (n)(t) Proved by yourselves

Fourier Transform of f (n)(t) Proved by yourselves

Fourier Transform of Integral Let

The Derivative of Fourier Transform Pf)

Continuous-Time Fourier Transform Convolution

Basic Concept fi(t) fo(t)=L[fi(t)] Linear System fi(t)=a1 fi1(t) + a2 fi2(t) fo(t)=L[a1 fi1(t) + a2 fi2(t)] A linear system satisfies fo(t) = a1L[fi1(t)] + a2L[fi2(t)] = a1fo1(t) + a2fo2(t)

Basic Concept fo(t) fi(t) Time Invariant System fi(t +t0) fo(t + t0)

Basic Concept fo(t) fi(t) Causal System A causal system satisfies fi(t) = 0 for t < t0 fo(t) = 0 for t < t0

Basic Concept fo(t) fi(t) Causal System Which of the following systems are causal? Basic Concept Causal System fi(t) fo(t) t fi(t) fo(t) t0 t0 t fi(t) fo(t) fi(t) t fo(t) t0

Unit Impulse Response (t) h(t)=L[(t)] LTI System f(t) L[f(t)]=? Facts: Convolution

Unit Impulse Response LTI System (t) h(t)=L[(t)] f(t) L[f(t)]=? Facts: Convolution

Unit Impulse Response Impulse Response LTI System h(t) f(t) f(t)*h(t)

Convolution Definition The convolution of two functions f1(t) and f2(t) is defined as:

Properties of Convolution

Properties of Convolution Impulse Response LTI System h(t) f(t) f(t)*h(t) Impulse Response LTI System f(t) h(t) h(t)*f(t)

Properties of Convolution Prove by yourselves

Properties of Convolution The following two systems are identical Properties of Convolution h1(t) h2(t) h3(t) h2(t) h3(t) h1(t)

Properties of Convolution f(t)

Properties of Convolution f(t)

Properties of Convolution T (tT) f(t) f(t T) t f (t) t f (t) T

Properties of Convolution System function (tT) serves as an ideal delay or a copier. Properties of Convolution T (tT) f(t) f(t T) t f (t) t f (t) T

Properties of Convolution

Properties of Convolution Time Domain Frequency Domain convolution multiplication Properties of Convolution

Properties of Convolution Time Domain Frequency Domain convolution multiplication Properties of Convolution Impulse Response LTI System h(t) f(t) f(t)*h(t) Impulse Response LTI System H(j) F(j) F(j)H(j)

Properties of Convolution Time Domain Frequency Domain convolution multiplication Properties of Convolution F(j)H1(j) F(j)H1(j)H2(j)H3(j) H1(j) H2(j) H3(j) F(j) F(j)H1(j)H2(j)

Properties of Convolution H(j) p p 1 Fo(j)  Fi(j)  An Ideal Low-Pass Filter

Properties of Convolution H(j) p p 1 Fo(j)  Fi(j)  An Ideal High-Pass Filter

Properties of Convolution Prove by yourselves

Properties of Convolution Time Domain Frequency Domain multiplication convolution Properties of Convolution Prove by yourselves

Continuous-Time Fourier Transform Parseval’s Theorem

Properties of Convolution =0

Properties of Convolution If f1(t) and f2(t) are real functions, f2(t) real

Parseval’s Theorem: Energy Preserving