EE123 Digital Signal Processing

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

EE123 Digital Signal Processing

EE123 Digital Signal Processing

Spring 2014, EE123 Digital Signal Processing

Chirp Transform for FFT

1. Calculation of the DFT

EE123 Digital Signal Processing

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

Continuous Fourier transform of a Gaussian Function

Discrete Fourier Transform

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

Fall 2011, EE123 Digital Signal Processing

EE123 Digital Signal Processing

EE123 Digital Signal Processing

EE123 Digital Signal Processing

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

L6: Short-time Fourier analysis and synthesis

ELEG 305: Digital Signal Processing

EE123 Digital Signal Processing

Ch. 15 Wavelet-Based Compression

E : Lecture 1 Introduction

6.003: Signal Processing

Fourier Analysis of Signals Using the DFT

Frequency Domain Speech Analysis

EE482: Digital Signal Processing Applications

ESE 531: Digital Signal Processing

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

Digital Signal Processing. Midterm 1 Solution

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

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

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!

Digital Speech Processing Lecture 10. Short-Time Fourier Analysis Methods - Filter Bank Design

Automatic Speech Recognition (CS753)

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

Course Name: Digital Signal Processing Course Code: EE 605A Credit: 3

UNIVERSITY OF OSLO. Faculty of mathematics and natural sciences. Forslag til fasit, versjon-01: Problem 1 Signals and systems.

Introduction to Biomedical Engineering

Order Tracking Analysis

ECE 413 Digital Signal Processing Midterm Exam, Spring Instructions:

EE 224 Signals and Systems I Review 1/10

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

Computer Engineering 4TL4: Digital Signal Processing

EEO 401 Digital Signal Processing Prof. Mark Fowler

SPECTRUM. Deterministic Signals with Finite Energy (l 2 ) Deterministic Signals with Infinite Energy N 1. n=0. N N X N(f) 2

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

Multirate Digital Signal Processing

EE123 Digital Signal Processing

BME 50500: Image and Signal Processing in Biomedicine. Lecture 5: Correlation and Power-Spectrum CCNY

EE-210. Signals and Systems Homework 7 Solutions

Exercises in Digital Signal Processing

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

R13 SET - 1

Chapter 8 The Discrete Fourier Transform

Radar Systems Engineering Lecture 3 Review of Signals, Systems and Digital Signal Processing

