Fourier Analysis of Signals Using the DFT

Similar documents
! Spectral Analysis with DFT. ! Windowing. ! Effect of zero-padding. ! Time-dependent Fourier transform. " Aka short-time Fourier transform

Discrete Fourier Transform

EECE 301 Signals & Systems Prof. Mark Fowler

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science : Discrete-Time Signal Processing

EE482: Digital Signal Processing Applications

LAB 6: FIR Filter Design Summer 2011

EEO 401 Digital Signal Processing Prof. Mark Fowler

INTRODUCTION TO DELTA-SIGMA ADCS

1. Calculation of the DFT

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science. Fall Solutions for Problem Set 2

EDISP (NWL3) (English) Digital Signal Processing DFT Windowing, FFT. October 19, 2016

Central to this is two linear transformations: the Fourier Transform and the Laplace Transform. Both will be considered in later lectures.

! Circular Convolution. " Linear convolution with circular convolution. ! Discrete Fourier Transform. " Linear convolution through circular

Continuous Fourier transform of a Gaussian Function

Aspects of Continuous- and Discrete-Time Signals and Systems

Distortion Analysis T

Digital Signal Processing. Midterm 1 Solution

In this Lecture. Frequency domain analysis

ECE 301 Fall 2010 Division 2 Homework 10 Solutions. { 1, if 2n t < 2n + 1, for any integer n, x(t) = 0, if 2n 1 t < 2n, for any integer n.

Chapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum

ECG782: Multidimensional Digital Signal Processing

Chirp Transform for FFT

Review: Continuous Fourier Transform

INTRODUCTION TO DELTA-SIGMA ADCS

Multimedia Signals and Systems - Audio and Video. Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2

Summary of lecture 1. E x = E x =T. X T (e i!t ) which motivates us to define the energy spectrum Φ xx (!) = jx (i!)j 2 Z 1 Z =T. 2 d!

ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization

EE123 Digital Signal Processing

Ch.11 The Discrete-Time Fourier Transform (DTFT)

The Z-Transform. For a phasor: X(k) = e jωk. We have previously derived: Y = H(z)X

Contents. Digital Signal Processing, Part II: Power Spectrum Estimation

Lecture 4 - Spectral Estimation

6.003: Signals and Systems. Sampling and Quantization

EE 435. Lecture 32. Spectral Performance Windowing

BME 50500: Image and Signal Processing in Biomedicine. Lecture 2: Discrete Fourier Transform CCNY

UNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.

ELEG 305: Digital Signal Processing

Fall 2011, EE123 Digital Signal Processing

Each problem is worth 25 points, and you may solve the problems in any order.

SNR Calculation and Spectral Estimation [S&T Appendix A]

Signals and Systems Spring 2004 Lecture #9

L6: Short-time Fourier analysis and synthesis

ECE-314 Fall 2012 Review Questions for Midterm Examination II

-Digital Signal Processing- FIR Filter Design. Lecture May-16

EE123 Digital Signal Processing. M. Lustig, EECS UC Berkeley

6.003 Signal Processing

Chapter 5 Frequency Domain Analysis of Systems

Review of Discrete-Time System

convenient means to determine response to a sum of clear evidence of signal properties that are obscured in the original signal

EE 505 Lecture 10. Spectral Characterization. Part 2 of 2

LAB 2: DTFT, DFT, and DFT Spectral Analysis Summer 2011

4.1 Introduction. 2πδ ω (4.2) Applications of Fourier Representations to Mixed Signal Classes = (4.1)

The Discrete Fourier Transform

II. Nonparametric Spectrum Estimation for Stationary Random Signals - Non-parametric Methods -

Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is

Music 270a: Complex Exponentials and Spectrum Representation

x[n] = x a (nt ) x a (t)e jωt dt while the discrete time signal x[n] has the discrete-time Fourier transform x[n]e jωn

CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation

EE482: Digital Signal Processing Applications

A system that is both linear and time-invariant is called linear time-invariant (LTI).

Chapter 5 Frequency Domain Analysis of Systems

Periodicity. Discrete-Time Sinusoids. Continuous-time Sinusoids. Discrete-time Sinusoids

Signals and Systems. Spring Room 324, Geology Palace, ,

ESE 531: Digital Signal Processing

Automatic Speech Recognition (CS753)

Lecture 5. The Digital Fourier Transform. (Based, in part, on The Scientist and Engineer's Guide to Digital Signal Processing by Steven Smith)

Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding

Sinc Functions. Continuous-Time Rectangular Pulse

6.003 Signal Processing

TTT4120 Digital Signal Processing Suggested Solutions for Problem Set 2

ECE 301 Fall 2011 Division 1 Homework 10 Solutions. { 1, for 0.5 t 0.5 x(t) = 0, for 0.5 < t 1

EEL3135: Homework #3 Solutions

Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding

! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals

E2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2)

X. Chen More on Sampling

NAME: 11 December 2013 Digital Signal Processing I Final Exam Fall Cover Sheet

DFT and Matlab with some examples.

Discrete-Time Fourier Transform (DTFT)

Experimental Fourier Transforms

EDISP (NWL2) (English) Digital Signal Processing Transform, FT, DFT. March 11, 2015

/ (2π) X(e jω ) dω. 4. An 8 point sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute 8 point DFT of x(n) by

Chapter 6: Applications of Fourier Representation Houshou Chen

Linear Prediction 1 / 41

ECE 413 Digital Signal Processing Midterm Exam, Spring Instructions:

Assignment 2. Signal Processing and Speech Communication Lab. Graz University of Technology

Overview of Sampling Topics

The Fourier Transform (and more )

Information and Communications Security: Encryption and Information Hiding

Circuits and Systems I

Chap 2. Discrete-Time Signals and Systems

Digital Signal Processing Lecture 9 - Design of Digital Filters - FIR

OLA and FBS Duality Review

J. McNames Portland State University ECE 223 Sampling Ver

Digital Signal Processing, Lecture 2 Frequency description continued, DFT

CMPT 889: Lecture 5 Filters

CE 513: STATISTICAL METHODS

ECE-700 Review. Phil Schniter. January 5, x c (t)e jωt dt, x[n]z n, Denoting a transform pair by x[n] X(z), some useful properties are

L29: Fourier analysis

Digital Filters. Linearity and Time Invariance. Linear Time-Invariant (LTI) Filters: CMPT 889: Lecture 5 Filters

Transcription:

Fourier Analysis of Signals Using the DFT ECE 535 Lecture April 29, 23 Overview: Motivation Many applications require analyzing the frequency content of signals Speech processing study resonances of vocal tract Radar Doppler processing Sonar study channel effects on long-range transmissions Basic spectral analyzer setup Windowing Frequency-sampling Relating DFT output to CT spectrum Examples Time-dependent Fourier transform

Basic spectral analyzer s c (t) Anti-Alias C/D x c (t) Filter (or A/D) x[n] v[n] Conversion N-point DFT V [k] w[n] Anti-alias filtering and A/D conversion for tonight assume negligible errors Windowing operation Necessary because DFT only works on finite-length sequences. Typically use same windows as for filter design Frequency-sampling Use FFT to compute samples of the DTFT Understanding windowing & frequency-sampling crucial to interpreting results

Windowing and frequency-sampling What does the windowing operation do? v[n] = w[n] x[n] +π F V (e jω ) = 1 X(e jθ )W (e j(ω θ) )dθ 2π π }{{} convolution of X(e jω ) with W (e jω ) Convolution with window function smears the spectrum of x[n] Smoothes sharp peaks and discontinuities What is the output of the N-point DFT operation? V [k] = N 1 n= 2πkn j v[n]e N k =,..., N 1 = V (e jω ) ω= 2πk N DFT is samples of the DTFT evenly spaced around the unit circle

Relating DFT output to the CT spectrum Suppose x c (t) is sampled at a rate of f s = 1 T. What CT frequencies correspond to the N DFT samples? Recall relationship between DT and CT frequencies: ω = ΩT Thus the CT frequency associated with the kth bin is: Ω k = ω k T = 2πk NT = 2πkf s N Using this relationship, we create a vector of analog frequencies to plot the spectrum with Consider analyzing a signal consisting of 2 sinusoids

Two sinusoid example Consider s c (t) equal to the sum of 2 sinusoids: (sinusoid = sum of 2 eigenfxns) The sampled signal x[n] becomes: s c (t) = A cos(ω t) + A 1 cos(ω 1 t) x[n] = A cos(ω n) + A 1 cos(ω 1 n) ω = Ω T ω 1 = Ω 1 T The windowed signal v[n] is: v[n] = A w[n] cos(ω n) + A 1 w[n] cos(ω 1 n) = A 2 w[n] ( e jω n + e jω n ) + A 1 2 w[n] ( e jω 1n + e jω 1n ) Taking the DTFT: V (e jω ) = A { } W (e j(ω ω) ) + W (e jω+ω ) + A { } 1 W (e j(ω ω1) ) + W (e jω+ω 1 ) } 2 {{ 2 } copies of W (e jω ) at ±ω, ±ω 1

Two effects of the window Resolution controlled by mainlobe width high resolution requires narrow ML Leakage controlled by sidelobe height energy at ω leaks out and can mask lower power signal at ω 1 What controls mainlobe width? length of window primary factor type of window secondary factor e.g., Hanning has wider ML than boxcar What controls sidelobe height? type of window see table in Ch. 7 Consider example

Example (compare to 1.3 in text) 6 4 2 W(e jω ) 3 2 1 V(e jω ) π π 64-point rectangular window Mainlobe width 4π 64 π π v[n] = A cos(ω n) + A 1 cos(ω 1 n) A = 1, A 1 =.75 ω = 2π 6, ω 1 = 2π 3 copies of W (e jω ) at ± 2π 6, ±2π 3

Example 1.3 continued V(e jω ) V(e jω ) 3 3 2 2 1 1 π π A = 1, A 1 =.75 ω = 2π 14, ω 1 = 4π 15 π π A = 1, A 1 =.75 ω = 2π 14, ω 1 = 2π 12 As sinusoids move closer together, leakage causes change in amplitudes

Example 1.3 continued V(e jω ) 3 2 1 Sinusoids not resolved when they move close enough Mainlobe width 4π 64 =.625π ω 1 ω =.171π π π A = 1, A 1 =.75 ω = 2π 14, ω 1 = 4π 25 Consider Matlab demo

Matlab demo: windowsine demo1 Parameters: Sampling frequency: f s = 1 Hz Window length: 1 points 1 second of data DFT length: 8192 points (lots of samples!) x c (t) consists of the sum of two sinewaves a 5 Hz sinewave a sinewave of varying frequency: 1 Hz (1st case) to 5 Hz (last case) See what happens to spectral plot

Spectral sampling Consider a 64-point section of v[n] = A cos(ω n) + A 1 cos(ω 1 n) where A = 1, A 1 =.75 ω = 2π 14, ω 1 = 4π 25 3 V[k] 3 V(e jω ) 2 2 1 1 2 4 6 Results of 64-point DFT π 2.π DTFT (shown between and 2π) DFT is samples of the DTFT

Spectral sampling can be misleading! Consider a 64-point section of v[n] = A cos(ω n) + A 1 cos(ω 1 n) where A = 1, A 1 =.75, ω = 2π 16, ω 1 = 2π 8 3 V[k] 3 V(e jω ) 2 2 1 1 2 4 6 Results of 64-point DFT Samples at zero-crossings of DTFT π 2.π DTFT (shown between and 2π) We can zero-pad v[n] and take a larger FFT to get more samples

Zero-padding V[k] 3 2 1 5 1 Results of padding v[n] with 64 zeros and taking 128-pt DFT Samples no longer at zerocrossings of DTFT Clean look of 64-point DFT was a bit of an illusion because samples occured at zero-crossings of spectrum Can zero-padding improve resolution? Consider Matlab demo

Zero-padding Matlab demo: windowsine demo2 Parameters: x c (t) consists of the sum of two sinewaves a 5 Hz sinewave a 5.5 Hz sinewave Sampling frequency: f s = 1 Hz Window length: 1 points 1 second of data DFT length varies from 128 to 32768 See what happens to spectral plot

Why aren t the sinusoids resolved in windowsine demo2? Window: 1 point rectangular window Mainlobe width: ω ML = 4π 1 Ω ML = 4π 1 f s = 4π 1 1 = 4π Thus the mainlobe width corresponds to approximately 2 Hz Since the sinewaves are.5 Hz apart, they won t be resolved Better resolution requires longer window (more data!) Consider third Matlab demo

Matlab demo: windowsine demo3 This demo illustrates how increasing the window length improves resolution Parameters: x c (t) consists of the sum of two sinewaves a 5 Hz sinewave a 5.5 Hz sinewave Sampling frequency: f s = 1 Hz DFT length: 8192 points (lots of samples!) Window length varies from 1 to 1 in increments of 25 See what happens to spectral plot