DSP First, 2/e Lecture 18 DFS: Discrete Fourier Series, and Windowing.

Slides:



Advertisements
Similar presentations
DCSP-11 Jianfeng Feng
Advertisements

Ch.4 Fourier Analysis of Discrete-Time Signals
Chapter 8: The Discrete Fourier Transform
Discrete Time Periodic Signals A discrete time signal x[n] is periodic with period N if and only if for all n. Definition: Meaning: a periodic signal keeps.
1 Prof. Nizamettin AYDIN Digital Signal Processing.
Systems: Definition Filter
1 Prof. Nizamettin AYDIN Digital Signal Processing.
Copyright © Shi Ping CUC Chapter 3 Discrete Fourier Transform Review Features in common We need a numerically computable transform, that is Discrete.
Numerical Methods Discrete Fourier Transform Part: Discrete Fourier Transform
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.
1 Prof. Nizamettin AYDIN Digital Signal Processing.
Prof. Nizamettin AYDIN Digital Signal Processing 1.
Prof. Nizamettin AYDIN Digital Signal Processing 1.
1 Prof. Nizamettin AYDIN Digital Signal Processing.
ECE 8443 – Pattern Recognition ECE 3163 – Signals and Systems Objectives: Introduction to the IEEE Derivation of the DFT Relationship to DTFT DFT of Truncated.
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]
Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.
Digital Signal Processing – Chapter 10
Discrete Fourier Transform Prof. Siripong Potisuk.
Prof. Nizamettin AYDIN Digital Signal Processing 1.
1 Prof. Nizamettin AYDIN Digital Signal Processing.
1 Prof. Nizamettin AYDIN Digital Signal Processing.
Zhongguo Liu_Biomedical Engineering_Shandong Univ. Chapter 8 The Discrete Fourier Transform Zhongguo Liu Biomedical Engineering School of Control.
1 Prof. Nizamettin AYDIN Digital Signal Processing.
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.
Signals & Systems Lecture 13: Chapter 3 Spectrum Representation.
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
Prof. Nizamettin AYDIN Digital Signal Processing 1.
1 Prof. Nizamettin AYDIN Digital Signal Processing.
Digital Signal Processing
1 Prof. Nizamettin AYDIN Digital Signal Processing.
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Derivation of the DFT Relationship to DTFT DFT of Truncated Signals.
Eeng Chapter 2 Discrete Fourier Transform (DFT) Topics:  Discrete Fourier Transform. Using the DFT to Compute the Continuous Fourier Transform.
Lecture 18: The Discrete Fourier Transform Instructor: Dr. Ghazi Al Sukkar Dept. of Electrical Engineering The University of Jordan
DSP First, 2/e Lecture 11 FIR Filtering Intro. May 2016 © , JH McClellan & RW Schafer 2 License Info for DSPFirst Slides  This work released.
DSP First, 2/e Lecture 7 Fourier Series Analysis.
DSP First, 2/e Lecture 5 Spectrum Representation.
DSP First, 2/e Lecture 6 Periodic Signals, Harmonics & Time-Varying Sinusoids.
بسم الله الرحمن الرحيم Lecture (12) Dr. Iman Abuel Maaly The Discrete Fourier Transform Dr. Iman Abuel Maaly University of Khartoum Department of Electrical.
DSP-First, 2/e LECTURE #3 Complex Exponentials and Complex Numbers.
DSP First, 2/e LECTURE #1 Sinusoids Aug © , JH McClellan & RW Schafer.
EE422G Signals and Systems Laboratory Fourier Series and the DFT Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
DSP First, 2/e Lecture 16 DTFT Properties. June 2016 © , JH McClellan & RW Schafer 2 License Info for DSPFirst Slides  This work released under.
Lecture 19 Spectrogram: Spectral Analysis via DFT & DTFT
Lecture 6 Periodic Signals, Harmonics & Time-Varying Sinusoids
Lecture 11 FIR Filtering Intro
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
FFT-based filtering and the
Lecture 14 Digital Filtering of Analog Signals
Lecture 8 Fourier Series & Spectrum
4.1 DFT In practice the Fourier components of data are obtained by digital computation rather than by analog processing. The analog values have to be.
Chapter 8 The Discrete Fourier Transform
Lecture 16a FIR Filter Design via Windowing
Lecture 13 Frequency Response of FIR Filters
Lecture 18 DFS: Discrete Fourier Series, and Windowing
Lecture 17 DFT: Discrete Fourier Transform
Lecture 15 DTFT: Discrete-Time Fourier Transform
Chapter 2 Discrete Fourier Transform (DFT)
Digital Signal Processing
Lecture 7C Fourier Series Examples: Common Periodic Signals
Signal Processing First
Chapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform
Signals and Systems Lecture 15
Lecture 5A: Operations on the Spectrum
Lec.6:Discrete Fourier Transform and Signal Spectrum
Lecture 21 Zeros of H(z) and the Frequency Domain
Presentation transcript:

DSP First, 2/e Lecture 18 DFS: Discrete Fourier Series, and Windowing