Signals and Systems. Lecture 14 DR TANIA STATHAKI READER (ASSOCIATE PROFESSOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE LONDON

HST.582J / 6.555J / J Biomedical Signal and Image Processing Spring 2007

ELEG 3124 SYSTEMS AND SIGNALS Ch. 5 Fourier Transform

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

Multiresolution Analysis

L29: Fourier analysis

ANALOG AND DIGITAL SIGNAL PROCESSING ADSP - Chapter 8

ECGR4124 Digital Signal Processing Midterm Spring 2010

Lecture 22: Reconstruction and Admissibility

The Z-Transform. Fall 2012, EE123 Digital Signal Processing. Eigen Functions of LTI System. Eigen Functions of LTI System

The Discrete Fourier Transform

Introduction to Sparsity in Signal Processing

IT DIGITAL SIGNAL PROCESSING (2013 regulation) UNIT-1 SIGNALS AND SYSTEMS PART-A

Chapter 2: Problem Solutions

MAHALAKSHMI ENGINEERING COLLEGE-TRICHY

Elec4621 Advanced Digital Signal Processing Chapter 11: Time-Frequency Analysis

Speech Signal Representations

6.003 Signal Processing

Lecture 14: Windowing

Introduction to time-frequency analysis Centre for Doctoral Training in Healthcare Innovation

Introduction to Sparsity in Signal Processing

6.003 Signal Processing

Lecture 19: Discrete Fourier Series

Gaussian Processes for Audio Feature Extraction

EE123 Digital Signal Processing

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

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

/ (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

OLA and FBS Duality Review

EEL3135: Homework #3 Solutions

ENSC327 Communications Systems 2: Fourier Representations. Jie Liang School of Engineering Science Simon Fraser University

DFT & Fast Fourier Transform PART-A. 7. Calculate the number of multiplications needed in the calculation of DFT and FFT with 64 point sequence.

Distortion Analysis T

EE123 Digital Signal Processing

Digital Signal Processing. Midterm 2 Solutions

Random signals II. ÚPGM FIT VUT Brno,

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

EE538 Digital Signal Processing I Session 13 Exam 1 Live: Wed., Sept. 18, Cover Sheet

1 1.27z z 2. 1 z H 2

ECGR4124 Digital Signal Processing Final Spring 2009

Voiced Speech. Unvoiced Speech

Audio Features. Fourier Transform. Fourier Transform. Fourier Transform. Short Time Fourier Transform. Fourier Transform.

Signals, Instruments, and Systems W5. Introduction to Signal Processing Sampling, Reconstruction, and Filters

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

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

EE123 Digital Signal Processing

Transcription:

EE123 Digital Signal Processing Lecture 1 Time-Dependent FT

Announcements! Midterm: 2/22/216 Open everything... but cheat sheet recommended instead 1am-12pm How s the lab going?

Frequency Analysis with DFT Length of window determines spectral resolution Type of window determines side-lobe amplitude. (Some windows have better tradeo between resolution-sidelobe) Zero-padding approximates the DTFT better. Does not introduce new information! Miki Lustig UCB. Based on Course Notes by J.M Kahn Spring 214, EE123 Digital Signal Processing

Potential Problems and Solutions Potential Problems and Solutions Problem Possible Solutions 1. Spectral error a. Filter signal to reduce frequency content above s /2= /T. from aliasing Ch.4 b. Increase sampling frequency s =2 /T. 2. Insu cient frequency a. Increase L resolution. b. Use window having narrow main lobe. 3. Spectral error a. Use window having low side lobes. from leakage b. Increase L 4. Missing features a. Increase L, due to spectral sampling. b. Increase N by zero-padding v[n] to length N > L. Miki Lustig UCB. Based on Course Notes by J.M Kahn Spring 214, EE123 Digital Signal Processing

Subtleties in filtering/processing with DFT x[n] H(e j! ) y[n] System is implemented by overlap-and-save Filtering using DFT H[k] π 2π

Subtleties in filtering/processing with DFT H[k] h[n] π 2π H(e jw ) -π π

Last Time Frequency Analysis with DFT Windowing Zero-Padding Today: Time-Dependent Fourier Transform Heisenberg Boxes

Discrete Transforms (Finite) DFT is only one out of a LARGE class of transforms Used for: Analysis Compression Denoising Detection Recognition Approximation (Sparse) Sparse representation has been one of the hottest research topics in the last 15 years in sp

Example of spectral analysis Spectrum of a bird chirping Interesting,... but... Does not tell the whole story No temporal information! x[n] n 6 Spectrum of a bird chirp 5 4 3 2 1.5 1 1.5 2 2.5 Hz x 1 4

Time Dependent Fourier Transform To get temporal information, use part of the signal around every time point X[n,!) = 1X m= 1 x[n + m]w[m]e j!m *Also called Short-time Fourier Transform (STFT) Mapping from 1D 2D, n discrete, w cont. Simply slide a window and compute DTFT

Time Dependent Fourier Transform To get temporal information, use part of the signal around every time point X[n,!) = 1X m= 1 x[n + m]w[m]e j!m *Also called Short-time Fourier Transform (STFT)

Spectrogram 12 1 8 6 4 2 5 1 15 2 25 3 35 4 45 Frequency, Hz 3 25 2 15 1 5 5 1 15 2 25 3 35 4 45 Frequency, Hz 4 Frequency, Hz 3 2 1 2 4 6 8 1 12 14 16 18 Time, s

Discrete Time Dependent FT X r [k] = LX 1 m= L - Window length R - Jump of samples N - DFT length x[rr + m]w[m]e j2 km/n Tradeoff between time and frequency resolution

Heisenberg Boxes Time-Frequency uncertainty principle 1 t! 2! t http://www.jonasclaesson.com! t

DFT! = 2 N t = N X[k] =! NX 1 n= x[n]e j2 kn/n! t =2 one DFT coefficient t

DFT! = 2 N t = N X[k] =! NX 1 n= x[n]e j2 kn/n! t =2 Question: What is the effect of zero-padding? Answer: Overlapped Tiling! t

Discrete STFT X[r, k] = LX 1 m= optional x[rr + m]w[m]e j2 km/n!! = 2 L t = L one STFT coefficient t

Discrete STFT X[r, k] = LX 1 m= optional x[rr + m]w[m]e j2 km/n!! = 2 L t = L Question: What is the effect of R on tiling? what effect of N? Answer: Overlapping in time of frequency or both! t

Applications Time Frequency Analysis Spectrogram of Orca whale 4 Frequency, Hz 3 2 1 1 2 3 4 5 6 7 8 Time, s

Spectrogram Frequency, Hz 4 3 2 1 (A) Frequency, Hz 4 3 2 1 2 4 6 8 1 12 14 16 18 Time, s (B) 2 4 6 8 1 12 14 16 18 Time, s What is the difference between the spectrograms? a) Window size B<A c) Window type is different b) Window size B>A d) (A) uses overlapping window

