Zero-Padding vs Increasing the Observation Size

Slides:



Advertisements
Similar presentations
DCSP-12 Jianfeng Feng
Advertisements

DCSP-11 Jianfeng Feng
Islamic university of Gaza Faculty of engineering Electrical engineering dept. Submitted to: Dr.Hatem Alaidy Submitted by: Ola Hajjaj Tahleel.
DFT properties Note: it is important to ensure that the DFTs are the same length If x1(n) and x2(n) have different lengths, the shorter sequence must be.
Let’s go back to this problem: We take N samples of a sinusoid (or a complex exponential) and we want to estimate its amplitude and frequency by the FFT.
DREAM PLAN IDEA IMPLEMENTATION Introduction to Image Processing Dr. Kourosh Kiani
Chapter 8: The Discrete Fourier Transform
Pole Zero Speech Models Speech is nonstationary. It can approximately be considered stationary over short intervals (20-40 ms). Over thisinterval the source.
Chapter 12 Fourier Transforms of Discrete Signals.
Discrete Fourier Transform(2) Prof. Siripong Potisuk.
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
FT Representation of DT Signals:
Copyright © Shi Ping CUC Chapter 3 Discrete Fourier Transform Review Features in common We need a numerically computable transform, that is Discrete.
Numerical algorithms for power system protection Prof. dr. sc. Ante Marušić, doc. dr. sc. Juraj Havelka University of Zagreb Faculty of Electrical Engineering.
Discrete-Time and System (A Review)
DTFT And Fourier Transform
Chapter 4 The Frequency Domain of Signals and Systems.
The Story of Wavelets.
FOURIER ANALYSIS PART 2: Continuous & Discrete Fourier Transforms
Digital Signal Processing – Chapter 10
Zhongguo Liu_Biomedical Engineering_Shandong Univ. Chapter 8 The Discrete Fourier Transform Zhongguo Liu Biomedical Engineering School of Control.
Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.
Linear filtering based on the DFT
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.
Lecture 21: Fourier Analysis Using the Discrete Fourier Transform Instructor: Dr. Ghazi Al Sukkar Dept. of Electrical Engineering The University of Jordan.
Lecture 12: Parametric Signal Modeling XILIANG LUO 2014/11 1.
Signals and Systems, 2/E by Simon Haykin and Barry Van Veen Copyright © 2003 John Wiley & Sons. Inc. All rights reserved. Figure 4.1 (p. 343) FS and FT.
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.
Lecture 14: Generalized Linear Phase Instructor: Dr. Ghazi Al Sukkar Dept. of Electrical Engineering The University of Jordan
Digital Signal Processing
Eeng Chapter 2 Discrete Fourier Transform (DFT) Topics:  Discrete Fourier Transform. Using the DFT to Compute the Continuous Fourier Transform.
EE345S Real-Time Digital Signal Processing Lab Fall 2006 Lecture 17 Fast Fourier Transform Prof. Brian L. Evans Dept. of Electrical and Computer Engineering.
Lecture 18: The Discrete Fourier Transform Instructor: Dr. Ghazi Al Sukkar Dept. of Electrical Engineering The University of Jordan
بسم الله الرحمن الرحيم Digital Signal Processing Lecture 14 FFT-Radix-2 Decimation in Frequency And Radix -4 Algorithm University of Khartoum Department.
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.
Sampling and DSP Instructor: Dr. Mike Turi Department of Computer Science & Computer Engineering Pacific Lutheran University.
Lecture 19 Spectrogram: Spectral Analysis via DFT & DTFT
Chapter 4 Discrete-Time Signals and transform
DIGITAL SIGNAL PROCESSING ELECTRONICS
BME452 Biomedical Signal Processing
Lecture on Continuous and Discrete Fourier Transforms
Speech Signal Processing
Periodic Signals Prof. Brian L. Evans
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
Dynamic Specifications
Introduction to Converter Sampled-Data Modeling
Sampling and Aliasing Prof. Brian L. Evans
FFT-based filtering and the
SAMPLING & ALIASING.
Sampling and Reconstruction
EE Audio Signals and Systems
Fourier Analysis of Signals Using DFT
Fast Fourier Transform
Lecture 4 Sampling & Aliasing
Chapter 8 The Discrete Fourier Transform
Digital Signal Processing
CS3291: "Interrogation Surprise" on Section /10/04
Lecture 18 DFS: Discrete Fourier Series, and Windowing
Chapter 2 Discrete Fourier Transform (DFT)
Chapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform
Introduction to MATLAB
Today's lecture System Implementation Discrete Time signals generation
Discrete Fourier Transform
Lec.6:Discrete Fourier Transform and Signal Spectrum
Matlab Tutorial #2 Kathleen Chen February 13, 2018.
Fast Fourier Transform
Fourier Transforms of Discrete Signals By Dr. Varsha Shah
Electrical Communications Systems ECE
Presentation transcript:

