OLA and FBS Duality Review

Similar documents
OLA and FBS Duality Review

L6: Short-time Fourier analysis and synthesis

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

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

ELEG 305: Digital Signal Processing

Discrete Fourier transform (DFT)

1. Calculation of the DFT

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

6.003: Signal Processing

EE-210. Signals and Systems Homework 7 Solutions

Lecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev.

Lecture 10, Multirate Signal Processing Transforms as Filter Banks. Equivalent Analysis Filters of a DFT

Discrete Fourier Transform

Chapter 8 The Discrete Fourier Transform

Flash File. Module 3 : Sampling and Reconstruction Lecture 28 : Discrete time Fourier transform and its Properties. Objectives: Scope of this Lecture:

Digital Signal Processing. Midterm 2 Solutions

Lecture 19: Discrete Fourier Series

8 The Discrete Fourier Transform (DFT)

MAHALAKSHMI ENGINEERING COLLEGE-TRICHY

DISCRETE FOURIER TRANSFORM

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

Signals and Systems Spring 2004 Lecture #9

EEO 401 Digital Signal Processing Prof. Mark Fowler

Fall 2011, EE123 Digital Signal Processing

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

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

ESE 531: Digital Signal Processing

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

EE 225D LECTURE ON DIGITAL FILTERS. University of California Berkeley

Chirp Transform for FFT

Transforms and Orthogonal Bases

Cylinder with Conical Cap

Filter Banks II. Prof. Dr.-Ing. G. Schuller. Fraunhofer IDMT & Ilmenau University of Technology Ilmenau, Germany

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

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

6.003 Signal Processing

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

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

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

Fourier Analysis of Signals Using the DFT

6.003 Signal Processing

EE123 Digital Signal Processing

The Discrete Fourier Transform

DFT-Based FIR Filtering. See Porat s Book: 4.7, 5.6

Review of Discrete-Time System

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

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

Design Criteria for the Quadratically Interpolated FFT Method (I): Bias due to Interpolation

Lecture 14: Windowing

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

Discrete Time Fourier Transform (DTFT)

VU Signal and Image Processing. Torsten Möller + Hrvoje Bogunović + Raphael Sahann

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

ELEN 4810 Midterm Exam

Automatic Speech Recognition (CS753)

Discrete Fourier Transform

Chapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum

E : Lecture 1 Introduction

An Introduction to Filterbank Frames

Digital Signal Processing. Midterm 1 Solution

HW13 Solutions. Pr (a) The DTFT of c[n] is. C(e jω ) = 0.5 m e jωm e jω + 1

Fourier Analysis and Spectral Representation of Signals

Discrete-time Signals and Systems in

Digital Signal Processing. Lecture Notes and Exam Questions DRAFT

Voiced Speech. Unvoiced Speech

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

Module 3. Convolution. Aim

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

Lecture Notes on Fundamentals of Audio-Video Signal Processing

ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin

Lecture 13: Discrete Time Fourier Transform (DTFT)

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science Discrete-Time Signal Processing Fall 2005

Discrete-Time Fourier Transform (DTFT)

Computer Engineering 4TL4: Digital Signal Processing

Timbral, Scale, Pitch modifications

Lecture 4: FT Pairs, Random Signals and z-transform

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

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

Digital Signal Processing I Final Exam Fall 2008 ECE Dec Cover Sheet

How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches

Interchange of Filtering and Downsampling/Upsampling

Filter Banks II. Prof. Dr.-Ing Gerald Schuller. Fraunhofer IDMT & Ilmenau Technical University Ilmenau, Germany

7.16 Discrete Fourier Transform

EE123 Digital Signal Processing

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

SIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals

Digital Signal Processing

SC434L_DVCC-Tutorial 6 Subband Video Coding

EE123 Digital Signal Processing

Multirate Digital Signal Processing

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

Discrete Time Fourier Transform

1 1.27z z 2. 1 z H 2

AN EFFICIENT MULTI-RESOLUTION SPECTRAL TRANSFORM FOR MUSIC ANALYSIS

Discrete-time Fourier Series (DTFS)

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

VII. Discrete Fourier Transform (DFT) Chapter-8. A. Modulo Arithmetic. (n) N is n modulo N, n is an integer variable.

! Review: Discrete Fourier Transform (DFT) ! DFT Properties. " Duality. " Circular Shift. ! Circular Convolution. ! Fast Convolution Methods

LTI H. the system H when xn [ ] is the input.

Review of Fundamentals of Digital Signal Processing

Transcription:

MUS421/EE367B Lecture 10A Review of OverLap-Add (OLA) and Filter-Bank Summation (FBS) Interpretations of Short-Time Fourier Analysis, Modification, and Resynthesis Julius O. Smith III (jos@ccrma.stanford.edu) Center for Computer Research in Music and Acoustics (CCRMA) Department of Music, Stanford University Stanford, California 94305 March 24, 2014 1