June 2016 © , JH McClellan & RW Schafer 2 License Info for DSPFirst Slides  This work released under a Creative Commons License with the following terms:Creative Commons License  Attribution  The licensor permits others to copy, distribute, display, and perform the work. In return, licensees must give the original authors credit.  Non-Commercial  The licensor permits others to copy, distribute, display, and perform the work. In return, licensees may not use the work for commercial purposes—unless they get the licensor's permission.  Share Alike  The licensor permits others to distribute derivative works only under a license identical to the one that governs the licensor's work.  Full Text of the License Full Text of the License  This (hidden) page should be kept with the presentation

June 2016 © , JH McClellan & RW Schafer 3 READING ASSIGNMENTS  This Lecture:  Chapter 8, Sections 8-5 & 8-6  Other Reading:  Recitation: Chapter 8

June 2016 © , JH McClellan & RW Schafer 4 LECTURE OBJECTIVES  Discrete Fourier Series for periodic x[n]  DFT of one period gives DFS coefficients  Windowing  extract short sections from long signal

June 2016 © , JH McClellan & RW Schafer 5 Review  Discrete Fourier Transform (DFT)  DFT is frequency sampled DTFT  For finite-length signals  DFT computation via FFT  FFT of zero-padded signal  more freq samples  Transform pairs & properties (DTFT & DFT)

June 2016 © , JH McClellan & RW Schafer 6 Comparison: DFT and DTFT Discrete Fourier Transform (DFT) Inverse DFT Discrete-time Fourier Transform (DTFT) Inverse DTFT

June 2016 © , JH McClellan & RW Schafer 7 Inverse DFT always makes a periodic signal  Evaluate N-pt IDFT outside of [0,N-1]  Thus the IDFT synthesizes a periodic signal

June 2016 © , JH McClellan & RW Schafer 8 Fourier Series for Discrete- Time Signal Given a periodic sequence x[n], how do we write it as a sum of sinusoids (or complex exponentials) ? Which frequencies? How many? Fundamental ? Exponentials must have the same period as x[n], which is N. There are only N possible exps.

June 2016 © , JH McClellan & RW Schafer 9 Discrete Fourier Series Representation (2) Given the sequence x[n], how do we find a k ? Recall IDFT always synthesizes a periodic x[n] So, we find a k by taking N-pt DFT of one period of x[n] and then multiplying by 1/N

June 2016 © , JH McClellan & RW Schafer 10 Discrete Fourier Series (DFS) Synthesis of a periodic signal x[n] = x[n+N] Find a k by taking N-pt DFT of one period of x[n] and then multiplying by 1/N

June 2016 © , JH McClellan & RW Schafer 11 DFT of one period  DFS Figure 8-12 Periodic sequence x[n] in (8.43) and the corresponding 40-point DFT spectrum X[k]. (a) Dark region indicates the 40-point interval (starting at n = 0) taken for analysis. (b) DFT magnitude spectrum. (c) DFT phase spectrum. Can you get the DFS coeffs from this DFT ?

June 2016 © , JH McClellan & RW Schafer 12 DFS Synthesis Example Recall negative frequencies in high indices for the DFT

June 2016 © , JH McClellan & RW Schafer 13 How is DFS related to cont-time Fourier Series ?  Fourier Series (from Chap. 3)  Need to obey the Nyquist rate: i.e., band-limited signal  Then sample

June 2016 © , JH McClellan & RW Schafer 14 How is DFS related to cont- time Fourier Series (2)  Band-limited Fourier Series (from Chap. 3)  Can be sampled to give periodic x[n]  Compare to DFS  Same coefficients

June 2016 © , JH McClellan & RW Schafer 15 Spectrum Analysis of a Periodic Signal x[n]

June 2016 © , JH McClellan & RW Schafer 16 Windows  Finite-Length signal (L) with positive values  Extractor  Truncator

June 2016 © , JH McClellan & RW Schafer 17 Von Hann Window (Time Domain)  Plot of Length-20 von Hann window

June 2016 © , JH McClellan & RW Schafer 18 Von Hann Window (Frequency Domain)  DTFT (magnitude) of Length-20 Hann window

June 2016 © , JH McClellan & RW Schafer 19 Window section of sinusoid, then DFT  Multiply the very long sinusoid by a window  Take the N-pt DFT  Finite number of frequencies (N)  Finite signal length (L) = window length Expectation: 2 narrow spectrum lines

June 2016 © , JH McClellan & RW Schafer 20 DTFT of Windowed Sinusoid (with different windows)  DTFT (magnitude) of windowed sinusoid  Length-40 Hann window vs Length-40 Rectangular window

June 2016 © , JH McClellan & RW Schafer 21 Change Window Length  DTFT (magnitude) of windowed sinusoid.  Length-20 Hann window vs. Length-40 Hann window

June 2016 © , JH McClellan & RW Schafer 22 Challenge: find DFS for x[n] = sampled Dirichlet Synthesis of a periodic signal, x[n] = x[n+N] Find a k by taking N-pt DFT of one period of x[n] and then multiplying by 1/N