Zero-Padding vs Increasing the Observation Size By: Prof. Dr. Erhan A. İnce Electrical and Electronic Engineering Dept. FALL 2016-2017 e-mail: erhan.ince@emu.edu.tr http://faraday.ee.emu.edu.tr/eeng420

A: Zero padding the input sequence and how it affects DFT B: Effect of Increasing window length for input x[n] on frequency resolution

Frequency Interval/Resolution Comparison DFT’s frequency resolution ∆ Fres ∼ 1/NT [Hz] and covered frequency interval ∆F = N∆Fres = 1/T = Fs [Hz]. Frequency resolution is determined only by the length of the observation interval, whereas the frequency interval is determined by the length of sampling interval.

Example (DFT Resolution): Two complex exponentials with two close frequencies F1 = 10 Hz and F2 = 12 Hz sampled with the sampling interval T = 0.02 seconds. Consider various data lengths N = 10, 15, 30, 100 with zero padding to 512 points. DFT with N = 10 and zero padding to 512 points. Not resolved: F2 − F1 = 2 Hz < 1/(NT) = 5 Hz.

DFT with N = 15 and zero padding to 512 points DFT with N = 15 and zero padding to 512 points. Not resolved: F2 − F1 = 2 Hz < 1/(NT) ≈ 3.3 Hz.

DFT with N = 30 and zero padding to 512 points DFT with N = 30 and zero padding to 512 points. Resolved: F2 − F1 = 2 Hz > 1/(NT) ≈ 1.7 Hz.

DFT with N = 100 and zero padding to 512 points DFT with N = 100 and zero padding to 512 points. Resolved: F2 − F1 = 2 Hz > 1/(NT) = 0.5 Hz.

If zero-adding does not make the DFT a better approximation of the DFTF why do we use it? There are two reasons We want more densely spaced samples of the DFT (usefull when showing it graphically) We want out input sequence length to be a power of two (for using FFT)

If zero padding does not help more accurately recover the two impulses for the input signal x[n] how can we get a better representation of the two impulses? Ans: We must widen our window of x[n]

fs = 100; T = 1/fs; N = 300; n = 0:N-1; t = n*T; x = cos (2*pi*3*t); X_mags = abs(fft(x)); subplot(2,1,1) plot(x) xlabel('Samples'); ylabel('Amplitude'); title('Time domain signal') num_disp_bins = 25; subplot(2,1,2) plot([0:num_disp_bins-1],X_mags(1:num_disp_bins),'k.'); hold on plot([0:num_disp_bins-1],X_mags(1:num_disp_bins)) hold off xlabel('Frequency Bins'); ylabel('Magnitude'); title('Frequency Magnitude')

x1= [zeros(1,362) x zeros(1,362)]; N = length(x1); n= 0:N-1; X_mags1 = abs(fft(x1)); figure subplot(2,1,1) plot(n,x1) subplot(2,1,2) plot(X_mags1 )

x22= [zeros(1,724) x zeros(1,724)]; N = length(x22); n= 0:N-1; X_mags1 = abs(fft(x22)); figure subplot(2,1,1) plot(n,x22) subplot(2,1,2) plot(X_mags1 )

fs = 100; T = 1/fs; N = 800; n = 0:N-1; t = n*T; xnew = cos (2*pi*3*t); xnew= [zeros(1,112) xnew zeros(1,112)]; N = length(xnew); n= 0:N-1; X_mags = abs(fft(xnew)); figure subplot(2,1,1) plot(n,xnew) subplot(2,1,2) plot(X_mags )

Window size 800 Padded to 1024

fs = 100; T = 1/fs; N = 1500; n = 0:N-1; t = n*T; xnew = cos (2*pi*3*t); xnew= [zeros(1,274) xnew zeros(1,274)]; N = length(xnew); n= 0:N-1; X_mags = abs(fft(xnew)); figure subplot(2,1,1) plot(n,xnew) subplot(2,1,2) plot(X_mags )

Window size 1500 Zero padded to 2048

Conclusion Zero padding does not help increase the resolution. Widening the window size (wider observation interval) helps obtain better frequency resolution.