The Discrete Fourier Series

Slides:



Advertisements
Similar presentations
Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.
Advertisements

Chapter 8: The Discrete Fourier Transform
Discrete-Time Signals and Systems Quote of the Day Mathematics is the tool specially suited for dealing with abstract concepts of any kind and there is.
EECS 20 Chapter 10 Part 11 Fourier Transform In the last several chapters we Viewed periodic functions in terms of frequency components (Fourier series)
Lecture 8: Fourier Series and Fourier Transform
EE-2027 SaS, L11 1/13 Lecture 11: Discrete Fourier Transform 4 Sampling Discrete-time systems (2 lectures): Sampling theorem, discrete Fourier transform.
Science is organized knowledge. Wisdom is organized life.
Discrete-Time Fourier Transform Properties Quote of the Day The profound study of nature is the most fertile source of mathematical discoveries. Joseph.
Signals and Systems Discrete Time Fourier Series.
CH#3 Fourier Series and Transform
Sampling of Continuous-Time Signals
Systems: Definition Filter
Fast Fourier Transforms
Discrete-Time Fourier Series
Copyright © Shi Ping CUC Chapter 3 Discrete Fourier Transform Review Features in common We need a numerically computable transform, that is Discrete.
Discrete-Time and System (A Review)
1 7.1 Discrete Fourier Transform (DFT) 7.2 DFT Properties 7.3 Cyclic Convolution 7.4 Linear Convolution via DFT Chapter 7 Discrete Fourier Transform Section.
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.
1 Signals & Systems Spring 2009 Week 3 Instructor: Mariam Shafqat UET Taxila.
Chapter 2: Discrete time signals and systems
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]
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|
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.
The Discrete Fourier Transform 主講人:虞台文. Content Introduction Representation of Periodic Sequences – DFS (Discrete Fourier Series) Properties of DFS The.
Zhongguo Liu_Biomedical Engineering_Shandong Univ. Chapter 8 The Discrete Fourier Transform Zhongguo Liu Biomedical Engineering School of Control.
The Inverse z-Transform In science one tries to tell people, in such a way as to be understood by everyone, something that no one ever knew before. But.
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)
Department of Computer Eng. Sharif University of Technology Discrete-time signal processing Chapter 3: THE Z-TRANSFORM Content and Figures are from Discrete-Time.
1 Lecture 1: February 20, 2007 Topic: 1. Discrete-Time Signals and Systems.
Fourier Analysis of Discrete Time Signals
Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.
Lecture 17: The Discrete Fourier Series Instructor: Dr. Ghazi Al Sukkar Dept. of Electrical Engineering The University of Jordan
Lecture 6: DFT XILIANG LUO 2014/10. Periodic Sequence  Discrete Fourier Series For a sequence with period N, we only need N DFS coefs.
Chapter 5 Finite-Length Discrete Transform
Department of Electrical and Computer Engineering Brian M. McCarthy Department of Electrical & Computer Engineering Villanova University ECE8231 Digital.
CH#3 Fourier Series and Transform
Fourier Analysis of Signals and Systems
Linear Time-Invariant Systems Quote of the Day The longer mathematics lives the more abstract – and therefore, possibly also the more practical – it becomes.
The Z-Transform Quote of the Day Such is the advantage of a well-constructed language that its simplified notation often becomes the source of profound.
Transform Analysis of LTI Systems Quote of the Day Any sufficiently advanced technology is indistinguishable from magic. Arthur C. Clarke Content and Figures.
Structures for Discrete-Time Systems
Sampling of Continuous-Time Signals Quote of the Day Optimist: "The glass is half full." Pessimist: "The glass is half empty." Engineer: "That glass is.
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.
Signal and System I The representation of discrete-time signals in terms of impulse Example.
Fourier Analysis Using the DFT Quote of the Day On two occasions I have been asked, “Pray, Mr. Babbage, if you put into the machine wrong figures, will.
1 Convergence of Fourier Series Can we get Fourier Series representation for all periodic signals. I.e. are the coefficients from eqn 3.39 finite or in.
Minimum-Phase Systems Quote of the Day Experience is the name everyone gives to their mistakes. Oscar Wilde Content and Figures are from Discrete-Time.
Discrete-Time Processing of Continuous-Time Signals Quote of the Day Do not worry about your difficulties in Mathematics. I can assure you mine are still.
Generalized Linear Phase Quote of the Day The mathematical sciences particularly exhibit order, symmetry, and limitation; and these are the greatest forms.
ENEE 322: Continuous-Time Fourier Transform (Chapter 4)
CH#3 Fourier Series and Transform 1 st semester King Saud University College of Applied studies and Community Service 1301CT By: Nour Alhariqi.
Lecture 18: The Discrete Fourier Transform Instructor: Dr. Ghazi Al Sukkar Dept. of Electrical Engineering The University of Jordan
Dr. Michael Nasief Digital Signal Processing Lec 7 1.
Relationship between Magnitude and Phase Quote of the Day Experience is the name everyone gives to their mistakes. Oscar Wilde Content and Figures are.
Time Domain Representations of Linear Time-Invariant Systems
الفريق الأكاديمي لجنة الهندسة الكهربائية 1 Discrete Fourier Series Given a periodic sequence with period N so that The Fourier series representation can.
The Discrete Fourier Transform
UNIT II Analysis of Continuous Time signal
Chapter 8 The Discrete Fourier Transform
Notes Assignments Tutorial problems
Sampling the Fourier Transform
Discrete-Time Fourier Transform
Discrete Fourier Transform Dr.P.Prakasam Professor/ECE.
Chapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform
Signals and Systems Lecture 15
Signals and Systems Lecture 11
Presentation transcript:

