EECS 20 Chapter 10 Part 11 Fourier Transform In the last several chapters we Viewed periodic functions in terms of frequency components (Fourier series)

Slides:



Advertisements
Similar presentations
Lecture 7: Basis Functions & Fourier Series
Advertisements

Review of Frequency Domain
Chapter 8: The Discrete Fourier Transform
EECS 20 Chapter 8 Part 21 Frequency Response Last time we Revisited formal definitions of linearity and time-invariance Found an eigenfunction for linear.
Autumn Analog and Digital Communications Autumn
EECS 20 Chapter 10 Part 11 Sampling and Reconstruction Last time we Viewed aperiodic functions in terms of frequency components via Fourier transform Gained.
Lecture 8: Fourier Series and Fourier Transform
APPLICATIONS OF FOURIER REPRESENTATIONS TO
Signals, Fourier Series
EE-2027 SaS, L11 1/13 Lecture 11: Discrete Fourier Transform 4 Sampling Discrete-time systems (2 lectures): Sampling theorem, discrete Fourier transform.
EECS 20 Chapter 9 Part 21 Convolution, Impulse Response, Filters In Chapter 5 we Had our first look at LTI systems Considered discrete-time systems, some.
Continuous-Time Fourier Methods
The z Transform M. J. Roberts - All Rights Reserved. Edited by Dr. Robert Akl.
EECS 20 Chapter 9 Part 21 Convolution, Impulse Response, Filters Last time we Revisited the impulse function and impulse response Defined the impulse (Dirac.
Discrete-Time Convolution Linear Systems and Signals Lecture 8 Spring 2008.
Signals and Systems Discrete Time Fourier Series.
EE D Fourier Transform.
The Discrete Fourier Series
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 4 Image Enhancement in the Frequency Domain Chapter.
CH#3 Fourier Series and Transform
Discrete-Time and System (A Review)
DTFT And Fourier Transform
1 Chapter 8 The Discrete Fourier Transform 2 Introduction  In Chapters 2 and 3 we discussed the representation of sequences and LTI systems in terms.
Signals and Systems Jamshid Shanbehzadeh.
Fourier Series Summary (From Salivahanan et al, 2002)
EE D Fourier Transform. Bahadir K. Gunturk EE Image Analysis I 2 Summary of Lecture 2 We talked about the digital image properties, including.
Chapter 2. Fourier Representation of Signals and Systems
Outline  Fourier transforms (FT)  Forward and inverse  Discrete (DFT)  Fourier series  Properties of FT:  Symmetry and reciprocity  Scaling in time.
CISE315 SaS, L171/16 Lecture 8: Basis Functions & Fourier Series 3. Basis functions: Concept of basis function. Fourier series representation of time functions.
1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 EKT 232.
(Lecture #08)1 Digital Signal Processing Lecture# 8 Chapter 5.
Digital Signal Processing – Chapter 10
Module 2 SPECTRAL ANALYSIS OF COMMUNICATION SIGNAL.
1 Review of Continuous-Time Fourier Series. 2 Example 3.5 T/2 T1T1 -T/2 -T 1 This periodic signal x(t) repeats every T seconds. x(t)=1, for |t|
The Continuous - Time Fourier Transform (CTFT). Extending the CTFS The CTFS is a good analysis tool for systems with periodic excitation but the CTFS.
Signal and Systems Prof. H. Sameti Chapter 5: The Discrete Time Fourier Transform Examples of the DT Fourier Transform Properties of the DT Fourier Transform.
1 Fourier Representations of Signals & Linear Time-Invariant Systems Chapter 3.
Fundamentals of Electric Circuits Chapter 18 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
EE104: Lecture 5 Outline Review of Last Lecture Introduction to Fourier Transforms Fourier Transform from Fourier Series Fourier Transform Pair and Signal.
Chapter 4 Fourier transform Prepared by Dr. Taha MAhdy.
Signal and System I The unit step response of an LTI system.
Zhongguo Liu_Biomedical Engineering_Shandong Univ. Chapter 8 The Discrete Fourier Transform Zhongguo Liu Biomedical Engineering School of Control.
Signals and Systems Dr. Mohamed Bingabr University of Central Oklahoma
1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 EKT 232.
Basic Operation on Signals Continuous-Time Signals.
BYST SigSys - WS2003: Fourier Rep. 120 CPE200 Signals and Systems Chapter 3: Fourier Representations for Signals (Part I)
Course Outline (Tentative) Fundamental Concepts of Signals and Systems Signals Systems Linear Time-Invariant (LTI) Systems Convolution integral and sum.
Signals and Systems Using MATLAB Luis F. Chaparro
Chapter 2. Signals and Linear Systems
Leo Lam © Signals and Systems EE235 Leo Lam.
CH#3 Fourier Series and Transform
Fourier Analysis of Signals and Systems
ES97H Biomedical Signal Processing
INTRODUCTION TO SIGNALS
DTFT continue (c.f. Shenoi, 2006)  We have introduced DTFT and showed some of its properties. We will investigate them in more detail by showing the associated.
1 Roadmap SignalSystem Input Signal Output Signal characteristics Given input and system information, solve for the response Solving differential equation.
Frequency domain analysis and Fourier Transform
ENEE 322: Continuous-Time Fourier Transform (Chapter 4)
The Fourier Transform.
CH#3 Fourier Series and Transform 1 st semester King Saud University College of Applied studies and Community Service 1301CT By: Nour Alhariqi.
Dr. Michael Nasief Digital Signal Processing Lec 7 1.
Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
الفريق الأكاديمي لجنة الهندسة الكهربائية 1 Discrete Fourier Series Given a periodic sequence with period N so that The Fourier series representation can.
Image Enhancement in the
Notes Assignments Tutorial problems
Lecture 18 DFS: Discrete Fourier Series, and Windowing
Signals & Systems (CNET - 221) Chapter-5 Fourier Transform
Signals and Systems Lecture 15
Chapter 3 Sampling.
Presentation transcript:

EECS 20 Chapter 10 Part 11 Fourier Transform In the last several chapters we Viewed periodic functions in terms of frequency components (Fourier series) as well as ordinary functions of time Viewed LTI systems in terms of what they do to frequency components (frequency response) Viewed LTI systems in terms of what they do to time-domain signals (convolution with impulse response) Today we will View aperiodic functions in terms of frequency components via Fourier transform Define (continuous-time) Fourier transform and DTFT Gain insight into the meaning of Fourier transform through comparison with Fourier series

EECS 20 Chapter 10 Part 12 Review: Fourier Series The Fourier series represents a periodic signal in terms of frequency components: We get the Fourier series coefficients as follows: The complex exponential Fourier coefficients are a sequence of complex numbers representing the frequency component ω 0 k.

EECS 20 Chapter 10 Part 13 Discrete Fourier Transform: Like Fourier Series There is another, only slightly different, way to write a discrete- time periodic signal as a sum of complex exponentials of frequency ω 0 k. We call it the discrete Fourier transform (DFT), but it is very similar to the discrete Fourier series (DFS): We simply move the 1/p term outside the sum. The terms of the DFT are thus similar to the DFS: X’ k = p X k They also give an idea of the relative scaling of the frequency components.

EECS 20 Chapter 10 Part 14 Discrete Time Fourier Transform Note that for a signal with period p, when determining X’ k we just need to sum over 1 period and start the sum at any point: What if the period was really large? Like infinity? Though the DFT is not defined for aperiodic signals, we have a name for the DFT equation extended to an infinite sum: Discrete Time Fourier Transform (DTFT)

EECS 20 Chapter 10 Part 15 Interpretation of Fourier Transform The discrete-time Fourier transform, like the discrete Fourier series and DFT, gives a measure of the relative weight of each frequency component in the signal x. But, here we do not compare it to a fundamental frequency ω 0 (because there is none). The fact that periodic signals will only have frequencies that are integer multiples of the fundamental gave us a sequence of possible frequencies, and a sequence of weights X k. Now we can have any frequency. So we need a function that takes values at all real frequencies to describe the signal.

EECS 20 Chapter 10 Part 16 Continuous Time Fourier Transform We can extend the formula for continuous-time Fourier series coefficients for a periodic signal to aperiodic signals as well. The continuous-time Fourier series is not defined for aperiodic signals, but we call the formula the (continuous time) Fourier transform.

EECS 20 Chapter 10 Part 17 Inverse Transforms If we have the full sequence of Fourier coefficients for a periodic signal, we can reconstruct it by multiplying the complex sinusoids of frequency ω 0 k by the weights X k and summing: We can perform a similar reconstruction for aperiodic signals: These are called the inverse transforms.

EECS 20 Chapter 10 Part 18 Example Find the Fourier transform of a pulse centered at zero: 1 1

EECS 20 Chapter 10 Part 19 Sinc Function

EECS 20 Chapter 10 Part 110 Fourier Transform of Impulse Functions Find the Fourier transform of the Dirac delta function: Find the DTFT of the Kronecker delta function: The delta functions contain all frequencies at equal amplitudes. Roughly speaking, that’s why the system response to an impulse input is important: it tests the system at all frequencies.

EECS 20 Chapter 10 Part 111 The Heisenberg Uncertainty Principle The delta functions are “localized” in time; they are nonzero at just one point and zero everywhere else. But the frequency “spread” of the delta functions is not localized. We showed that X(ω) is always 1; it never dies out. For sinusoids, the opposite is true. They never die out in time, but the frequency spread is just one point. The pulse function was somewhat localized in time, and somewhat localized in frequency (the sinc function dies out asymptotically). This is the Heisenberg uncertainty principle: the product of the time “spread” and frequency “spread” of a function can never be less than a defined minimum nonzero value.

EECS 20 Chapter 10 Part 112 Time, Frequency, and Time-Frequency We know we can represent functions in terms of frequency components (sinusoids). These basis functions are nonzero at single points in the frequency domain, but never die out in the time domain. We can also represent functions in the time domain. Using the sifting property, we can represent any function in terms of deltas. For example, imagine every discrete time function as a train of appropriately scaled Kronecker deltas. These basis functions are single points in time, never dying out in frequency. We can also represent functions in terms of other basis functions, somewhat localized in time and frequency, like the pulse and sinc. These functions are referred to as wavelets, and they form time-frequency representation of a signal.