Sidelobes of Hann vs rectangular window DTFT of Hamming Window 4 DTFT of Rectangular Window 2 35 3 15 25 W(e j T ) 1 W(e j T ) 2 15 5 1 5-2 -1 1 2 /2 (Hz) -2-1 1 2 /2 (Hz)

Spectrogram Frequency, Hz 4 3 2 1 (A) Frequency, Hz 4 3 2 1 2 4 6 8 1 12 14 16 18 Time, s (B) 2 4 6 8 1 12 14 16 18 Time, s What is the difference between the spectrograms? a) Window size B<A c) Window type is different b) Window size B>A d) (A) uses overlapping window

Spectrogram Hamming Window, L = 32 Hamming Window, L = 32 DTFT of Hamming Window 1.2 2 1.8 15 w[n].6 W(e j T ) 1.4.2 5 5 1 15 2 25 3 n Hamming Window, L = 64-2 -1 1 2 /2 (Hz) Hamming Window, L = 64 DTFT of Hamming Window 1.2 4 1 35 w[n].8.6.4.2 W(e j T ) 3 25 2 15 1 5 1 2 3 4 5 6 n -2-1 1 2 /2 (Hz)

Spectrogram of FM y c (t) =A cos 2 f c t +2 y[n] =y(nt )=A exp j2 f f Z t x( )d Z nt x( )d! 88.6 Spectrogram of FM radio 88.5 88.4 t= t=2sec

Spectrogram of FM radio Baseband y[n] =y(nt )=A exp j2 f Z nt x( )d! x(t) =(L + R) {z } mono {z } {z } {z } {z +.1 cos(2 f p t) {z } pilot +(L R) cos(2 (2f p )t) {z } stereo +.5 RBDS(t) cos(2 (3f p )t). {z } digital RBDS Spectrogram of Demodulated FM radio (Adele on 96.5 MHz) 57KHz 38KHz 19KHz

Subcarrier FM radio (Hidden Radio Stations)

Applications Time Frequency Analysis Spectrogram of digital communications - Frequency Shift Keying t= t=1sec

STFT Reconstruction x[rr + m]w L [m] = 1 N NX 1 k= X[n, k]e j2 km/n For non-overlapping windows, R=L : x[n] = x[n rl] w L [n rl] rl apple n apple (r + 1)R 1 What is the problem?

STFT Reconstruction x[rr + m]w L [m] = 1 N NX 1 k= X[n, k]e j2 km/n For non-overlapping windows, R=L : x[n] = x[n rl] w L [n rl] rl apple n apple (r + 1)R 1 For stable reconstruction must overlap window 5% (at least)

STFT Reconstruction For stable reconstruction must overlap window 5% (at least) For Hann, Bartlett reconstruct with overlap and add. No division!

Applications Noise removal Recall bird chirp x[n] n 6 Spectrum of a bird chirp 5 4 3 2 1.5 1 1.5 2 2.5 Hz x 1 4

Application Denoising of Sparse spectrograms 4 Frequency, Hz 3 2 1 2 4 6 8 1 12 14 16 18 Time, s Spectrum is sparse! can implement adaptive filter, or just threshold!

Limitations of Discrete STFT Need overlapping Not orthogonal Computationally intensive O(MN log N) Same size Heisenberg boxes

From STFT to Wavelets Basic Idea: low-freq changes slowly - fast tracking unimportant Fast tracking of high-freq is important in many apps. Must adapt Heisenberg box to frequency Back to continuous time for a bit...