OLA and FBS Duality Review We now review Filter Bank Summation (FBS) and OverLap Add (OLA), stressing their Fourier duality. For simplicity, R will be taken as 1. Remember that in OLA, R is the hop size, or the distance (in time samples) between successive overlap-add frames. In FBS, R is interpreted as a downsampling factor. The common starting point for both OLA and FBS is the STFT: m (ω k ) = x(n)w(n m)e jω kn n= The point of departure is the interpretation of the above summation. 2

STFT Analysis OLA m (ω k ) = Sample 2π/N (DTFT(x m )) = [x(n)w(n m)]e jω kn = n= n= = F k {x m (n)} x m (n)e jω kn where x m (n) is the m th windowed frame of x. Hence we have the following interpretation: 3

For each frame: Window the signal Take the Fourier Transform x(n) w 0 w 1 w M 1 Windowing DFT n (ω 0 ) n (ω 1 ) n (ω N 1 ) STFT 4

FBS m (ω k ) = [x(n)e jωkn ]w(n m) = n= n= = (x k w)(m) x k (n) w(m n) where x k is x modulated by e jωkn, and w =. Hence we have the following interpretation: For each analysis frequency: Heterodyne signal by e jω kn Filter with w 5

FBS Analysis Filter Bank n (ω 0 ) e jω 0n x(n) n (ω 1 ) e jω 1n n (ω N 1 ) e jω N 1n STFT 6

STFT Re-Synthesis OLA To resynthesize the signal: Inverse Transform Overlap and add shifted frames x = m= Shift mr (DFT 1 (Sample2π N,ω k (DTFT( m H)))) COLA constraint: m= w(n mr) = c, where c is any constant W(ω l ) = 0, l = 1,2,...,R 1, ω l = 2πl/R, i.e., Window transform is 0 at all harmonics of the frame rate 7

OLA Analysis and Synthesis x(n) w 0 w 1 w M 1 Windowing DFT n (ω 0 ) n (ω 1 ) n (ω N 1 ) STFT IDFT Overlap Add Buffer 8

Filter-Bank Summation (FBS) To resynthesize the signal: Heterodyne each subband (shift in frequency) Sum Window constraint: x(m) = N 1 k=0 m (ω k )e jω km w(rn) = 0, r = 1,2,... This is equivalent to a constant overlap constraint in frequency (dual of Poisson summation formula) The filterbank summation performs an overlap add in frequency. 9

n (ω 0 ) x(n) e jω 0n n (ω 1 ) e jω 0n + e jω 1n e jω 1n n (ω N 1 ) e jω N 1n e jω N 1n STFT Unmodified FBS is COLA in the frequency domain, Nyquist(N) in the time domain Unmodified OLA is COLA in the time domain, Nyquist(2πL/M) in the frequency domain 10

STFT Fixed Spectral Modification OLA Perform multiplicative spectral modification before resynthesis Must zero pad in time, and window must meet COLA constraint Results in the convolution of the signal and the impulse response of the filter x(n) w 0 w 1 w M 1 Windowing DFT n (ω 0 ) n (ω 1 ) n (ω N 1 ) H 0 H 1 H M 1 Y n (ω 0 ) Y n (ω 1 ) Y n (ω N 1 ) IDFT STFT Spectral Modification Modified Spectrum Overlap Add Buffer 11

FBS Perform multiplicative spectral modification before resynthesis Results in convolution of the signal and the windowed impulse response of the filter n (ω 0 ) e jω 0n H 0 e jω 0n x(n) n (ω 1 ) + e jω 1n H 1 e jω 1n n (ω N 1 ) e jω N 1n H(N-1) e jω N 1n STFT Modification 12

STFT Time Varying Spectral Modification OLA Perform time varying multiplicative spectral modification before resynthesis Must zero pad, and window must meet COLA constraints Results in the convolution of the signal and a window-filtered version of the time varying impulse response (no length limit) 13

x(n) w 0 w 1 w M 1 Windowing n (ω 0 ) n (ω 1 ) H n (0) H n (1) H n (N 1) Y n (ω 0 ) Y n (ω 1 ) DFT IDFT mn- YmN- STFT Time Varying Modification Modified Spectrum Overlap Add Buffer FBS Perform multiplicative time varying spectral modification before resynthesis Results in convolution of the signal and the windowed time varying impulse response of the filter Spectral changes occur immediately Discontinuities likely in time domain when filter changes 14

OLA more practical for time-varying filter implementation n (ω 0 ) e jω 0n H n (0) e jω 0n x(n) n (ω 1 ) + e jω 1n H n (1) e jω 1n n (ω N 1 ) e jω N 1n H n (N 1) e jω N 1n STFT Time Varying Modification 15