Lecture 18 DFS: Discrete Fourier Series, and Windowing

Slides:



Advertisements
Similar presentations
DCSP-11 Jianfeng Feng
Advertisements

Islamic university of Gaza Faculty of engineering Electrical engineering dept. Submitted to: Dr.Hatem Alaidy Submitted by: Ola Hajjaj Tahleel.
Ch.4 Fourier Analysis of Discrete-Time Signals
Chapter 8: The Discrete Fourier Transform
EECS 20 Chapter 10 Part 11 Fourier Transform In the last several chapters we Viewed periodic functions in terms of frequency components (Fourier series)
MSP15 The Fourier Transform (cont’) Lim, MSP16 The Fourier Series Expansion Suppose g(t) is a transient function that is zero outside the interval.
Signals and Systems Discrete Time Fourier Series.
Continuous Time Signals All signals in nature are in continuous time.
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.
Systems: Definition Filter
Goals For This Class Quickly review of the main results from last class Convolution and Cross-correlation Discrete Fourier Analysis: Important Considerations.
Frequency Domain Representation of Sinusoids: Continuous Time Consider a sinusoid in continuous time: Frequency Domain Representation: magnitude phase.
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.
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.
Digital Image Processing Chapter 4 Image Enhancement in the Frequency Domain Part I.
Zhongguo Liu_Biomedical Engineering_Shandong Univ. Chapter 8 The Discrete Fourier Transform Zhongguo Liu Biomedical Engineering School of Control.
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.
Eeng Chapter 2 Discrete Fourier Transform (DFT) Topics:  Discrete Fourier Transform. Using the DFT to Compute the Continuous Fourier Transform.
DSP First, 2/e Lecture 7 Fourier Series Analysis.
DSP First, 2/e Lecture 6 Periodic Signals, Harmonics & Time-Varying Sinusoids.
DSP First, 2/e Lecture 18 DFS: Discrete Fourier Series, and Windowing.
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
Chapter 4 Discrete-Time Signals and transform
Lecture 6 Periodic Signals, Harmonics & Time-Varying Sinusoids
Signal Processing First
Lecture 11 FIR Filtering Intro
MECH 373 Instrumentation and Measurements
LECTURE #3 Complex Exponentials & Complex Numbers
Digital Signal Processing Lecture 4 DTFT
Signal Processing First
Lecture 12 Linearity & Time-Invariance Convolution
FFT-based filtering and the
Lecture 5 Spectrum Representation
The Discrete Fourier Transform
Lecture 14 Digital Filtering of Analog Signals
Lecture 10 Digital to Analog (D-to-A) Conversion
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
Sampling the Fourier Transform
Lecture 16a FIR Filter Design via Windowing
Lecture 13 Frequency Response of FIR Filters
Lecture 17 DFT: Discrete Fourier Transform
Lecture 15 DTFT: Discrete-Time Fourier Transform
LECTURE 18: FAST FOURIER TRANSFORM
Chapter 2 Discrete Fourier Transform (DFT)
Digital Signal Processing
Lecture 7C Fourier Series Examples: Common Periodic Signals
Lecture 20 Z Transforms: Introduction
Signal Processing First
Chapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform
Signals and Systems Lecture 15
Lecture 22 IIR Filters: Feedback and H(z)
Lecture 5A: Operations on the Spectrum
Lec.6:Discrete Fourier Transform and Signal Spectrum
Signal Processing First
CE Digital Signal Processing Fall Discrete Fourier Transform (DFT)
LECTURE 18: FAST FOURIER TRANSFORM
Lecture 21 Zeros of H(z) and the Frequency Domain
Fourier Transforms of Discrete Signals By Dr. Varsha Shah
Presentation transcript:

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

© 2003-2016, JH McClellan & RW Schafer READING ASSIGNMENTS This Lecture: Chapter 8, Sections 8-3, 8-5 & 8-6 Aug 2016 © 2003-2016, JH McClellan & RW Schafer

© 2003-2016, JH McClellan & RW Schafer LECTURE OBJECTIVES Discrete Fourier Series for periodic x[n] DFT of one period with scaling by 1/N gives scaled DFS coefficients Windowing extract short sections from long signal Aug 2016 © 2003-2016, JH McClellan & RW Schafer

© 2003-2016, JH McClellan & RW Schafer 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) Aug 2016 © 2003-2016, JH McClellan & RW Schafer

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

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

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. Aug 2016 © 2003-2016, JH McClellan & RW Schafer

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

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

© 2003-2016, JH McClellan & RW Schafer DFT of one period  DFS Can you get the DFS coeffs from this DFT ? 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. Aug 2016 © 2003-2016, JH McClellan & RW Schafer

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

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 Aug 2016 © 2003-2016, JH McClellan & RW Schafer

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 Aug 2016 © 2003-2016, JH McClellan & RW Schafer

Spectrum Analysis of a Periodic Signal x[n] Aug 2016 © 2003-2016, JH McClellan & RW Schafer

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

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

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

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 Aug 2016 © 2003-2016, JH McClellan & RW Schafer

DTFT of Windowed Sinusoid (with different windows) DTFT (magnitude) of windowed sinusoid Length-40 Hann window vs Length-40 Rectangular window UnWeighted Hann Window Aug 2016 © 2003-2016, JH McClellan & RW Schafer

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