APPLICATION of the DFT: Estimation of Frequency Spectrum

Slides:



Advertisements
Similar presentations
DCSP-12 Jianfeng Feng
Advertisements

DCSP-13 Jianfeng Feng
DCSP-13 Jianfeng Feng Department of Computer Science Warwick Univ., UK
Revision of Chapter IV Three forms of transformations z transform DTFT: a special case of ZT DFT: numerical implementation of DTFT DTFT X(w)= X (z)|Z=exp(jw)
Symmetry and the DTFT If we know a few things about the symmetry properties of the DTFT, it can make life simpler. First, for a real-valued sequence x(n),
Ch.4 Fourier Analysis of Discrete-Time Signals
10.1 fourier analysis of signals using the DFT 10.2 DFT analysis of sinusoidal signals 10.3 the time-dependent fourier transform Chapter 10 fourier analysis.
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.
Fourier series With coefficients:. Complex Fourier series Fourier transform (transforms series from time to frequency domain) Discrete Fourier transform.
Filtering Filtering is one of the most widely used complex signal processing operations The system implementing this operation is called a filter A filter.
Ideal Filters One of the reasons why we design a filter is to remove disturbances Filter SIGNAL NOISE We discriminate between signal and noise in terms.
Course 2007-Supplement Part 11 NTSC (1) NTSC: 2:1 interlaced, 525 lines per frame, 60 fields per second, and 4:3 aspect ratio horizontal sweep frequency,
Chapter 12 Fourier Transforms of Discrete Signals.
Discrete Fourier Transform(2) Prof. Siripong Potisuk.
Continuous Time Signals All signals in nature are in continuous time.
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
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.
AGC DSP AGC DSP Professor A G Constantinides 1 Digital Filter Specifications Only the magnitude approximation problem Four basic types of ideal filters.
Systems: Definition Filter
Lecture 24: Cross-correlation and spectral analysis MP574.
Goals For This Class Quickly review of the main results from last class Convolution and Cross-correlation Discrete Fourier Analysis: Important Considerations.
Nov '05CS3291 : Section 81 UNIVERSITY of MANCHESTER Department of Computer Science CS3291 Digital Signal Processing ‘05 Section 8 Introduction to the DFT.
Frequency Domain Representation of Sinusoids: Continuous Time Consider a sinusoid in continuous time: Frequency Domain Representation: magnitude phase.
DTFT And Fourier Transform
Time-Domain Methods for Speech Processing 虞台文. Contents Introduction Time-Dependent Processing of Speech Short-Time Energy and Average Magnitude Short-Time.
Sampling Theorems. Periodic Sampling Most signals are continuous in time. Example: voice, music, images ADC and DAC is needed to convert from continuous-time.
Chapter 4 The Frequency Domain of Signals and Systems.
ECE 8443 – Pattern Recognition ECE 3163 – Signals and Systems Objectives: Introduction to the IEEE Derivation of the DFT Relationship to DTFT DFT of Truncated.
Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.
FOURIER ANALYSIS PART 2: Continuous & Discrete Fourier Transforms
1 BIEN425 – Lecture 10 By the end of the lecture, you should be able to: –Describe the reason and remedy of DFT leakage –Design and implement FIR filters.
Professor A G Constantinides 1 The Fourier Transform & the DFT Fourier transform Take N samples of from 0 to.(N-1)T Can be estimated from these? Estimate.
Real time DSP Professors: Eng. Julian S. Bruno Eng. Jerónimo F. Atencio Sr. Lucio Martinez Garbino.
Fourier Analysis of Discrete Time Signals
Discrete Fourier Transform in 2D – Chapter 14. Discrete Fourier Transform – 1D Forward Inverse M is the length (number of discrete samples)
1 Spectrum Estimation Dr. Hassanpour Payam Masoumi Mariam Zabihi Advanced Digital Signal Processing Seminar Department of Electronic Engineering Noushirvani.
Time Frequency Analysis
Lecture#10 Spectrum Estimation
1 Digital Signal Processing Digital Signal Processing  IIR digital filter structures  Filter design.
Lecture 21: Fourier Analysis Using the Discrete Fourier Transform Instructor: Dr. Ghazi Al Sukkar Dept. of Electrical Engineering The University of Jordan.
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.
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Derivation of the DFT Relationship to DTFT DFT of Truncated Signals.
Learning from the Past, Looking to the Future James R. (Jim) Beaty, PhD - NASA Langley Research Center Vehicle Analysis Branch, Systems Analysis & Concepts.
Eeng Chapter 2 Discrete Fourier Transform (DFT) Topics:  Discrete Fourier Transform. Using the DFT to Compute the Continuous Fourier Transform.
بسم الله الرحمن الرحيم Lecture (12) Dr. Iman Abuel Maaly The Discrete Fourier Transform Dr. Iman Abuel Maaly University of Khartoum Department of Electrical.
Professor A G Constantinides 1 Digital Filter Specifications We discuss in this course only the magnitude approximation problem There are four basic types.
Lecture 19 Spectrogram: Spectral Analysis via DFT & DTFT
UNIT-II FOURIER TRANSFORM
Chapter 4 Discrete-Time Signals and transform
Fourier series With coefficients:.
BME452 Biomedical Signal Processing
Lecture on Continuous and Discrete Fourier Transforms
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
MECH 373 Instrumentation and Measurements
MECH 373 Instrumentation and Measurements
The Discrete Fourier Transform
Fourier Analysis of Signals Using DFT
LINEAR-PHASE FIR FILTERS DESIGN
Sinusoids: continuous time
MECH 373 Instrumentation and Measurements
Lecture 14 Outline: Discrete Fourier Series and Transforms
Ideal Filters One of the reasons why we design a filter is to remove disturbances Filter SIGNAL NOISE We discriminate between signal and noise in terms.
Sampling the Fourier Transform
Lecture 18 DFS: Discrete Fourier Series, and Windowing
Chapter 2 Discrete Fourier Transform (DFT)
CT-321 Digital Signal Processing
Chapter 7 Finite Impulse Response(FIR) Filter Design
Today's lecture System Implementation Discrete Time signals generation
Lec.6:Discrete Fourier Transform and Signal Spectrum
Fourier Transforms of Discrete Signals By Dr. Varsha Shah
Presentation transcript:

