convenient means to determine response to a sum of clear evidence of signal properties that are obscured in the original signal
|
|
- Bruno Lloyd
- 5 years ago
- Views:
Transcription
1 Digital Speech Processing Lecture 9 Short-Time Fourier Analysis Methods- Introduction 1
2 General Discrete-Time Model of Speech Production Voiced Speech: A V P(z)G(z)V(z)R(z) Unvoiced Speech: A N N(z)V(z)R(z) 2
3 Short-Time Fourier Analysis represent signal by sum of sinusoids or complex exponentials as it leads to convenient solutions to problems (formant estimation, pitch period estimation, analysis-by-synthesis methods), and insight into the signal itself such Fourier representations provide convenient means to determine response to a sum of sinusoids for linear systems clear evidence of signal properties that are obscured in the original signal 3
4 Why STFT for Speech Signals steady state sounds, like vowels, are produced by periodic excitation of a linear system => speech spectrum is the product of the excitation spectrum and the vocal tract frequency response speech is a time-varying signal => need more sophisticated analysis to reflect time varying properties changes occur at syllabic rates (~10 times/sec) over fixed time intervals of msec, properties of most speech signals are relatively constant (when is this not the case) 4
5 Overview of Lecture define time-varying Fourier transform (STFT) analysis method define synthesis method from time-varying FT (filter-bank summation, overlap addition) show how time-varying FT can be viewed in terms of a bank of filters model computation methods based on using FFT application to vocoders, spectrum displays, format estimation, pitch period estimation 5
6 Frequency Domain Processing Coding: transform, subband, homomorphic, channel vocoders Restoration/Enhancement/Modification: noise and reverberation removal, helium restoration, time-scale modifications (speed-up and slow-down of speech) 6
7 Frequency and the DTFT sinusoids 0 xn n e e jω0n jω0n ( ) = cos( ω ) = ( + )/ 0 where ω is the frequency (in radians) of the sinusoid the Discrete-Time Fourier Transform ( DTFT ) jω ω j n Xe ( ) = xne ( ) = x (n) n n= π 2 DTFT { } 1 j ω j ω n -1 ω ω DTFT { j } xn ( ) = Xe ( ) e d = Xe ( ) 2π π jω where ω is the frequency variable of Xe ( ) 7
8 DTFT and DFT of Speech i The DTFT and the DFT for the infinite duration signal could be calculated (the DTFT) and approximated (the DFT) by the following: jω jωm X ( e ) = x ( m ) e ( DTFT ) m= N 1 Xk ( ) = xmwme ( ) ( ) = m=00 i using a value of ω= (2 πk / N) j(2 π / N) km jω Xe ( ) ( DFT), k = 0,1,..., N 1 N=25000 we get the following plot 8
9 25000-Point DFT of Speech 9 Log Magnitude (db) Magnitude
10 Short-Time Fourier Transform (STFT) 10
11 Short-Time Fourier Transform speech is not a stationary signal, i.e., it has properties that change with time thus a single representation based on all the samples of a speech utterance, for the most part, has no meaning instead, we define a time-dependent Fourier transform (TDFT or STFT) of speech that changes periodically as the speech properties change over time 11
12 Definition of STFT j ˆ ω nˆ = ˆ ˆ ω ˆ ˆ m= X ( e ) x ( m ) w ( n m ) e both n and ω are variables wn ( ˆ m) is a real window which determines the portion of xn ( ˆ) j ˆ ω that is used in the computation of Xn ˆ ( e ) 12
13 Short Time Fourier Transform STFT is a function of two variables, the time index, n, which is discrete, and the frequency variable, ω, which is continuous ˆ ˆ ( ω n ) = ( ) ( ˆ ) ˆ ω m= X e x m w n m e = DTFT ( xmwn ( ) ( ˆ m)) nˆ fixed, ˆ ω variable 13
14 Short-Time Fourier Transform alternative form of STFT (based on change of variables) is nˆ j ˆ ω j ˆ( ω n ˆ m ) X ( e ) = w( m) x( nˆ m) e if we define m= j ˆ ωnˆ j ˆ ωm = e x( nˆ m) w( m) e m= ˆ ˆ ( ω n ) = ( ˆ ) ( ) j ˆ ω m= j Xn ˆ e ˆ ω j ˆ ω j ˆ ωnˆ nˆ n j ˆ ω j ˆ ωnˆ X e x n m w m e then ( ) can be expressed as (using m = m) X ( e ) = e X ( e ) = e DTFT x( nˆ + m) w( m) 14
15 STFT-Different Time Origins the STFT can be viewed as having two different time origins 1. time origin tied to signal xn ( ) ˆ ω nˆ( ) = ( ) ( ˆ ) ˆ ω m= X e x m w n m e = DTFT xmwn ( ) ( ˆ m), nˆ fixed, ˆ ω variable 2. timeoriginti ed to window signal w ( m ) nˆ j ˆ ω j ˆ ω n ˆ j ˆ ω m X ( e ) = e x( nˆ + m) w( m) e m= j ˆ ωnˆ ˆ ω = j e X( e ) j ˆ ωnˆ = e DTFT w( m) x( nˆ + m), nˆ fixed, ˆ ω variable 15
16 Time Origin for STFT m= nˆ x[0] Time origin tied to window w[ m] x[ nˆ + m] 16
17 Interpretations of STFT j ˆ ω there are 2 distinct interpretations of Xn ˆ ( e ) j ˆ ω 1. assume nˆ is fixed, then X ( e ) is simply the normal Fourier j ˆ ω fixed n, Xnˆ ( e ) has the nˆ transform of the sequence wn ( ˆ mxm ) ( ), < m< => for transform nˆ X e same properties as a normal Fourier X e nˆ j ˆ ω 2. consider nˆ ( ) as a function of the time index with fixed. Then X ( e ) is in the form of a convolution of the signal x( nˆ ) e nˆ with the window j ˆ ω j ˆ ωnˆ wn ( ˆ). This leads to an interpretation in the form of ˆ ˆ ˆ linear filtering of the frequency modulated signal ( ) j ωn xne by wn ( ˆ ). ˆ ω - we will now consider each of these interpretations of the STFT in a lot more detail 17
18 Fourier Transform Interpretation j ˆ ω consider Xn ˆ ( e ) as the normal Fourier transform of the sequence wn ( ˆ mxm ) ( ), < m< for fixed nˆ. the window wn ( ˆ m) slides along the sequence xm ( ) and defines a new STFT for every value of nˆ what are the conditions for the existence of the STFT the sequence wn ( ˆ mxm ) ( ) must be absolutely summable for all values of nˆ - since xn ( ˆ) L(32767 for 16-bit sampling) - since wn ( ˆ) 1 (normalized window levels) - since window duration is usually finite wn ( ˆ mxm ) ( ) is absolutely summable for all nˆ 18
19 Frequencies for STFT the STFT is periodic in ω with period 2 π, i.e., j ˆ ω j ( ˆ ω+ 2πk X ) nˆ( e ) = Xn ˆ( e ), k can use any of several frequency variables to express STFT, including ˆ ω =ΩT ˆ (where T is the sampling period for x( m)) to represent nˆ ˆ ω = 2πfˆ or ˆ ω = 2πFT ˆ to represent normalized frequency (0 fˆ 1) or analog frequency (0 Fˆ F = / T), giving X ( e ) or X ( e ) jωˆ T analog radian frequency, giving X ( e ) j 2π fˆ j 2π Fˆ T s 1 nˆ nˆ 19
20 Signal Recovery from STFT j ˆ ω since for a given value of nx ˆ, nˆ ( e ) has the same properties as a normal Fourier transform, we can recover the input sequence exactly j ˆ ω since Xn ˆ ( e ) is the normal Fourier transform of the windowed sequence wn ( ˆ mxm ) ( ), then 1 j ˆ ω j ˆ ωm wn ( ˆ mxm ) ( ) = ˆ ( ) ˆ ω 2 Xn e e d π π π assuming the window satisfies the property that w( 0) 0 ( a trivial requirement), then by evaluating the inverse Fourier transform when m = nˆ, we obtain π 1 j ˆ ω jωnˆ xn ( ˆ) = ˆ ( ) ˆ ω 2π 0 Xn e e d w( ) π 20
21 Signal Recovery from STFT π 1 j ˆ ω jωnˆ xn ( ˆ) = ˆ ( ) ˆ ω 2π ( 0) Xn e e d w π with the requirement that w( 0) 0, the sequence x ( nˆ ) j ˆ ω j ˆ ω can be recovered exactly from Xn ˆ( e ), if Xn ˆ( e ) is known for all values of ˆ ω over one complete period - sample-by-sample recovery process j ˆ ω - Xnˆ ( e ) must be known for every value of n and for all i can also recover sequence wn ( ˆ mxm ) ( ) but can't guarantee that xm ( ) can be recovered since w( nˆ m) can equal 0 ˆ ˆ ω 21
22 Properties of STFT X ( e ) [ w( n m) x( m)] n fixed, ω variable relation to short-time power density function S ( e ) = X ( e ) = X ( e ) X ( e ) = DTFT R ( k) nˆ fixed j ˆ ω ˆ ˆ ˆ = ˆ n DTFT j ˆ ω j ˆ ω 2 j ˆ ω j ˆ ω nˆ nˆ nˆ nˆ nˆ nˆ [ ] R ( k) = w( nˆ m) x( m) w( nˆ m k) x( m+ k) S m= j ˆ ω Relation to regular Xe ( ) (assuming it exists) ( j ˆ ω ) = DTFT [ ( )] = ( ) j ˆ ωm m= π j ˆ ω 1 jθ j ( ˆ ω θ ) jθnˆ nˆ ( ) = ( ) ( ) 2π π Xe xm xme X e W e X e e dθ ˆ wn m xm We e Xe jθ jθnˆ jθ ( ) i ( ) ( ) ( ) nˆ j ˆ ω ( e ) 22
23 Properties of STFT j ˆ ω assume Xe ( ) exists s ( j ˆ ω ) = DTFT [ ( )] = ( ) j ˆ ωm m= Xe xm xme π ˆ ω 1 θ ( ˆ ω θ) θ ˆ X ˆ ( j ) = ( ) ( ) θ 2π j j j n n e W e X e e d π limiting case j ˆ ω wn ( ˆ) = 1 < nˆ < We ( ) = 2πδ ( ˆ ω) π ˆ ω 1 ( ˆ ω θ ) θ ˆ ˆ ω X ˆ ( j ) = 2πδ( θ) ( ) θ ( ) 2π j j n = j n e X e e d X e π i.e., we get the same thing no matter where the window is shifted 23
24 Alternative Forms of STFT jωˆ Alternative forms of Xnˆ ( e ) 1. real and imaginary i parts j ˆ ω j ˆ ω j ˆ ω X ˆ( ) Re ˆ( ) Im ˆ( ) n e = Xn e + j Xn e = a ( ˆ ω ) jb ( ˆ ω ) n ˆ n ˆ j ˆ ω aˆ( ˆ ω) Re ˆ( ) n = Xn e j ˆ ω bˆ ˆ ω = Im ˆ n( ) X n( e ) when xm ( ) and wn ( ˆ m) are both real (usually the case) can show that a ( ˆ ω) is symmetric in ˆ ω, and b ( ˆ ω) is anti-symmetric in ˆ ω 2. magnitude and phase nˆ X e X e e j ˆ ω nˆ ( ) nˆ ( ) j ˆ ω jθnˆ = ( ˆ ω) j ˆ ω can relate X ˆ( ) and θˆ( ˆ n e n ω) to aˆ( ˆ ω) and bˆ( ˆ ω) n nˆ n 24
25 Role of Window in STFT i The window wn ( ˆ m) does the following: 1. chooses portion of xm ( ) to be analyzed i jωˆ 2. window shape determines the nature of Xn ˆ( e ) X e nˆ f wn ( ˆ mxm ) ( ), j ˆ ω Since nˆ ( ) (for fixed ) is the normal FT o then if we consider the normal FT's of both xn ( ) and wn ( ) individually, we get ˆ ˆ ( j ω ω ) xme ( ) j m Xe We = m= ˆ ˆ ( j ω ω ) wme ( ) j m = m= 25
26 Role of Window in STFT then for fixed n, ˆ, the normal Fourier transform of the product wn ( ˆ mxm ) ( ) is the convolution of the transforms of wn ( ˆ m ) and xm ( ) nˆ w nˆ m W e e j ˆ ω j ˆ ωnˆ for fixed, the FT of ( ) is ( ) --thus π j ˆ ω 1 j θ j θ nˆ j ( ˆ ω θ ) X ˆ( ) = n e W ( e ) e X ( e ) d θ 2π π and replacing θ by θ gives π j ˆ ω 1 ˆ ( ˆ ) ˆ ( ) = θ θ ω+ θ ( ) ( ) θ 2π j j n j Xn e W e e X e d π 26
27 Interpretation of Role of Window j ˆ ω j ˆ ω Xn ˆ ( e ) is the convolution of X ( e ) with the FT of the shifted j ˆ ω j ˆ ωnˆ window sequence We ( ) e j ˆ ω X( e ) really doesn't have meaning since x( nˆ ) varies with time; consider xn ( ˆ) defined for window duration and extended for all time Xe that t reflect the sound within the window (can also consider xn ( ˆ ) = 0 j ˆ ω to have the same properties then ( ) does exist with properties outside the window another case) jωˆ and define Xe ( ) appropriately--but this is jωˆ Bottom Line: Xn ˆ( e ) is a smoothed version of the FT of the part of xn ( ˆ) that is within the window w. 27
28 Windows in STFT j ˆ ω for X ˆ nˆ ( e ) to represent the short-time spectral properties of x( n) jθ inside the window => We ( ) should be much narrower in frequency j ˆ ω than significant spectral regions of Xe ( )--i.e., almost a in frequency n impulse consider rectangular and Hamming windows, where width of the main spectral lobe is inversely proportional to window length, and side lobe levels are essentially independent of window length Rectangular Window: flat window of length L samples; first zero in frequency response occurs at F S /L, with sidelobe levels of -14 db or lower Hamming Window: raised cosine window of length L samples; first zero in frequency response occurs at 2F S /L, with sidelobe levels of -40 db or lower 28
29 Windows L=2M+1-point Hamming window and its corresponding DTFT 29
30 Frequency Responses of Windows 30
31 Effect of Window Length-HW 31
32 Effect of Window Length-HW 32
33 Effect of Window Length-RW 33
34 Effect of Window Length-HW 34
35 Relation to Short-Time Autocorrelation i X e w nˆ m x m j ˆ ω nˆ ( ) is the discrete-timetime Fourier transform of [ ] [ ] for each value of nˆ, then it is seen that S ( e ) = X ( e ) = X ( e ) X ( e ) j ˆ ω j ˆ ω 2 j ˆ ω * j ˆ ω nˆ nˆ nˆ nˆ is the Fourier transform of Rˆ () = [ ˆ n l w n m] x[ mwn ] [ ˆ l mxm ] [ + l] m= which is the short-time autocorrelation function of the previous chapter. Thus the above equations relate the short-time spectrum to the short-time autocorrelation, 35
36 Short-Time Autocorrelation and STFT 36
37 Summary of FT view of STFT jω interpret X ( e ) as the normal Fourier transform of the sequence nˆ wn ( ˆ mxm ) ( ), < m< properties of this Fourier transform depend on the window j ω frequency resolution of Xn ˆ( e ) varies inversely with the length of the window => want long windows for high resolution want x ( n ) to be relatively stationary y( (non-time-varying) during duration of window for most stable spectrum => want short windows as usual in speech processing, there needs to be a compromise between good temporal resolution (short windows) and good frequency resolution (long windows) 37
38 Linear Filtering Interpretation of STFT 38
39 Linear Filtering Interpretation 1. modulation-lowpass filter form ( n rather than nˆ ) j ˆ ω j ˆ ωm X ( e ) = x( m) e w( n m) n m= j ˆ ωn ( ) = wn ( ) xne ( ), nvariable, ˆ ω fixed = 1 2π π jθ j ( θ+ ˆ ω ( ) ( ) jθn We Xe ) e d π 2. bandpass filter-demodulation X n j ˆ ω j ˆ( ω n m ) ( e ) = w( m) x( n m) e m= j ˆ ωn j ˆ ωm = θ e ( w( m) e ) x( n m) m= e [( w( n) e ) x( n)], n variable, ˆ ω fixed j ˆ ωn j ˆ ωn = 39
40 Linear Filtering Interpretation 1. modulation-lowpass filter form: j ˆ ω n( ) = ( ) j ˆ ωm ( ) m= X ( e ) x( m) e w( n m), n variable, ˆ ω fixed jωn ( xne ) = ( ) wn ( ) ( ˆ ω ) j ( ˆ ω ) = xn ( )cos( n) wn ( ) j xn ( )sin( n) wn ( ) = a ( ˆ ω) jb ( ˆ ω) n n 40
41 Linear Filtering Interpretation 2. bandpass filter-demodulation form ( ) X e = e w n e x n n j ˆ ω j ˆ ωn j ˆ ωn n( ) ( ) ( ), variable, ω fixed ˆ complex bandpass filter output modulated by signal e jωn jθ if We ( ) is lowpass, then filter is bandpass around θ = ω all real computation for lower half structure 41
42 Linear Filtering Interpretation Lowpass filter frequency response Bandpass filter frequency response 42
43 Linear Filtering Interpretation assume normal FT of x( n) exists jθ xn ( ) Xe ( ) (recall that ˆ ω is a particular frequency) j ˆ ωn j ( θ+ ˆ ω xne ( ) Xe ( ) ) => spectrum of xn ( ) at frequency ˆ ω is shifted to zero frequency; since the STFT is a convolution, the FT of the STFT is the product of the individual FT's, i.e., Xe We j ( θ+ ˆ ω ( ) jθ ) ( ) jθ jθ if We ( ) resembles a narrow band lowpass filter, i.e., We ( ) = 1 for small θ and is 0 otherwise, then Xe We Xe ( ˆ) ˆ ( j θ+ ω ) ( j θ ω ) ( j ) 43
44 STFT Magnitude Only for many applications you only need the magnitude of the STFT(not the phase) in such cases, the bandpass filter implementation is less complex, since j ˆ ω 2 2 Xn( e ) an( ω) bn( ω) 12 / = ˆ + ˆ = X e a ˆ b j ˆ ω 2 2 n( ) = n( ω) + n( ω) ˆ 12 / 44
45 Sampling Rates of STFT 45
46 Sampling Rates of STFT need to sample STFT in both time and frequency to produce an unaliased representation from which x(n) can be exactly recovered sampling rates lower than the theoretical minimum rate can be used, in either time or frequency, and x(n) can still be exactly recovered from the aliased (under- sampled) short-time time transform this is useful for spectral estimation, pitch estimation, formant estimation, speech spectrograms, vocoders for applications where the signal is modified, e.g., speech enhancement, cannot undersample STFT and still recover modified signal exactly 46
47 Sampling Rate in Time to determine the sampling rate in time, we take a linear filtering view j ˆ ω 1. Xn( e ) is the output of a filter with impulse response w( n) jω 2. We ( ) is a lowpass response with effective bandwidth of B Hertz => j ˆ ω j ˆ ω thus the effective bandwidth of Xn( e ) is B Hertz Xn( e ) has to be sampled at a rate of 2B samples/second to avoid aliasing Example: Hamming Window wn ( ) = cos( 2π n/( L 1)) 0 n L 1 = 0 otherwise 2Fs B (Hz); for L = 100, Fs = 10, 000 Hz => B = 200 Hz => need L rate of 400/sec (every 25 samples) for sampling rate in time 47
48 Sampling Rate in Frequency j ˆ ω since Xn ˆ ( e ) is periodic in ω with period 2π, it is only necessary to sample over an interval of length 2 π need to determine an appropriate finite set of frequencies, ωk = 2π k / N, k = 01,,..., N 1 j ˆ ω at which Xn ˆ( e ) must be specified to exactly recover x( n) j ˆ ω use the Fourier transform interpretation of X ( e ) nˆ j ˆ ω 1. if the window wn ( ) is time-limited, then the inverse transform of Xn ˆ( e ) jωˆ Xnˆ e is time-limited 2. the sampling theorem requres that we sample ( ) in the frequency dimension at a rate of at least twice its ('symmetric') "time width" j ˆ ω 3. since the inverse Fourier transform of X ˆ nˆ ( e ) is the signal x( m) w( n m) and this signal is of duration L samples (the duration of w( n)), then according to the sampling theorem j ˆ ω Xn ˆ ( e ) must be sampled (in frequency) at the set of frequencies 2π k ω k =, k = 01,,..., L 1 (where L / 2 is the effective width of the window) L jωk in order to exactly recover xn ( ) from X( e ) nˆ thus for a Hamming window of duration L=100 samples, we require that the STFT be evaluated at at least 100 uniformly spaced frequencies around the unit circle 48
49 Total Sampling Rate of STFT the total sampling rate for the STFT is the product of the sampling rates in time and frequency, i.e., SR = SR(time) x SR(frequency) = 2B x L samples/sec B = frequency bandwidth of window (Hz) L = time width of window (samples) for most windows of interest, B is a multiple of F S /L, i.e., B = C F S /L (Hz), C=1 for Rectangular Window C=2 2 for Hamming Window SR = 2C F S samples/second can define an oversampling rate of SR/ F S = 2C = oversampling rate of STFT as compared to conventional sampling representation of x(n) for RW, 2C=2; for HW 2C=4 => range of oversampling is 2-4 this oversampling gives a very flexible representation of the speech signal 49
50 Mathematical Basis s for Sampling the STFT assume sample in time at n = n = rr, < r < 2π and in frequency at ˆ ω = ωk = k, k = 01,,..., N 1 N sample values j 2π k 2π N j N km X ( e ) = w[ rr m] x[ m] e rr 2π j k N m= 2π 2π j krr j k N N rr = e X ( e ) r j km N X ( e ) = x [ rr + mw ] ( m ) e ( set m = rr+ m ; m = m ) rr m= define DFT-type notation 2π 2π = j N k = j N krr r r R r X ( k) X ( e ) e X ( k) 2π 50
51 Sampling the STFT 51
52 Sampling the STFT DFT Notation 2π 2π j k j krr N N = = r r R r X ( k) X ( e ) e X ( k) let w[ m] 0 for 0 m L 1(finite duration window with no zero-valued samples) L 1 X [ k] = x[ rr+ m] w[ m] e r m= 0 2π j km N ( r fixed, 0 k N 1) if L N then (DFT defined with no aliasing can recover sequence exactly using inverse DFT) 1 x [ rr+ mw ] [ m ] = X [ k ] e N N 1 r k = 0 2π j km N ( r fixed, 0 m N 1) if R L (IDFT defined with no aliasing), then all samples ca n be recovered from X [ k] ( R > L gaps in sequence) r 52
53 What We Have Learned So Far j j ˆ ω m ˆ ω 1. X ( e ) = x( m) w( nˆ m) e nˆ m= i function of nˆ = n for sampled ˆ ω (looks like a time sequence) i function of ˆ ω = ω for sampled nˆ (looks like a transform) X e d for n ˆ = 123,,,...; 0 ˆ ω π jωˆ nˆ( ) (no sampling rate reduction) define j ˆ ω 2. X ˆ ˆ ˆ( ) DTFT ( ) ( ) fixed, ˆ n e = x m w n m n ω variable with time origin tied to x( nˆ ) j ˆ ω j ˆ ωnˆ X ˆ ˆ ˆ( ) DTFT ( ) ( ) fixed, ˆ n e = e x n+ m w m n ω variable with time origin tied to w( m) j ˆ ω 3. Interpretations of X ( e ) nˆ j ˆ ω 1. nˆ fixed, ˆ ω = ω variable; X ˆ nˆ ( e ) = DTFT x( m) w( n m) DFT View j ˆ ω j ˆ ωn 2. nˆ = n variable, ˆ ω fixed; X ( e ) = x( n) e w( n) Linear Filtering view filter bank implementation nˆ 53
54 What We Have Learned So Far 4. Signal Recovery from STFT π 1 j ˆ ω j ˆ ωm ˆ 2π n π π j ˆ ω j ˆ ωnˆ nˆ ω π xmwn ( ) ( ˆ m ) = X ( e ) e d ω 1 xn ( ˆ) = X( e ) e d 2πw ( 0 ) 5. Linear Filtering Interpretation j ˆ ω j ˆ ωn 1. modulation-lowpass filter Xn( e ) = w( n) x( n) e, j ˆ ω 1 jθ j ( θ+ ˆ ω ˆ variable, ˆ fixed ( ) ( ) ( ) jθn n = n ω Xn e = ) θ 2π W e X e e d ( ) j ˆ ω j ˆ ωn j ˆ ωn 2. bandpass filer-demodulation X n( e ) e w( n) e x( n), nˆ = n variable, ˆ ω fixed π π = 54
55 What We Have Learned So Far 6. Sampling Rates in Time and Frequency jω 1. time: We ( ) has bandwidth of BHertz 2B samples/sec rate 2FS Hamming Window: B = (Hz) L jω 2. frequency: wn ( ) is time limited to Lsamples inverse of X ( e ) is also time limited need to sample in frequency at twice the (effective) time width of the time-limited sequence L frequency samples 3. total Sampling Rate: 2BL samples/sec - B = frequency bandwidth of the window (Hz) - L = effective time width of the window (samples) B = C FS / L(Hz) Sampling Rate = 2B L = 2CF S samples/second - for Rectangular Window, C = 1 - for Hamming Window, C = 2 n 55
56 Spectrographic Displays 56
57 Spectrographic Displays Sound Spectrograph-one of the earliest embodiments of the time- dependent spectrum analysis techniques 2-second utterance repeatedly modulates a variable frequency oscillator, then bandpass filtered, and the average energy at a given time and frequency is measured and used as a crude measure of the STFT thus energy is recorded by an ingenious electro-mechanical system on special electrostatic paper called teledeltos paper result is a two-dimensional representation of the time-dependent spectrum-with vertical intensity being spectrum level at a given frequency, and horizontal intensity being spectral level at a given timewith spectrum magnitude being represented by the darkness of the marking wide bandpass filters (300 Hz bandwidth) provide good temporal resolution and poor frequency resolution (resolve pitch pulses in time but not in frequency) called wideband spectrogram narrow bandpass filters (45 Hz bandwidth) provide good frequency resolution and poor time resolution (resolve pitch pulses in frequency, but not in time) called narrowband spectrogram 57
58 Conventional Spectrogram (Every salt breeze comes from the sea) 58
59 Digital Speech Spectrograms wideband spectrogram follows broad spectral peaks (formants) over time resolves most individual pitch periods as vertical striations since the IR of the analyzing filter is comparable in duration to a pitch period what happens for low pitch males high pitch females for unvoiced speech there are no vertical pitch striations narrowband spectrogram individual harmonics are resolved in voiced regions formant frequencies are still in evidence usually can see fundamental frequency unvoiced regions show no strong structure 59
60 Digital Speech Spectrograms Speech Parameters ( This is a test ): sampling rate: 16 khz speech duration: seconds speaker: male Wideband d Spectrogram Parameters: analysis window: Hamming window analysis window duration: 6 msec (96 samples) analysis window shift: msec (10 samples) FFT size: 512 dynamic range of spectral log magnitudes: 40 db Narrowband Spectrogram Parameters: analysis window: Hamming window analysis window duration: 60 msec (960 samples) analysis window shift: 6 msec (96 samples) FFT size: 1024 dynamic range of spectral log magnitudes: 40 db 60
61 Digital Speech Spectrograms Top Panel: 3 msec (48 samples) window Second Panel: 6 msec (96 samples) window Third Panel: 9 msec (144 sample) window Fourth Panel: 30 msec (480 sample) window 61
62 Spectrogram Comparisons 62
63 Spectrogram - Male nfft = 1024, L = 80, Overlap = 75 63
64 Spectrogram - Female nfft = 1024, L = 80, Overlap = 75 64
65 Overlap Addition (OLA) Method 65
66 Overlap Addition (OLA) Method based on normal FT interpretation of short-time spectrum nˆ DFT / IDFT jωk X ( e ) y ( m) = x( m) w( nˆ m) k can reconstruct x(m) by computing IDFT of X ( e )and nˆ dividing out the window (assumed non-zero for all samples) this process gives L signal values of x(m) for each window => window can be moved by L samples and the process repeated since X ( e ) is "undersampled" in time, it is highly susceptible nˆ jω k to aliasing errors => need more robust synthesis procedure nˆ jω 66
67 Overlap Addition (OLA) Method jω ω k j kn yn ( ) = Xm( e ) e m k summation is for overlapping analysis sections jωk for each value of m where Xm( e ) is measured, do an inverse FT to give y ( n ) = Lx ( n ) w ( m n ) (where L is the size of the FT) m y ( n) = y ( n) = Lx( n) w( m n) a basic property of the window is m m N 1 j 0 jωk ( ) = ( ) ω = 0 = ( ) k n= 0 We We wn m since any set of samples of the window are equivalent (by sampling arguments), then if wn ( ) is sampled often enough we get (independent of n) m wm n = We j 0 ( ) ( ) j 0 yn ( ) = Lx ( nw ) ( e ) using overlap-added d sections 67
68 Overlap Addition of Bartlett and Hann Windows 68
69 Overlap Addition of Hamming Window L=128 69
70 Window Spectra DTFTof Bartlett (triangular), Hann and Hamming windows 70
71 Hamming Window Spectra DTFTs of even-length, odd-length and modified odd-to-even length Hamming windows; zeros spaced at 2π/R give perfect reconstruction using OLA (even-length window) 71
72 Overlap Addition (OLA) Method 72
73 Overlap Addition (OLA) Method w(n) is an L-point Hamming window with R=L/4 assume x(n)=0 for n<0 time overlap of 4:1 for HW first analysis section begins at n=l/4 73
74 Overlap Addition (OLA) Method 4-overlapping sections contribute to each interval N-point FFT s done using L speech samples, with N-L zeros padded at end to allow modifications without significant aliasing effects for a given value of n y(n)=x(n)w(r-n)+x(n)w(2r- ( ) ( ) ( ) ( n)+x(n)w(3r-n)+x(n)w(4rn)=x(n)[w(r-n)+w(2r-n)+w(3rn)+w(4r-n)]=x(n) W(e j0 )/R 74
75 Filter Bank Summation (FBS) 75
76 Filter Bank Summation the filter bank interpretation of the STFT shows that for jω k any frequency ωk, Xn( e ) is a lowpass representation of the signal in a band centered at ω ( n = nˆ for FBS) jω jω n k k X ( e ) = e x( n m) w ( m) e n m= k k jω m where wk( m) is the lowpass window used at frequency ωk (we have generalized the structure to allow a different lowpass window at each frequency ω k ). k 76
77 Filter Bank Summation define a bandpass filter and substitute it in the equation to give j k h ( n ) = w ( n ) e ω k k jωk jωkn Xn( e ) = e x( n m) hk( m) n m= 77
78 Filter Bank Interpretation of STFT (case: w k [n]=w[n]) wn [ ] We ( jω ) -ω 0 ω 0 ω jωkn jω jω jωkn hn [ ] = wne [ ] He ( ) = W( e ) FT( e ) jω n jω n jωn j( ω ω ) n k k k FT( e ) = e e = e = δ ( ω ω ) n= n= He We We jω jω j ( ω ωk ) ( ) = ( ) δω ( ωk ) = ( ) [ ] [ ] ( j ωk ) j ωk v n = X e = e n x[ n] h[ n] k n ( j ω ) ( j ω ) ( j ω V ) j ωkn k e = H e X e FT( e ) jω jω = He ( ) Xe ( ) δω ( + ωk ) = Xe + j ω j ( ω ω k ) ( ) We ( ) δ ( ω ωk ) j ( ω+ ωk ) jω = Xe ( ) We ( ) lowpass k single-sided, bandpass ω k -ω 0 ω k ω k + ω 0 ω 78
79 Filter Bank Summation jω k thus X ( e ) is obtained by bandpass filtering x( n) n followed by modulation with the complex exponential j kn e ω. We can express this in the form k n jω jω n k m= k k y ( n) = X ( e ) e = x( n m) h ( m) thus y k ( n ) is the output of a bandpass filter with impulse response h ( n) k 79
80 Filter Bank Summation 80
81 Filter Bank Summation a practical method for reconstructing xn ( ) from the STFT is as follows jω k 1. assume we know X ( e ) for a set of N frequencies { ω }, k = 01,,..., N 1 n 2. assume we have a set of N bandpass filters with impulse responses jω n k h ( n) = w ( n) e, k = 01,,..., N 1 k k 3. assume w ( n ) is an ideal lowpass filter with cutoff frequency ω k k pk - the frequency response of the bandpass filter is j j( k ) H ( e ω ) = W ( e ω ω ) k k 81
82 Filter Bank Summation consider a set of N bandpass filters, uniformly spaced, so that the entire frequency band is covered 2π k ω k =, k = 01,,..., N 1 N also assume window the same for all channels, i.e., wk ( n) = w( n), k = 01,,..., N 1 if we add together all the bandpass outputs, the composite response is jω N 1 N 1 jω k k= 0 k= 0 jω j( ω ωk ) He ( ) = H ( e ) = We ( ) k if We ( ) is properly sampled in frequency ( N L), where Lis the window duration, then it can be shown that 1 N 1 N k = 0 j ( ω ω ) k W ( e ) = w ( 0 ) ω FBS Formula 82
83 Filter Bank Summation 1/N 83
84 Filter Bank Summation derivation of FBS formula FT / IFT jω wn ( ) We ( ) jω if We ( ) is sampled in frequency at N uniformly spaced points, the inverse discrete Fourier transform of the sampled version of We ( ) is (recall that sampling multiplication convolution aliasing) 1 N N 1 jω jω n k= 0 r= an aliased version of jω k k k We ( ) e = wn ( + rn) wn ( ) is obtained. 84
85 Filter Bank Summation If wn ( ) is of duration Lsamples, then wn ( ) = 0, n< 0, n L and no aliasing occurs due to sampling in frequency j ω of W ( e ). In this case if we evaluate the aliased formula for n = 0, we get 1 N N 1 1 k = 0 jω k We ( ) = w( 0) thefbsformulaisseentobeequivalenttotheformula seen to equivalent to above, since (according to the sampling theorem) any set of N uniformly spaced samples of W ( e ) is adequate jω 85
86 Filter Bank Summation the impulse response of the composite filter bank system is N 1 N 1 jωkn hn ( ) h( n) wne ( ) Nw( 0) δ ( n) = = = k k= 0 k= 0 thus the composite output is yn ( ) = xn ( ) hn ( ) = Nw( 0) xn ( ) thus for FBS method, the reconstructed signal is N 1 N 1 k n jωk jωkn k= 0 k= 0 yn ( ) = y ( n) = X ( e ) e = Nw( 0) xn ( ) jω k if Xn( e ) is sampled properly in frequency, and is independent of the shape of wn ( ) 86
87 Filter Bank Summation 1/N 87
88 Filter Bank Summation N 1 N 1 2π 2π j k j kn N N yn ( ) = y ( n ) = X ( e ) e k k= 0 k= 0 N 1 = xmwn ( ) ( me ) e k= 0 m n N 1 = xmwn ( ) ( m) e m k= 0 2π 2π j km j kn N N 2π j k( n m) N = xmwn ( ) ( m ) N δ ( n m rn ) m r= y( n) = N w( rn) x( n rn) r = wn ( ) 0 for 0 n L 1 if N Lthen need only r = 0 term y(n) = Nw( 0)x(n) if N < L then in order for y( n) = x( n) you need the condition w( rn) = 0, r = ± 1, ± 2,... 'undersampled' d' representation ti can still work--at least in theory 88
89 Summary of FBS Method j perfect reconstruction of x(n) from X ( e ω ) is possible using FBS under the following conditions: 1. w(n) is a finite duration filter/window j 2. X ( e ω ) is sampled properly in both time and frequency n perfect reconstruction of x(n) from Xn( e k ) is also possible using FBS under the following condition: jω We ( ) is perfectly bandlimited j e ω n jω k To avoid time aliasing, Xn( ) must be evaluated at at least L uniformly spaced frequencies, where L is the window duration -since window of length L samples has frequency bandwidth of from 2π / L (for RW) to 4π / L (for HW), the bandpass filters in FBS overlap in frequency since the analysis frequencies are 2π k/ L, k = 01,,..., L 1 j k e ω there is a way (at least theoretically) for Xn( ) to be evaluated in non-overlapping bands and for which x(n) can still be exactly recovered 89
90 FBS Reconstruction in Non- Overlapping Bands assume window length for all bands is L samples assume the same window is used for N equally spaced frequency bands with analysis frequencies 2 π k ω k =, k = 01,,..., N 1 N where N can be less than L assume w(n) is an ideal lowpass filter with cutoff frequency π ωp = N example with N=6 equally spaced ideal filters 90
91 FBS Reconstruction in Non- Overlapping Bands the composite impulse response for the FBS system is N 1 N 1 jω n jω n k k hn ( ) = wne ( ) = wn ( ) e k= 0 k= 0 defining a composite of the terms being summed as N 1 N 1 jω n j2π kn/ N k pn ( ) = e = e k= 0 k= 0 we get for h ( n) h ( n) = wn ( ) pn ( ) it is easy to show (Prob. 6.7) that p(n) is a periodic train of impulses of the form p ( n ) = N δ ( n rn ) r = giving for hn ( ) the expression hn ( ) = N wrn ( ) δ ( n rn ) r = thus the composite impulse response is the window sequence sampled at intervals of N samples 91
92 FBS Reconstruction in Non-Overlapping Bands impulse response of ideal lowpass filter with cutoff frequency π/n for ideal LPF we have πsin( n/ N) sin( r) 1 δwn ( ) = π, wrn ( ) = = ( r) n rn Nπ h ( n) = ( n) πgiving other cases where perfect reconstruction is obtained 1. wn ( ) is of finite length L< Nδand causal (no images) 2. wn ( ) has length > N and has the property wn ( ) = 1/ N, for n= rn 0 = 0 for n = rn ( r r0, r = 0, ± 1, ± 2,...) giving hn ( ) = pnwn ( ) ( ) = ( n rn 0 ) j rnδ0 ( ) = j r N He e yn ( ) = xn ( rnω) ω0 92
93 Summary of FBS Reconstruction for perfect reconstruction using FBS methods 1. w(n) does not need to be either time-limited or frequency-limited to exactly reconstruct jω k x(n) from Xn( e ) 2. w(n) just needs equally spaced zeros, spaced N samples apart for theoretically ti perfect reconstruction ti exact reconstruction of the input is possible with a number of frequency channels less than that required by the sampling theorem key issue is how to design digital filters that match these criteria 93
94 Practical Implementation of FBS 94
95 FBS and OLA Comparisons 95
96 FBS and OLA Comparisons duals filter bank summation method overlap addition method -- one depends on sampling relation in frequency -- one depends on sampling relation in time FBS requires sampling in frequency be such that the window jω transform We ( ) obeys the relation 1 N N 1 k = 0 j( ω ω ) k We ( ) = w( 0) any ω OLA requires that t sampling in time be such hthat tthe window obeys the relation r = j 0 wrr ( n ) = We ( )/ R any n the key to Short-Time Fourier Analysis is the ability to modify the short-time spectrum (via quantization, noise enhancement, signal enhancement, speed-up/slow-down,etc) and recover an "unaliased" modified signal 96
97 Overlap Addition (OLA) Method jω k assume X ( e ) sampled with period R samples in time n jω jω k k Y ( e ) = X ( e ), r integer, 0 k N 1 r rr the Overlap Add Method is based on the summation N 1 1 jωk jωkn yn ( ) = Yr ( e ) e OLA Method r= N k= 0 k for each value of r, compute the inverse transform of Yr ( e ) giving the sequences yr ( m) = x( m) w( rr m), < m < the signal at time n is obtained by summing the values at time n of all the sequences, y ( m) that overlap at time n, giving yn ( ) = y( n) = xn ( ) wrr ( n) r r= r = r if w(n) has a bandlimited FT and if Xn( e ) is properly sampled in time (i.e., R small enough to avoid aliasing) then jω k r = j 0 wrr ( n) We ( )/ R -- independent of n, and j 0 yn ( ) = xnwe ( ) ( )/ R-- exact reconstruction of x(n) jω 97
Digital Speech Processing Lecture 10. Short-Time Fourier Analysis Methods - Filter Bank Design
Digital Speech Processing Lecture Short-Time Fourier Analysis Methods - Filter Bank Design Review of STFT j j ˆ m ˆ. X e x[ mw ] [ nˆ m] e nˆ function of nˆ looks like a time sequence function of ˆ looks
More informationrepresentation of speech
Digital Speech Processing Lectures 7-8 Time Domain Methods in Speech Processing 1 General Synthesis Model voiced sound amplitude Log Areas, Reflection Coefficients, Formants, Vocal Tract Polynomial, l
More informationVoiced Speech. Unvoiced Speech
Digital Speech Processing Lecture 2 Homomorphic Speech Processing General Discrete-Time Model of Speech Production p [ n] = p[ n] h [ n] Voiced Speech L h [ n] = A g[ n] v[ n] r[ n] V V V p [ n ] = u [
More informationL6: Short-time Fourier analysis and synthesis
L6: Short-time Fourier analysis and synthesis Overview Analysis: Fourier-transform view Analysis: filtering view Synthesis: filter bank summation (FBS) method Synthesis: overlap-add (OLA) method STFT magnitude
More informationDiscrete Fourier Transform
Discrete Fourier Transform Virtually all practical signals have finite length (e.g., sensor data, audio records, digital images, stock values, etc). Rather than considering such signals to be zero-padded
More informationOLA and FBS Duality Review
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)
More informationChapter 9. Linear Predictive Analysis of Speech Signals 语音信号的线性预测分析
Chapter 9 Linear Predictive Analysis of Speech Signals 语音信号的线性预测分析 1 LPC Methods LPC methods are the most widely used in speech coding, speech synthesis, speech recognition, speaker recognition and verification
More informationChirp Transform for FFT
Chirp Transform for FFT Since the FFT is an implementation of the DFT, it provides a frequency resolution of 2π/N, where N is the length of the input sequence. If this resolution is not sufficient in a
More informationOLA and FBS Duality Review
OLA and FBS Duality Review 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.
More informationContents. Digital Signal Processing, Part II: Power Spectrum Estimation
Contents Digital Signal Processing, Part II: Power Spectrum Estimation 5. Application of the FFT for 7. Parametric Spectrum Est. Filtering and Spectrum Estimation 7.1 ARMA-Models 5.1 Fast Convolution 7.2
More informationFourier Analysis of Signals Using the DFT
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
More information1. Calculation of the DFT
ELE E4810: Digital Signal Processing Topic 10: The Fast Fourier Transform 1. Calculation of the DFT. The Fast Fourier Transform algorithm 3. Short-Time Fourier Transform 1 1. Calculation of the DFT! Filter
More informationDiscrete Fourier transform (DFT)
Discrete Fourier transform (DFT) Signal Processing 2008/9 LEA Instituto Superior Técnico Signal Processing LEA (IST) Discrete Fourier transform 1 / 34 Periodic signals Consider a periodic signal x[n] with
More informationLAB 6: FIR Filter Design Summer 2011
University of Illinois at Urbana-Champaign Department of Electrical and Computer Engineering ECE 311: Digital Signal Processing Lab Chandra Radhakrishnan Peter Kairouz LAB 6: FIR Filter Design Summer 011
More informationEE123 Digital Signal Processing
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
More informationLecture 19: Discrete Fourier Series
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 19: Discrete Fourier Series Dec 5, 2001 Prof: J. Bilmes TA: Mingzhou
More information! Spectral Analysis with DFT. ! Windowing. ! Effect of zero-padding. ! Time-dependent Fourier transform. " Aka short-time Fourier transform
Lecture Outline ESE 531: Digital Signal Processing Spectral Analysis with DFT Windowing Lec 24: April 18, 2019 Spectral Analysis Effect of zero-padding Time-dependent Fourier transform " Aka short-time
More informationThe Discrete-Time Fourier
Chapter 3 The Discrete-Time Fourier Transform 清大電機系林嘉文 cwlin@ee.nthu.edu.tw 03-5731152 Original PowerPoint slides prepared by S. K. Mitra 3-1-1 Continuous-Time Fourier Transform Definition The CTFT of
More informationDigital Signal Processing Lecture 10 - Discrete Fourier Transform
Digital Signal Processing - Discrete Fourier Transform Electrical Engineering and Computer Science University of Tennessee, Knoxville November 12, 2015 Overview 1 2 3 4 Review - 1 Introduction Discrete-time
More informationDiscrete Time Fourier Transform (DTFT)
Discrete Time Fourier Transform (DTFT) 1 Discrete Time Fourier Transform (DTFT) The DTFT is the Fourier transform of choice for analyzing infinite-length signals and systems Useful for conceptual, pencil-and-paper
More informationMultimedia Signals and Systems - Audio and Video. Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2
Multimedia Signals and Systems - Audio and Video Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2 Kunio Takaya Electrical and Computer Engineering University of Saskatchewan December
More informationReview of Fundamentals of Digital Signal Processing
Chapter 2 Review of Fundamentals of Digital Signal Processing 2.1 (a) This system is not linear (the constant term makes it non linear) but is shift-invariant (b) This system is linear but not shift-invariant
More informationL29: Fourier analysis
L29: Fourier analysis Introduction The discrete Fourier Transform (DFT) The DFT matrix The Fast Fourier Transform (FFT) The Short-time Fourier Transform (STFT) Fourier Descriptors CSCE 666 Pattern Analysis
More informationDiscrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is
Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section 5. 3 The (DT) Fourier transform (or spectrum) of x[n] is X ( e jω) = n= x[n]e jωn x[n] can be reconstructed from its
More information-Digital Signal Processing- FIR Filter Design. Lecture May-16
-Digital Signal Processing- FIR Filter Design Lecture-17 24-May-16 FIR Filter Design! FIR filters can also be designed from a frequency response specification.! The equivalent sampled impulse response
More informationCh.11 The Discrete-Time Fourier Transform (DTFT)
EE2S11 Signals and Systems, part 2 Ch.11 The Discrete-Time Fourier Transform (DTFT Contents definition of the DTFT relation to the -transform, region of convergence, stability frequency plots convolution
More informationClass of waveform coders can be represented in this manner
Digital Speech Processing Lecture 15 Speech Coding Methods Based on Speech Waveform Representations ti and Speech Models Uniform and Non- Uniform Coding Methods 1 Analog-to-Digital Conversion (Sampling
More information! Circular Convolution. " Linear convolution with circular convolution. ! Discrete Fourier Transform. " Linear convolution through circular
Previously ESE 531: Digital Signal Processing Lec 22: April 18, 2017 Fast Fourier Transform (con t)! Circular Convolution " Linear convolution with circular convolution! Discrete Fourier Transform " Linear
More information6.003: Signal Processing
6.003: Signal Processing Discrete Fourier Transform Discrete Fourier Transform (DFT) Relations to Discrete-Time Fourier Transform (DTFT) Relations to Discrete-Time Fourier Series (DTFS) October 16, 2018
More informationReview of Fundamentals of Digital Signal Processing
Solution Manual for Theory and Applications of Digital Speech Processing by Lawrence Rabiner and Ronald Schafer Click here to Purchase full Solution Manual at http://solutionmanuals.info Link download
More informationReview of Discrete-Time System
Review of Discrete-Time System Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides were based on class notes developed by Profs. K.J. Ray Liu and Min Wu.
More informationELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization
ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals 1. Sampling and Reconstruction 2. Quantization 1 1. Sampling & Reconstruction DSP must interact with an analog world: A to D D to A x(t)
More informationTimbral, Scale, Pitch modifications
Introduction Timbral, Scale, Pitch modifications M2 Mathématiques / Vision / Apprentissage Audio signal analysis, indexing and transformation Page 1 / 40 Page 2 / 40 Modification of playback speed Modifications
More informationELEG 305: Digital Signal Processing
ELEG 5: Digital Signal Processing Lecture 6: The Fast Fourier Transform; Radix Decimatation in Time Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 8 K.
More informationChapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform Introduction Representation of periodic sequences: the discrete Fourier series Properties of the DFS The Fourier transform of periodic signals Sampling the Fourier
More informationLAB 2: DTFT, DFT, and DFT Spectral Analysis Summer 2011
University of Illinois at Urbana-Champaign Department of Electrical and Computer Engineering ECE 311: Digital Signal Processing Lab Chandra Radhakrishnan Peter Kairouz LAB 2: DTFT, DFT, and DFT Spectral
More information! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals
ESE 531: Digital Signal Processing Lec 25: April 24, 2018 Review Course Content! Introduction! Discrete Time Signals & Systems! Discrete Time Fourier Transform! Z-Transform! Inverse Z-Transform! Sampling
More informationElec4621 Advanced Digital Signal Processing Chapter 11: Time-Frequency Analysis
Elec461 Advanced Digital Signal Processing Chapter 11: Time-Frequency Analysis Dr. D. S. Taubman May 3, 011 In this last chapter of your notes, we are interested in the problem of nding the instantaneous
More informationSpeech Signal Representations
Speech Signal Representations Berlin Chen 2003 References: 1. X. Huang et. al., Spoken Language Processing, Chapters 5, 6 2. J. R. Deller et. al., Discrete-Time Processing of Speech Signals, Chapters 4-6
More informationECE-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
ECE-7 Review Phil Schniter January 5, 7 ransforms Using x c (t) to denote a continuous-time signal at time t R, Laplace ransform: X c (s) x c (t)e st dt, s C Continuous-ime Fourier ransform (CF): ote that:
More informationE : Lecture 1 Introduction
E85.2607: Lecture 1 Introduction 1 Administrivia 2 DSP review 3 Fun with Matlab E85.2607: Lecture 1 Introduction 2010-01-21 1 / 24 Course overview Advanced Digital Signal Theory Design, analysis, and implementation
More informationLecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev.
Lecture 10 Digital Signal Processing Chapter 7 Discrete Fourier transform DFT Mikael Swartling Nedelko Grbic Bengt Mandersson rev. 016 Department of Electrical and Information Technology Lund University
More informationSinusoidal Modeling. Yannis Stylianou SPCC University of Crete, Computer Science Dept., Greece,
Sinusoidal Modeling Yannis Stylianou University of Crete, Computer Science Dept., Greece, yannis@csd.uoc.gr SPCC 2016 1 Speech Production 2 Modulators 3 Sinusoidal Modeling Sinusoidal Models Voiced Speech
More information8 The Discrete Fourier Transform (DFT)
8 The Discrete Fourier Transform (DFT) ² Discrete-Time Fourier Transform and Z-transform are de ned over in niteduration sequence. Both transforms are functions of continuous variables (ω and z). For nite-duration
More informationUNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.
UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in INF3470/4470 Digital signal processing Day of examination: December 9th, 011 Examination hours: 14.30 18.30 This problem set
More informationComputer Engineering 4TL4: Digital Signal Processing
Computer Engineering 4TL4: Digital Signal Processing Day Class Instructor: Dr. I. C. BRUCE Duration of Examination: 3 Hours McMaster University Final Examination December, 2003 This examination paper includes
More informationECG782: Multidimensional Digital Signal Processing
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu ECG782: Multidimensional Digital Signal Processing Filtering in the Frequency Domain http://www.ee.unlv.edu/~b1morris/ecg782/ 2 Outline Background
More informationLecture 14: Windowing
Lecture 14: Windowing ECE 401: Signal and Image Analysis University of Illinois 3/29/2017 1 DTFT Review 2 Windowing 3 Practical Windows Outline 1 DTFT Review 2 Windowing 3 Practical Windows DTFT Review
More informationFilter Design Problem
Filter Design Problem Design of frequency-selective filters usually starts with a specification of their frequency response function. Practical filters have passband and stopband ripples, while exhibiting
More informationEDISP (NWL3) (English) Digital Signal Processing DFT Windowing, FFT. October 19, 2016
EDISP (NWL3) (English) Digital Signal Processing DFT Windowing, FFT October 19, 2016 DFT resolution 1 N-point DFT frequency sampled at θ k = 2πk N, so the resolution is f s/n If we want more, we use N
More informationUNIVERSITY OF OSLO. Faculty of mathematics and natural sciences. Forslag til fasit, versjon-01: Problem 1 Signals and systems.
UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in INF3470/4470 Digital signal processing Day of examination: December 1th, 016 Examination hours: 14:30 18.30 This problem set
More information3.2 Complex Sinusoids and Frequency Response of LTI Systems
3. Introduction. A signal can be represented as a weighted superposition of complex sinusoids. x(t) or x[n]. LTI system: LTI System Output = A weighted superposition of the system response to each complex
More informationDiscrete-Time Fourier Transform (DTFT)
Discrete-Time Fourier Transform (DTFT) 1 Preliminaries Definition: The Discrete-Time Fourier Transform (DTFT) of a signal x[n] is defined to be X(e jω ) x[n]e jωn. (1) In other words, the DTFT of x[n]
More informationChap 4. Sampling of Continuous-Time Signals
Digital Signal Processing Chap 4. Sampling of Continuous-Time Signals Chang-Su Kim Digital Processing of Continuous-Time Signals Digital processing of a CT signal involves three basic steps 1. Conversion
More informationChapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum
Chapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum CEN352, DR. Nassim Ammour, King Saud University 1 Fourier Transform History Born 21 March 1768 ( Auxerre ). Died 16 May 1830 ( Paris ) French
More informationContinuous Fourier transform of a Gaussian Function
Continuous Fourier transform of a Gaussian Function Gaussian function: e t2 /(2σ 2 ) The CFT of a Gaussian function is also a Gaussian function (i.e., time domain is Gaussian, then the frequency domain
More informationThe Discrete Fourier Transform
In [ ]: cd matlab pwd The Discrete Fourier Transform Scope and Background Reading This session introduces the z-transform which is used in the analysis of discrete time systems. As for the Fourier and
More informationIT DIGITAL SIGNAL PROCESSING (2013 regulation) UNIT-1 SIGNALS AND SYSTEMS PART-A
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING IT6502 - DIGITAL SIGNAL PROCESSING (2013 regulation) UNIT-1 SIGNALS AND SYSTEMS PART-A 1. What is a continuous and discrete time signal? Continuous
More informationSPEECH ANALYSIS AND SYNTHESIS
16 Chapter 2 SPEECH ANALYSIS AND SYNTHESIS 2.1 INTRODUCTION: Speech signal analysis is used to characterize the spectral information of an input speech signal. Speech signal analysis [52-53] techniques
More informationFilter Analysis and Design
Filter Analysis and Design Butterworth Filters Butterworth filters have a transfer function whose squared magnitude has the form H a ( jω ) 2 = 1 ( ) 2n. 1+ ω / ω c * M. J. Roberts - All Rights Reserved
More informationDepartment of Electrical and Computer Engineering Digital Speech Processing Homework No. 6 Solutions
Problem 1 Department of Electrical and Computer Engineering Digital Speech Processing Homework No. 6 Solutions The complex cepstrum, ˆx[n], of a sequence x[n] is the inverse Fourier transform of the complex
More informationII. Nonparametric Spectrum Estimation for Stationary Random Signals - Non-parametric Methods -
II. onparametric Spectrum Estimation for Stationary Random Signals - on-parametric Methods - - [p. 3] Periodogram - [p. 12] Periodogram properties - [p. 23] Modified periodogram - [p. 25] Bartlett s method
More informationDiscrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz
Discrete Time Signals and Systems Time-frequency Analysis Gloria Menegaz Time-frequency Analysis Fourier transform (1D and 2D) Reference textbook: Discrete time signal processing, A.W. Oppenheim and R.W.
More informationECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION
FINAL EXAMINATION 9:00 am 12:00 pm, December 20, 2010 Duration: 180 minutes Examiner: Prof. M. Vu Assoc. Examiner: Prof. B. Champagne There are 6 questions for a total of 120 points. This is a closed book
More informationReview: Continuous Fourier Transform
Review: Continuous Fourier Transform Review: convolution x t h t = x τ h(t τ)dτ Convolution in time domain Derivation Convolution Property Interchange the order of integrals Let Convolution Property By
More informationMultidimensional digital signal processing
PSfrag replacements Two-dimensional discrete signals N 1 A 2-D discrete signal (also N called a sequence or array) is a function 2 defined over thex(n set 1 of, n 2 ordered ) pairs of integers: y(nx 1,
More information/ (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
Code No: RR320402 Set No. 1 III B.Tech II Semester Regular Examinations, Apr/May 2006 DIGITAL SIGNAL PROCESSING ( Common to Electronics & Communication Engineering, Electronics & Instrumentation Engineering,
More informationFourier Analysis and Spectral Representation of Signals
MIT 6.02 DRAFT Lecture Notes Last update: April 11, 2012 Comments, questions or bug reports? Please contact verghese at mit.edu CHAPTER 13 Fourier Analysis and Spectral Representation of Signals We have
More informationChapter 5 Frequency Domain Analysis of Systems
Chapter 5 Frequency Domain Analysis of Systems CT, LTI Systems Consider the following CT LTI system: xt () ht () yt () Assumption: the impulse response h(t) is absolutely integrable, i.e., ht ( ) dt< (this
More informationUNIT - 7: FIR Filter Design
UNIT - 7: FIR Filter Design Dr. Manjunatha. P manjup.jnnce@gmail.com Professor Dept. of ECE J.N.N. College of Engineering, Shimoga October 5, 06 Unit 7 Syllabus Introduction FIR Filter Design:[,, 3, 4]
More informationDigital Signal Processing. Midterm 1 Solution
EE 123 University of California, Berkeley Anant Sahai February 15, 27 Digital Signal Processing Instructions Midterm 1 Solution Total time allowed for the exam is 8 minutes Some useful formulas: Discrete
More informationMultirate Digital Signal Processing
Multirate Digital Signal Processing Basic Sampling Rate Alteration Devices Up-sampler - Used to increase the sampling rate by an integer factor Down-sampler - Used to decrease the sampling rate by an integer
More informationLecture 27 Frequency Response 2
Lecture 27 Frequency Response 2 Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/6/12 1 Application of Ideal Filters Suppose we can generate a square wave with a fundamental period
More informationRadar Systems Engineering Lecture 3 Review of Signals, Systems and Digital Signal Processing
Radar Systems Engineering Lecture Review of Signals, Systems and Digital Signal Processing Dr. Robert M. O Donnell Guest Lecturer Radar Systems Course Review Signals, Systems & DSP // Block Diagram of
More informationPractical Spectral Estimation
Digital Signal Processing/F.G. Meyer Lecture 4 Copyright 2015 François G. Meyer. All Rights Reserved. Practical Spectral Estimation 1 Introduction The goal of spectral estimation is to estimate how the
More information7.16 Discrete Fourier Transform
38 Signals, Systems, Transforms and Digital Signal Processing with MATLAB i.e. F ( e jω) = F [f[n]] is periodic with period 2π and its base period is given by Example 7.17 Let x[n] = 1. We have Π B (Ω)
More informationChap 2. Discrete-Time Signals and Systems
Digital Signal Processing Chap 2. Discrete-Time Signals and Systems Chang-Su Kim Discrete-Time Signals CT Signal DT Signal Representation 0 4 1 1 1 2 3 Functional representation 1, n 1,3 x[ n] 4, n 2 0,
More information1 1.27z z 2. 1 z H 2
E481 Digital Signal Processing Exam Date: Thursday -1-1 16:15 18:45 Final Exam - Solutions Dan Ellis 1. (a) In this direct-form II second-order-section filter, the first stage has
More informationUniversity of Connecticut Lecture Notes for ME5507 Fall 2014 Engineering Analysis I Part III: Fourier Analysis
University of Connecticut Lecture Notes for ME557 Fall 24 Engineering Analysis I Part III: Fourier Analysis Xu Chen Assistant Professor United Technologies Engineering Build, Rm. 382 Department of Mechanical
More informationStability Condition in Terms of the Pole Locations
Stability Condition in Terms of the Pole Locations A causal LTI digital filter is BIBO stable if and only if its impulse response h[n] is absolutely summable, i.e., 1 = S h [ n] < n= We now develop a stability
More informationTopic 3: Fourier Series (FS)
ELEC264: Signals And Systems Topic 3: Fourier Series (FS) o o o o Introduction to frequency analysis of signals CT FS Fourier series of CT periodic signals Signal Symmetry and CT Fourier Series Properties
More informationCorrelator I. Basics. Chapter Introduction. 8.2 Digitization Sampling. D. Anish Roshi
Chapter 8 Correlator I. Basics D. Anish Roshi 8.1 Introduction A radio interferometer measures the mutual coherence function of the electric field due to a given source brightness distribution in the sky.
More informationFourier Analysis and Spectral Representation of Signals
MIT 6.02 DRAFT Lecture Notes Last update: November 3, 2012 CHAPTER 13 Fourier Analysis and Spectral Representation of Signals We have seen in the previous chapter that the action of an LTI system on a
More informationFrequency Domain Speech Analysis
Frequency Domain Speech Analysis Short Time Fourier Analysis Cepstral Analysis Windowed (short time) Fourier Transform Spectrogram of speech signals Filter bank implementation* (Real) cepstrum and complex
More informationAspects of Continuous- and Discrete-Time Signals and Systems
Aspects of Continuous- and Discrete-Time Signals and Systems C.S. Ramalingam Department of Electrical Engineering IIT Madras C.S. Ramalingam (EE Dept., IIT Madras) Networks and Systems 1 / 45 Scaling the
More informationDiscrete-Time Fourier Transform
C H A P T E R 7 Discrete-Time Fourier Transform In Chapter 3 and Appendix C, we showed that interesting continuous-time waveforms x(t) can be synthesized by summing sinusoids, or complex exponential signals,
More informationEE-210. Signals and Systems Homework 7 Solutions
EE-20. Signals and Systems Homework 7 Solutions Spring 200 Exercise Due Date th May. Problems Q Let H be the causal system described by the difference equation w[n] = 7 w[n ] 2 2 w[n 2] + x[n ] x[n 2]
More informationQuestion Paper Code : AEC11T02
Hall Ticket No Question Paper Code : AEC11T02 VARDHAMAN COLLEGE OF ENGINEERING (AUTONOMOUS) Affiliated to JNTUH, Hyderabad Four Year B. Tech III Semester Tutorial Question Bank 2013-14 (Regulations: VCE-R11)
More informationSound 2: frequency analysis
COMP 546 Lecture 19 Sound 2: frequency analysis Tues. March 27, 2018 1 Speed of Sound Sound travels at about 340 m/s, or 34 cm/ ms. (This depends on temperature and other factors) 2 Wave equation Pressure
More information(Refer Slide Time: 01:28 03:51 min)
Digital Signal Processing Prof. S. C. Dutta Roy Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture 40 FIR Design by Windowing This is the 40 th lecture and our topic for
More informationCOMP Signals and Systems. Dr Chris Bleakley. UCD School of Computer Science and Informatics.
COMP 40420 2. Signals and Systems Dr Chris Bleakley UCD School of Computer Science and Informatics. Scoil na Ríomheolaíochta agus an Faisnéisíochta UCD. Introduction 1. Signals 2. Systems 3. System response
More informationDiscrete-Time Signals: Time-Domain Representation
Discrete-Time Signals: Time-Domain Representation 1 Signals represented as sequences of numbers, called samples Sample value of a typical signal or sequence denoted as x[n] with n being an integer in the
More informationLecture 4: FT Pairs, Random Signals and z-transform
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 4: T Pairs, Rom Signals z-transform Wed., Oct. 10, 2001 Prof: J. Bilmes
More informationDigital Signal Processing
DIGITAL SIGNAL PROCESSING SUBJECT CODE : NO. OF LECTURE HRS/WEEK : 04 TOTAL NO. OF LECTURE HRS. : 52 IA MARKS : 25 EXAM HOURS : 03 EXAMMARKS : 100 UNIT - 1 DISCRETE FOURIER TRANSFORMS (DFT): FREQUENCY
More informationELEN 4810 Midterm Exam
ELEN 4810 Midterm Exam Wednesday, October 26, 2016, 10:10-11:25 AM. One sheet of handwritten notes is allowed. No electronics of any kind are allowed. Please record your answers in the exam booklet. Raise
More informationBasic Design Approaches
(Classic) IIR filter design: Basic Design Approaches. Convert the digital filter specifications into an analog prototype lowpass filter specifications. Determine the analog lowpass filter transfer function
More informationAutomatic Speech Recognition (CS753)
Automatic Speech Recognition (CS753) Lecture 12: Acoustic Feature Extraction for ASR Instructor: Preethi Jyothi Feb 13, 2017 Speech Signal Analysis Generate discrete samples A frame Need to focus on short
More informationLecture 7 Discrete Systems
Lecture 7 Discrete Systems EE 52: Instrumentation and Measurements Lecture Notes Update on November, 29 Aly El-Osery, Electrical Engineering Dept., New Mexico Tech 7. Contents The z-transform 2 Linear
More informationDiscrete-Time Signals: Time-Domain Representation
Discrete-Time Signals: Time-Domain Representation 1 Signals represented as sequences of numbers, called samples Sample value of a typical signal or sequence denoted as x[n] with n being an integer in the
More informationDiscrete Time Fourier Transform
Discrete Time Fourier Transform Recall that we wrote the sampled signal x s (t) = x(kt)δ(t kt). We calculate its Fourier Transform. We do the following: Ex. Find the Continuous Time Fourier Transform of
More information