The Discrete Fourier Series Quote of the Day Whoever despises the high wisdom of mathematics nourishes himself on delusion. Leonardo da Vinci  Content and Figures are from Discrete-Time Signal Processing, 2e by Oppenheim, Shafer, and Buck, ©1999-2000 Prentice Hall Inc.

Discrete Fourier Series Given a periodic sequence with period N so that The Fourier series representation can be written as The Fourier series representation of continuous-time periodic signals require infinite many complex exponentials Not that for discrete-time periodic signals we have Due to the periodicity of the complex exponential we only need N exponentials for discrete time Fourier series Copyright (C) 2005 Güner Arslan 351M Digital Signal Processing

Discrete Fourier Series Pair A periodic sequence in terms of Fourier series coefficients The Fourier series coefficients can be obtained via For convenience we sometimes use Analysis equation Synthesis equation Copyright (C) 2005 Güner Arslan 351M Digital Signal Processing

351M Digital Signal Processing Example 1 DFS of a periodic impulse train Since the period of the signal is N We can represent the signal with the DFS coefficients as Copyright (C) 2005 Güner Arslan 351M Digital Signal Processing

351M Digital Signal Processing Example 2 DFS of an periodic rectangular pulse train The DFS coefficients Copyright (C) 2005 Güner Arslan 351M Digital Signal Processing

351M Digital Signal Processing Properties of DFS Linearity Shift of a Sequence Duality Copyright (C) 2005 Güner Arslan 351M Digital Signal Processing

351M Digital Signal Processing Symmetry Properties Copyright (C) 2005 Güner Arslan 351M Digital Signal Processing

Symmetry Properties Cont’d Copyright (C) 2005 Güner Arslan 351M Digital Signal Processing

351M Digital Signal Processing Periodic Convolution Take two periodic sequences Let’s form the product The periodic sequence with given DFS can be written as Periodic convolution is commutative Copyright (C) 2005 Güner Arslan 351M Digital Signal Processing

Periodic Convolution Cont’d Substitute periodic convolution into the DFS equation Interchange summations The inner sum is the DFS of shifted sequence Substituting Copyright (C) 2005 Güner Arslan 351M Digital Signal Processing

Graphical Periodic Convolution Copyright (C) 2005 Güner Arslan 351M Digital Signal Processing

The Fourier Transform of Periodic Signals Periodic sequences are not absolute or square summable Hence they don’t have a Fourier Transform We can represent them as sums of complex exponentials: DFS We can combine DFS and Fourier transform Fourier transform of periodic sequences Periodic impulse train with values proportional to DFS coefficients This is periodic with 2 since DFS is periodic The inverse transform can be written as Copyright (C) 2005 Güner Arslan 351M Digital Signal Processing

351M Digital Signal Processing Example Consider the periodic impulse train The DFS was calculated previously to be Therefore the Fourier transform is Copyright (C) 2005 Güner Arslan 351M Digital Signal Processing

Relation between Finite-length and Periodic Signals Consider finite length signal x[n] spanning from 0 to N-1 Convolve with periodic impulse train The Fourier transform of the periodic sequence is This implies that DFS coefficients of a periodic signal can be thought as equally spaced samples of the Fourier transform of one period Copyright (C) 2005 Güner Arslan 351M Digital Signal Processing

351M Digital Signal Processing Example Consider the following sequence The Fourier transform The DFS coefficients Copyright (C) 2005 Güner Arslan 351M Digital Signal Processing