APPLICATION of the DFT: Estimation of Frequency Spectrum Consider a Sinusoid: ? DFT we sample ... and take a finite set of samples (window) ... Problem: how the DFT is going to look like?

Relationship between FT -> DTFT SAMPLING It can be shown that and are related as

Then let’s see the effect of windowing on the DTFT:

samples of Then we can relate DFT and DTFT as follows: In formulas: with:

So if we have a sampled sinusoid at frequency the DFT of a finite length of sequence looks like this: First we look at the DTFT of the windowed sequence: one period one period one period

Then we take samples of the DTFT as For k=0,…,N-1

Consequence: when we take an N-point the DFT of a sinusoid, we have two effects: Loss of Resolution: the sinusoid is not exactly localized in frequency; Sidelobes: other frequencies (artifacts) appear. Example: consider a sinusoid of frequency 2kHz, sampled at 8kHz. Take N=128 points.

We have to be careful when we apply the DFT, since we can miss some frequency components. Two typical cases: Two frequency components and too close to each other , ie with We can see only one peak since the two main lobes due to the two frequencies merge together

One weak component next to a strong component The weak component is “buried” under the sidelobes of the strong component

As seen, there are two main problems when we want to estimate the frequency spectrum using the DFT: Loss of resolution: a peak of the DFT at an index signifies a sinusoid at a frequency which can be anywhere in the interval in digital frequency (radians), or in analog frequency (Hz) To improve the resolution: use more data points! (ie. larger N)

Other problem: artifacts which can hide other frequency components Other problem: artifacts which can hide other frequency components. To reduce artifacts use different windows. DFT with Window (Hamming Window): peak for weaker sinusoid lower sidelobes DFT

Most used Windows: Rectangular: Bartlett: Hanning: Hamming: Blackman: