representation of speech
|
|
- Loraine Miller
- 5 years ago
- Views:
Transcription
1 Digital Speech Processing Lectures 7-8 Time Domain Methods in Speech Processing 1
2 General Synthesis Model voiced sound amplitude Log Areas, Reflection Coefficients, Formants, Vocal Tract Polynomial, l Articulatory Parameters, T 1 T 2 Rz ( ) = 1 α z 1 unvoiced sound amplitude Pitch Detection, Voiced/Unvoiced/Silence Detection, Gain Estimation, Vocal Tract Parameter Estimation, Glottal Pulse Shape, Radiation Model 2
3 speech, x[n] Overview h i Signal Processing representation of speech speech or music A(x,t) formants reflection coefficients voiced-unvoiced-silence pitch sounds of language speaker identification emotions time domain processing => direct operations on the speech waveform frequency domain processing => direct operations on a spectral representation of the signal x[n] simple processing system enables various types of feature estimation zero crossing rate level l crossing rate energy autocorrelation 3
4 P 1 P 2 V U/S Basics 8 khz sampled speech (bandwidth < 4 khz) properties of speech change with time excitation goes from voiced to unvoiced peak amplitude varies with the sound being produced pitch varies within and across voiced sounds periods of silence where background signals are seen the key issue is whether we can create simple time-domain processing methods that enable us to measure/estimate speech representations reliably and accurately 4
5 Fundamental Assumptions properties of the speech signal change relatively slowly l with time (5-10 sounds per second) over very short (5-20 msec) intervals => uncertainty due to small amount of data, varying pitch, varying amplitude over medium length ( msec) intervals => uncertainty due to changes in sound quality, transitions between sounds, rapid transients in speech over long ( msec) intervals => uncertainty due to large amount of sound changes there is always uncertainty in short time measurements and estimates from speech signals 5
6 Compromise Solution short-time processing methods => short segments of the speech signal are isolated and processed as if they were short segments from a sustained sound with fixed (non-time-varying) propertiesp this short-time processing is periodically repeated for the duration of the waveform these short analysis segments, or analysis frames often overlap one another the results of short-time processing can be a single number (e.g., an estimate of the pitch period within the frame), or a set of numbers (an estimate of the formant frequencies for the analysis frame) the end result of the processing is a new, time-varying sequence that serves as a new representation of the speech signal 6
7 Frame-by-Frame Processing in Successive Windows Frame 1 Frame 2 Frame 3 Frame 4 Frame 5 75% frame overlap => frame length=l, frame shift=r=l/4 Frame1={x[0],x[1],,x[L-1]} 1]} Frame2={x[R],x[R+1],,x[R+L-1]} x[r+1] x[r+l-1]} Frame3={x[2R],x[2R+1],,x[2R+L-1]} 1]} 7
8 Frame 1: samples 0,1,..., L 1 Frame 2: samples RR, + 1,..., R + L 1 Frame 3: samples 2 R,2R+ 1,...,2R+ L 1 Frame 4: samples 3 R,3R+ 1,...,3R+ L 1
9 Frame-by-Frame Processing in Successive Windows Frame 1 Frame 2 Frame 3 Frame 4 50% frame overlap Speech is processed frame-by-frame in overlapping intervals until entire region of speech is covered by at least one such frame Results of analysis of individual frames used to derive model parameters in some manner Representation goes from time sample x[ n], n =,0,1, 2, to parameter vector f[ m], m = 0,1, 2, where n is the time index and m is the frame index. 9
10 Frames and Windows F S = 16, 000 samples/second L = 641 samples (equivalent to 40 msec frame (window) length) R = 240 samples (equivalent to 15 msec frame (window) shift) Frame rate of 66.7 frames/second 10
11 Short-Time Processing speech waveform, x[n] short-time processing speech representation, f[m] i x [ n ] = samples at 8000/sec rate; (e.g. 2 seconds of 4 khz bandlimited speech, xn [ ], 0 n 16000) i f [ m ] = f [ m ], f [ m ],..., f [ m] = vectors at 100/sec rate, 1 m 200, { } 1 2 L L is the size of the analysis vector (e.g., 1 for pitch period estimate, 12 for autocorrelation estimates, etc) 11
12 Generic Short-Time Processing Q ˆ ( [ ]) n = T x m w [ n m] m = n= nˆ x[n] T(x[n]) T( ) w[n] ~ Qˆn linear or non-linear transformation window sequence (usually finite length) Qˆn is a sequence of local weighted average values of the sequence T(x[n]) at time ˆ n = n 12
13 Short-Time Energy E = x 2 [ m ] m= -- this is the long term definition of signal energy -- there is little or no utility of this definition for time-varying signals nˆ 2 Enˆ = x m m= nˆ N+ 1 [ ] -- short-time energy in vicinity of time nˆ 2 T ( x ) = x wn [ ] = 1 0 n N 1 = 0 otherwise 2 2 = x [ nˆ N + 1] x [ nˆ] 13
14 Computation of Short-Time Energy wn [ m] window jumps/slides across sequence of squared values, selecting interval for processing E ˆn E ˆn what happens to Eˆn as sequence jumps by 2,4,8,...,L samples ( is a lowpass function so it can be decimated without lost of information; why is lowpass?) effects of decimation depend on L; if L is small, then is a lot more variable than if L is large (window bandwidth changes with L!) E ˆn 14
15 Effects of Window Qˆ = ( [ ]) n T x n w[ n] = = x [ n] w [ n] = ˆ n nˆ wn [ ] serves as a lowpass filter on T ([]) x n which often has a lot of high frequencies (most non-linearities introduce significant high frequency energy think of what ( x[ n] x[ n] ) does in frequency) often we extend the definition iti of Qˆn to include a pre-filtering i term so that x[ n] itself is filtered to a region of interest n n xˆ[ n] x[ n ] T([]) x n nˆ n n nˆ T ( ) wn [ ] Linear Filter Q = Q = 15
16 Short-Time Energy serves to differentiate voiced and unvoiced sounds in speech from silence (background signal) natural definition of energy of weighted signal is: 2 E ˆ nˆ = xmwn [ ] [ m ] (sum or squares of portion of signal) m= -- concentrates measurement at sample nˆ, using weighting w [ n-m ˆ ] x[n] FS E ˆ ˆ ˆ = x [ m] w [ n m] = x [ m] h[ n m] n m= hn w n 2 [ ] = [ ] x 2 [n] S m= short time energy Enˆ = E n n = nˆ ( ) 2 h[n] F F / R S 16
17 Short-Time Energy Properties depends on choice of h[n], or equivalently, ~ window w[n] [ ] if w[n] duration very long and constant amplitude ~ (w[n]=1,, n=0,1,...,l-1),,, E n would not change much over time, and would not reflect the short-time amplitudes of the sounds of the speech very long duration windows correspond to narrowband lowpass filters want E n to change at a rate comparable to the changing sounds of the speech => this is the essential conflict in all speech processing, namely we need short duration window to be responsive to rapid sound changes, but short windows will not provide sufficient averaging to give smooth and reliable energy function 17
18 Windows ~ consider two windows, w[n] rectangular window: h[n]=1, 0 n L-1 and 0 otherwise Hamming window (raised cosine window): h[n]= cos(2πn/(l-1)), 0 n L-1 and 0 otherwise rectangular window gives equal weight to all L samples in the window (n,...,n-l+1) Hamming window gives most weight to middle samples and tapers off strongly at the beginning and the end of the window 18
19 Rectangular and Hamming Windows L = 21 samples 19
20 Window Frequency Responses rectangular window He ( ) = sin( ΩLT / 2) e sin( ΩTT / 2 ) jωt jωt( L 1)/ 2 first zero occurs at f=f s /L=1/(LT) (or Ω=(2π)/(LT)) => nominal cutoff frequency of the equivalent lowpass filter Hamming window w [ n ] = 0.54 w [ n ] 0.46*cos(2 π n/( L 1)) w [ n ] H R R can decompose Hamming Window FR into combination of three terms 20
21 RW and HW Frequency Responses log magnitude response of RW and HW bandwidth of HW is approximately twice the bandwidth of RW attenuation of more than 40 db for HW outside passband, versus 14 db for RW stopband attenuation is essentially independent of L, the window duration => increasing L simply decreases window bandwidth L needs to be larger than a pitch period (or severe fluctuations will occur in E n ), but smaller than a sound duration (or E n will not adequately reflect the changes in the speech signal) There is no perfect value of L, since a pitch period can be as short as 20 samples (500 Hz at a 10 khz sampling rate) for a high pitch child or female, and up to 250 samples (40 Hz pitch at a 10 khz sampling rate) for a low pitch male; a compromise value of L on the order of samples for a 10 khz sampling 21 rate is often used in practice
22 Window Frequency Responses Rectangular Windows, L=21,41,61,81,101 Hamming Windows, L=21,41,61,81,101 22
23 Short-Time Energy i i i Short-time energy computation: E = ([ xmwn ][ ˆ m ]) nˆ m= = xm wn ˆ m m= 2 ([ ]) [ ] For L-point rectangular window, wm [ ] = 1, m= 0,1,..., L 1 giving g E nˆ nˆ = m= nˆ L+ 1 ([ x m])
24 Short-Time Energy using RW/HW E ˆn E ˆn L=51 L=51 L=101 L=101 L=201 L=201 L=401 L=401 as L increases, the plots tend to converge (however you are smoothing sound energies) short-time time energy provides the basis for distinguishing voiced from unvoiced speech regions, and for medium-to-high SNR recordings, can even be used to find regions of silence/background signal 24
25 Short-Time Energy for AGC Can use an IIR filter to define short-time time energy, e.g., time-dependent energy definition 2 2 σ [ n] = x [ m] h[ n m]/ h[ m] m= m= 0 consider impulse response of filter of form n 1 n 1 = = hn [ ] α un [ 1] α n 1 = 0 n < n m 1 m= σ [ n] = ( 1 α) x [ m] α u[ n m 1] 25
26 Recursive Short-Time Energy i un [ m 1] implies the condition n m 1 0 or m n 1 giving i 2 1 n 2 n m m= σ [ n] = ( 1 α) x [ m] α = ( 1 α)( x [ n 1] + αx [ n 2] +...) i for the index n 1 we have n n m σ [ n 1 ] = ( 1 α ) x [ m ] α = ( 1 α )( x [ n 2 ] + αx [ n 3 ] +...) m= i thus giving the relationship i σ [ n ] = α σ [ n 1 ] + x [ n 1 ]( 1 α ) and defines an Automatic Gain Control (AGC) of the form Gn [ ] = G 0 σ [ n] 26
27 Recursive Short-Time Energy x[n] 2 2 n x [ ] + ( ) z 1 ( 1 α) + z 1 σ 2 [ n ] α σ [ n] = α σ [ n 1] + x [ n 1]( 1 α) 27
28 Recursive Short-Time Energy 28
29 Use of Short-Time Energy for AGC 29
30 Use of Short-Time Energy for AGC α = 0.9 α =
31 Short-Time Magnitude short-time time energy is very sensitive to large signal levels due to x 2 [n] terms consider a new definition of pseudo-energy based on average signal magnitude (rather than energy) m= M ˆ = [ ] [ ˆ n xm wn m] weighted sum of magnitudes, rather than weighted sum of squares M = M = x[n] x[n] nˆ n n nˆ wn [ ] F F F / S computation avoids multiplications of signal with itself (the squared term) S S R 31
32 Short-Time Magnitudes M M ˆn ˆn L=51 L=51 L=101 L=101 L=201 L=201 L=401 L=401 differences between E n and M n noticeable in unvoiced regions dynamic range of M n ~ square root (dynamic range of E n ) => level differences between voiced and unvoiced segments are smaller E n and M n can be sampled at a rate of 100/sec for window durations of 20 msec or so => efficient representation of signal energy/magnitude 32
33 Short Time Energy and Magnitude Rectangular Window E ˆn M ˆn L=51 L=51 L=101 L=101 L=201 L=201 L=401 L=401 33
34 Short Time Energy and Magnitude Hamming Window E ˆn L=51 M ˆn L=51 L=101 L=101 L=201 L=201 L=401 L=401 34
35 Other Lowpass Windows can replace RW or HW with any lowpass filer window should be positive since this guarantees E n and M n will be positive FIR windows are efficient computationally since they can slide by L samples for efficiency with no loss of information (what should L be?) can even use an infinite duration window if its z-transform is a rational function, i.e., n hn [ ] = a, n 0, 0< a< 1 = 0 n < 0 1 Hz ( ) = 1 1 az z > a 35
36 Other Lowpass Windows this simple lowpass filter can be used to implement E n and M n recursively as: 2 En = ae n 1 + ( 1 ax ) [ n ] short-time ti energy M = am + ( 1 a) x[ n] short-time magnitude n n 1 need to compute E n or M n every sample and then down-sample to 100/sec rate recursive computation has a non-linear phase, so delay cannot be compensated exactly 36
37 Short-Time Average ZC Rate zero crossing => successive samples have different algebraic signs zero crossings zero crossing rate is a simple measure of the frequency content of a signal especially true for narrowband signals (e.g., sinusoids) sinusoid at frequency F 0 with sampling rate F S has F S /F 0 samples per cycle with two zero crossings per cycle, giving an average zero crossing rate of z 1 =(2) crossings/cycle x (F 0 / F S ) cycles/sample z 1 =2F 0 /F S crossings/sample (i.e., z 1 proportional to F 0 ) z M =M (2F 0 /F S ) crossings/(m samples) 37
38 Sinusoid Zero Crossing Rates Assume the sampling rate is F = 10, 000 Hz 1. F = 100 Hz sinusoid has F / F = 10, 000 / 100 = 100 samples/cycle; 0 S 0 or z = 2 / 100 crossings/sample, or z = 2 / 100 * 100 = crossings/10 msec interval S 2. F = 1000 Hz sinusoid has F / F0 = 10, 000 / 1000 = 10 samples/cycle; 0 S 0 or z = 2 / 10 crossings/sample, or z = 2 / 10 * 100 = crossings/10 msec interval 3. F = 5000 Hz sinusoid has F / F = 10, 000 / 5000 = 2 samples/cycle; 0 S 0 or z = 2/ 2 crossings/sample, or z100 = 2 / 2 * 100 = crossings/10 msec interval 38
39 Zero Crossing for Sinusoids 1 offset:0.75, 100 Hz sinewave, ZC:9, offset sinewave, ZC:8 100 Hz sinewave ZC= Offset= Hz sinewave with dc offset 1 ZC=
40 Zero Crossings for Noise offseet:0.75, random noise, ZC:252, offset noise, ZC:122 3 random gaussian noise 2 1 ZC= Offset=0.75 random gaussian noise with dc offset 2 ZC=
41 ZC Rate Definitions i nˆ 1 Zˆ = sgn( [ ]) sgn( [ 1]) [ ˆ n x m x m w n m] 2L eff m= nˆ L+ 1 sgn( x [ n ]) = 1 x [ n ] 0 = 1 xn [ ] < 0 simple rectangular window: w [ n] = 1 0 n L 1 = 0 otherwise L eff = L Same form for Z as for E or M nˆ nˆ nˆ 41
42 ZC Normalization i i The formal definition iti of z is: nˆ 1 Zn ˆ = z1 = sgn( x[ m]) sgn( x[ m 1]) L 2 m= nˆ L+ 1 n is interpreted as the number of zero crossings per sample. For most practical applications, we need the rate of zero crossings per fixed interval of M samples, which is z = z M = rate of zero crossings per M sample interval M 1 Thus, for an interval of τ sec., corresponding to M samples we get z = z M M = F = τ / T M 1 ; τ S 42
43 ZC Normalization i For a 1000 Hz sinewave as input, using a 40 msec window length ( L), with various values of sampling rate ( F S ), we get the following: F L z M z S / / / M i Thus we see that the normalized (per interval) zero crossing rate, z M, is independent of the sampling rate and can be used as a measure of the dominant energy in a band. 43
44 ZC and Energy Computation Hamming window with duration L=201 samples (12.5 msec at Fs=16 khz) Hamming window with duration L=401 samples (25 msec at Fs=16 khz) 44
45 ZC Rate Distributions Unvoiced Speech: the dominant energy component is at about 2.5 khz 1 KHz 2KHz 3KHz 4KHz Voiced Speech: the dominant energy component is at about 700 Hz for voiced speech, energy is mainly below 1.5 khz for unvoiced speech, energy is mainly above 1.5 khz mean ZC rate for unvoiced speech is 49 per 10 msec interval mean ZC rate for voiced speech is 14 per 10 msec interval 45
46 ZC Rates for Speech 15 msec windows 100/sec sampling rate on ZC computation 46
47 Short-Time Energy, Magnitude, ZC 47
48 Issues in ZC Rate Computation for zero crossing rate to be accurate, need zero DC in signal => need to remove offsets, hum, noise => use bandpass filter to eliminate DC and hum can quantize the signal to 1-bit for computation of ZC rate can apply the concept of ZC rate to bandpass filtered speech to give a crude spectral estimate in narrow bands of speech (kind of gives an estimate of the strongest frequency in each narrow band of speech) 48
49 Summary of Simple Time Domain Measures sn ( ) Linear Filter nˆ 1. Energy: x( n) Q = T( x[ m]) w [ nˆ m] m= nˆ 2 E ˆ nˆ = x m w n m m= nˆ L+ 1 [ ] [ ] T[ ] T( x[ n]) wn [ ] i can downsample Enˆ at rate commensurate with window bandwidth 2. Magnitude: nˆ nˆ M = x[ m] w [ nˆ m] nˆ 1 m= nˆ L Zero Crossing Rate: nˆ Z = z = sgn( x[ m]) sgn( x[ m 1]) w [ nˆ m] m= nˆ L+ 1 where sgn( xm [ ]) = 1 xm [ ] 0 = 1 xm [ ] < 0 Qˆn 49
50 Short-Time Autocorrelation -for a deterministic signal, the autocorrelation function is defined as: Φ[ k] = x[ m] x[ m+ k] m= -for a random or periodic signal, the autocorrelation function is: L 1 Φ[ k] = lim x[ m] x[ m+ k] N ( 2L + 1) m= L - if x [ n] = x[ n+ P], then Φ[ k] = Φ[ k + P], => the autocorrelation function preserves periodicity -properties of Φ[ k] : 1. Φ[ k] is even, Φ[ k] = Φ[ k] 2. Φ[ k] is maximum at k = 0, Φ[ k] Φ[ 0], k 3. Φ [ 0 ] is the signal energy or power (for random signals) 50
51 Periodic Signals for a periodic signal we have (at least in theory) Φ[P]=Φ[0] so the period of a periodic signal can be estimated as the first non-zero maximum of Φ[k] this means that the autocorrelation function is a good candidate for speech pitch detection algorithms it also means that we need a good way of measuring the short-time autocorrelation function for speech signals 51
52 Short-Time Autocorrelation - a reasonable definition for the short-time autocorrelation is: R [ k] = x[ m] w[ nˆ m] x[ m+ k] w [ nˆ k m] nˆ m= 1. select a segment of speech by windowing 2. compute deterministic autocorrelation of the windowed speech R [ k] = R [ k] - symmetry nˆ nˆ = x [ mxm ] [ k ] wn [ ˆ mwn ] [ ˆ + k m ] m= - define filter of the form w [ nˆ] = w [ nˆ] w [ nˆ + k] k - this enables us to write the short-time autocorrelation in the form: R [ k] = x[ m] x[ m k] w [ nˆ m] nˆ m= th - the value of w [ k] at time nˆ for the k lag is obtained by filtering nˆ k the sequence x [ nxn ˆ ] [ ˆ k ] with a filter wit hi impulse response w [ nˆ ] k 52
53 Short-Time Autocorrelation R ˆ ˆ ˆ[ ] = [ ] [ ] [ + ] n k xmwn m xm kwn [ k m] m= N-L+1 n+k-l+1 L 1 k R ˆ ˆ ˆ[ ] = [ + ] [ ] [ + + ] n k x n mw m x n m k w [ k + m] m= 0 L k points used to compute R [ k ] n ˆ 53
54 Short-Time Autocorrelation 54
55 Examples of Autocorrelations autocorrelation peaks occur at k=72, 144,... => 140 Hz pitch Φ(P)<Φ(0) since windowed speech is not perfectly periodic over a 401 sample window (40 msec of signal), pitch period changes occur, so P is not perfectly defined much less clear estimates of periodicity since HW tapers signal so strongly, making it look like a non-periodic signal 55 no strong peak for unvoiced speech
56 Voiced (female) L=401 (magnitude) T 0 T 0 0 = N T t = nt F = 0 1 T 0 F / F 56 s
57 Voiced (female) L=401 (log mag) T 0 t = nt T 0 F = 0 1 T 0 F / F 57 s
58 Voiced (male) L=401 T 0 T 0 3F F = 0 3 T 0 58
59 Unvoiced L=401 59
60 Unvoiced L=401 60
61 Effects of Window Size choice of L, window duration small L so pitch period almost constant in window L=401 L=251 L=125 large L so clear periodicity seen in window as k increases, the number of window points decrease, reducing the accuracy and size of R n (k) for large k => have a taper of the type R(k)=1-k/L, k <L shaping of autocorrelation (this is the autocorrelation of size L rectangular window) allow L to vary with detected pitch periods (so that at least 2 full periods are included) 61
62 Modified Autocorrelation want to solve problem of differing number of samples for each different k term in Rn ˆ[ k], so modify definition as follows: Rˆ ˆ[ ] = [ ] ˆ ˆ 1[ ] [ + ] n k x m w n m x m k w2[ n m k] m= - where w is standard L-point window, and w is extended window 1 2 of duration L + K samples, where K is the largest lag of interest - we can rewrite modified autocorrelation as: Rˆ [ k] = x[ nˆ + m] wˆ [ m] x[ nˆ + m+ k] wˆ [ m+ k] nˆ m= where wˆ [ m] = w [ m] and wˆ [ m] = w [ m] for rectangular windows we choose the following: -giving Rˆ nˆ wˆ [ m ] = 1, 0 m L 1 1 wˆ [ m] = 1, 0 m L 1+ K 2 1 L m= 0 [ k ] = x [ nˆ + m ] x [ nˆ + m + k ], 0 k K - always use L samples in computation of Rˆ [ k] k nˆ 62
63 Examples of Modified Autocorrelation L-1 L+K-1 - Rˆ [ k] is a cross-correlation, not an auto-correlation n - Rˆ [ k] Rˆ [ k] n n - Rˆ [ k] will have a strong peak at k = P for periodic signals n and will not fall off for large k 63
64 Examples of Modified Autocorrelation 64
65 Examples of Modified AC L=401 L=401 L=401 L=251 L=401 L=125 Modified Autocorrelations fixed value of L=401 Modified Autocorrelations values of L=401,251,125 65
66 Short-Time AMDF - belief that for periodic signals of period P, the difference function dn [ ] = xn [ ] xn [ k ] - will be approximately zero for k = 0, ± P, ± 2P,... For realistic speech signals, dn [ ] will be small at k= P--but not zero. Based on this reasoning. the short-time Average Magnitude Difference Function (AMDF) is defined as: k ˆ ˆ ˆ = x n + m w m x n + m k w m k n 1 2 m= γ [ ] [ ] [ ] [ ] [ ] - with w [ m] and w [ m] being rectangular windows. If both are the same 1 2 length, then γ n [ k] is similar to the short-time autocorrelation, whereas ˆ if w [ m] is longer than w [ m], then γ [ k] is similar to the modified short-time 2 1 nˆ autocorrelation (or covariance) function. In fact it can be shown that 12 / γ 2 ˆ 0 ˆ ˆ[ ] β[ ] ˆ[ ] ˆ[ ] n k k Rn Rn k - where β[ k] varies between 0.6 and 1.0 for different segments of speech. 66
67 AMDF for Speech Segments 67
68 Summary Short-time time parameters in the time domain: short-time energy short-time average magnitude short-time ti zero crossing rate short-time autocorrelation modified short-time autocorrelation Short-time average magnitude difference function 68
Chapter 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 informationconvenient means to determine response to a sum of clear evidence of signal properties that are obscured in the original signal
Digital Speech Processing Lecture 9 Short-Time Fourier Analysis Methods- Introduction 1 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)
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 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 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 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 informationLab 9a. Linear Predictive Coding for Speech Processing
EE275Lab October 27, 2007 Lab 9a. Linear Predictive Coding for Speech Processing Pitch Period Impulse Train Generator Voiced/Unvoiced Speech Switch Vocal Tract Parameters Time-Varying Digital Filter H(z)
More informationDigital 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 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 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 informationLinear Prediction Coding. Nimrod Peleg Update: Aug. 2007
Linear Prediction Coding Nimrod Peleg Update: Aug. 2007 1 Linear Prediction and Speech Coding The earliest papers on applying LPC to speech: Atal 1968, 1970, 1971 Markel 1971, 1972 Makhoul 1975 This is
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 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 informationFilter structures ELEC-E5410
Filter structures ELEC-E5410 Contents FIR filter basics Ideal impulse responses Polyphase decomposition Fractional delay by polyphase structure Nyquist filters Half-band filters Gibbs phenomenon Discrete-time
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 informationChapter 7: IIR Filter Design Techniques
IUST-EE Chapter 7: IIR Filter Design Techniques Contents Performance Specifications Pole-Zero Placement Method Impulse Invariant Method Bilinear Transformation Classical Analog Filters DSP-Shokouhi Advantages
More informationFilter Banks II. Prof. Dr.-Ing. G. Schuller. Fraunhofer IDMT & Ilmenau University of Technology Ilmenau, Germany
Filter Banks II Prof. Dr.-Ing. G. Schuller Fraunhofer IDMT & Ilmenau University of Technology Ilmenau, Germany Page Modulated Filter Banks Extending the DCT The DCT IV transform can be seen as modulated
More informationFeature extraction 2
Centre for Vision Speech & Signal Processing University of Surrey, Guildford GU2 7XH. Feature extraction 2 Dr Philip Jackson Linear prediction Perceptual linear prediction Comparison of feature methods
More informationL7: Linear prediction of speech
L7: Linear prediction of speech Introduction Linear prediction Finding the linear prediction coefficients Alternative representations This lecture is based on [Dutoit and Marques, 2009, ch1; Taylor, 2009,
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 informationLECTURE NOTES IN AUDIO ANALYSIS: PITCH ESTIMATION FOR DUMMIES
LECTURE NOTES IN AUDIO ANALYSIS: PITCH ESTIMATION FOR DUMMIES Abstract March, 3 Mads Græsbøll Christensen Audio Analysis Lab, AD:MT Aalborg University This document contains a brief introduction to pitch
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 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 informationOversampling Converters
Oversampling Converters David Johns and Ken Martin (johns@eecg.toronto.edu) (martin@eecg.toronto.edu) slide 1 of 56 Motivation Popular approach for medium-to-low speed A/D and D/A applications requiring
More informationDiscrete-Time David Johns and Ken Martin University of Toronto
Discrete-Time David Johns and Ken Martin University of Toronto (johns@eecg.toronto.edu) (martin@eecg.toronto.edu) University of Toronto 1 of 40 Overview of Some Signal Spectra x c () t st () x s () t xn
More informationL8: Source estimation
L8: Source estimation Glottal and lip radiation models Closed-phase residual analysis Voicing/unvoicing detection Pitch detection Epoch detection This lecture is based on [Taylor, 2009, ch. 11-12] Introduction
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 informationFourier Series Representation of
Fourier Series Representation of Periodic Signals Rui Wang, Assistant professor Dept. of Information and Communication Tongji University it Email: ruiwang@tongji.edu.cn Outline The response of LIT system
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 informationLINEAR-PHASE FIR FILTERS DESIGN
LINEAR-PHASE FIR FILTERS DESIGN Prof. Siripong Potisuk inimum-phase Filters A digital filter is a minimum-phase filter if and only if all of its zeros lie inside or on the unit circle; otherwise, it is
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 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 information3GPP TS V6.1.1 ( )
Technical Specification 3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Speech codec speech processing functions; Adaptive Multi-Rate - Wideband (AMR-WB)
More informationCOMP 546, Winter 2018 lecture 19 - sound 2
Sound waves Last lecture we considered sound to be a pressure function I(X, Y, Z, t). However, sound is not just any function of those four variables. Rather, sound obeys the wave equation: 2 I(X, Y, Z,
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 informationCMPT 889: Lecture 3 Fundamentals of Digital Audio, Discrete-Time Signals
CMPT 889: Lecture 3 Fundamentals of Digital Audio, Discrete-Time Signals Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University October 6, 2005 1 Sound Sound waves are longitudinal
More informationMethods for Synthesizing Very High Q Parametrically Well Behaved Two Pole Filters
Methods for Synthesizing Very High Q Parametrically Well Behaved Two Pole Filters Max Mathews Julius O. Smith III Center for Computer Research in Music and Acoustics (CCRMA) Department of Music, Stanford
More informationImproved Method for Epoch Extraction in High Pass Filtered Speech
Improved Method for Epoch Extraction in High Pass Filtered Speech D. Govind Center for Computational Engineering & Networking Amrita Vishwa Vidyapeetham (University) Coimbatore, Tamilnadu 642 Email: d
More information# FIR. [ ] = b k. # [ ]x[ n " k] [ ] = h k. x[ n] = Ae j" e j# ˆ n Complex exponential input. [ ]Ae j" e j ˆ. ˆ )Ae j# e j ˆ. y n. y n.
[ ] = h k M [ ] = b k x[ n " k] FIR k= M [ ]x[ n " k] convolution k= x[ n] = Ae j" e j ˆ n Complex exponential input [ ] = h k M % k= [ ]Ae j" e j ˆ % M = ' h[ k]e " j ˆ & k= k = H (" ˆ )Ae j e j ˆ ( )
More informationMultirate signal processing
Multirate signal processing Discrete-time systems with different sampling rates at various parts of the system are called multirate systems. The need for such systems arises in many applications, including
More informationLinear Prediction 1 / 41
Linear Prediction 1 / 41 A map of speech signal processing Natural signals Models Artificial signals Inference Speech synthesis Hidden Markov Inference Homomorphic processing Dereverberation, Deconvolution
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 informationComputer-Aided Design of Digital Filters. Digital Filters. Digital Filters. Digital Filters. Design of Equiripple Linear-Phase FIR Filters
Computer-Aided Design of Digital Filters The FIR filter design techniques discussed so far can be easily implemented on a computer In addition, there are a number of FIR filter design algorithms that rely
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 informationCast of Characters. Some Symbols, Functions, and Variables Used in the Book
Page 1 of 6 Cast of Characters Some s, Functions, and Variables Used in the Book Digital Signal Processing and the Microcontroller by Dale Grover and John R. Deller ISBN 0-13-081348-6 Prentice Hall, 1998
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 informationTime-domain representations
Time-domain representations Speech Processing Tom Bäckström Aalto University Fall 2016 Basics of Signal Processing in the Time-domain Time-domain signals Before we can describe speech signals or modelling
More informationLecture 3 - Design of Digital Filters
Lecture 3 - Design of Digital Filters 3.1 Simple filters In the previous lecture we considered the polynomial fit as a case example of designing a smoothing filter. The approximation to an ideal LPF can
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 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 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 informationA Spectral-Flatness Measure for Studying the Autocorrelation Method of Linear Prediction of Speech Analysis
A Spectral-Flatness Measure for Studying the Autocorrelation Method of Linear Prediction of Speech Analysis Authors: Augustine H. Gray and John D. Markel By Kaviraj, Komaljit, Vaibhav Spectral Flatness
More informationEE482: Digital Signal Processing Applications
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu EE482: Digital Signal Processing Applications Spring 2014 TTh 14:30-15:45 CBC C222 Lecture 11 Adaptive Filtering 14/03/04 http://www.ee.unlv.edu/~b1morris/ee482/
More informationETSI TS V7.0.0 ( )
TS 6 9 V7.. (7-6) Technical Specification Digital cellular telecommunications system (Phase +); Universal Mobile Telecommunications System (UMTS); Speech codec speech processing functions; Adaptive Multi-Rate
More informationDISCRETE-TIME SIGNAL PROCESSING
THIRD EDITION DISCRETE-TIME SIGNAL PROCESSING ALAN V. OPPENHEIM MASSACHUSETTS INSTITUTE OF TECHNOLOGY RONALD W. SCHÄFER HEWLETT-PACKARD LABORATORIES Upper Saddle River Boston Columbus San Francisco New
More informationApplications of Linear Prediction
SGN-4006 Audio and Speech Processing Applications of Linear Prediction Slides for this lecture are based on those created by Katariina Mahkonen for TUT course Puheenkäsittelyn menetelmät in Spring 03.
More informationCMPT 889: Lecture 5 Filters
CMPT 889: Lecture 5 Filters Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University October 7, 2009 1 Digital Filters Any medium through which a signal passes may be regarded
More informationDigital Filters. Linearity and Time Invariance. Linear Time-Invariant (LTI) Filters: CMPT 889: Lecture 5 Filters
Digital Filters CMPT 889: Lecture 5 Filters Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University October 7, 29 Any medium through which a signal passes may be regarded as
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 informationGeneral Synthesis Model. Time Domain Methods in Speech Processing. General Analysis Model. Overview. Basics. Fundamental Assumptions
Geeral ythesis Model Digital peech Processig Lectures 7-8 T T voiced soud amplitude Log Areas, Reflectio Coefficiets, Formats, Vocal Tract Polyomial, Articulatory Parameters, Time Domai Methods i peech
More informationLECTURE 3 CMOS PHASE LOCKED LOOPS
Lecture 03 (8/9/18) Page 3-1 LECTURE 3 CMOS PHASE LOCKED LOOPS Topics The acquisition process unlocked state Noise in linear PLLs Organization: Systems Perspective Types of PLLs and PLL Measurements PLL
More informationPrinciples of Communications Lecture 8: Baseband Communication Systems. Chih-Wei Liu 劉志尉 National Chiao Tung University
Principles of Communications Lecture 8: Baseband Communication Systems Chih-Wei Liu 劉志尉 National Chiao Tung University cwliu@twins.ee.nctu.edu.tw Outlines Introduction Line codes Effects of filtering Pulse
More informationCEPSTRAL ANALYSIS SYNTHESIS ON THE MEL FREQUENCY SCALE, AND AN ADAPTATIVE ALGORITHM FOR IT.
CEPSTRAL ANALYSIS SYNTHESIS ON THE EL FREQUENCY SCALE, AND AN ADAPTATIVE ALGORITH FOR IT. Summarized overview of the IEEE-publicated papers Cepstral analysis synthesis on the mel frequency scale by Satochi
More informationNoise Robust Isolated Words Recognition Problem Solving Based on Simultaneous Perturbation Stochastic Approximation Algorithm
EngOpt 2008 - International Conference on Engineering Optimization Rio de Janeiro, Brazil, 0-05 June 2008. Noise Robust Isolated Words Recognition Problem Solving Based on Simultaneous Perturbation Stochastic
More informationUNIT - III PART A. 2. Mention any two techniques for digitizing the transfer function of an analog filter?
UNIT - III PART A. Mention the important features of the IIR filters? i) The physically realizable IIR filters does not have linear phase. ii) The IIR filter specification includes the desired characteristics
More informationIntroduction to Digital Signal Processing
Introduction to Digital Signal Processing 1.1 What is DSP? DSP is a technique of performing the mathematical operations on the signals in digital domain. As real time signals are analog in nature we need
More informationLab 4: Quantization, Oversampling, and Noise Shaping
Lab 4: Quantization, Oversampling, and Noise Shaping Due Friday 04/21/17 Overview: This assignment should be completed with your assigned lab partner(s). Each group must turn in a report composed using
More informationOn the Frequency-Domain Properties of Savitzky-Golay Filters
On the Frequency-Domain Properties of Savitzky-Golay Filters Ronald W Schafer HP Laboratories HPL-2-9 Keyword(s): Savitzky-Golay filter, least-squares polynomial approximation, smoothing Abstract: This
More informationINTERNATIONAL TELECOMMUNICATION UNION. Wideband coding of speech at around 16 kbit/s using Adaptive Multi-Rate Wideband (AMR-WB)
INTERNATIONAL TELECOMMUNICATION UNION ITU-T TELECOMMUNICATION STANDARDIZATION SECTOR OF ITU G.722.2 (07/2003) SERIES G: TRANSMISSION SYSTEMS AND MEDIA, DIGITAL SYSTEMS AND NETWORKS Digital terminal equipments
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 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 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 informationAnalysis of Finite Wordlength Effects
Analysis of Finite Wordlength Effects Ideally, the system parameters along with the signal variables have infinite precision taing any value between and In practice, they can tae only discrete values within
More informationDepartment of Electrical and Computer Engineering Digital Speech Processing Homework No. 7 Solutions
Problem 1 Department of Electrical and Computer Engineering Digital Speech Processing Homework No. 7 Solutions Linear prediction analysis is used to obtain an eleventh-order all-pole model for a segment
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 informationAcoustic Research Institute ARI
Austrian Academy of Sciences Acoustic Research Institute ARI System Identification in Audio Engineering P. Majdak piotr@majdak.com Institut für Schallforschung, Österreichische Akademie der Wissenschaften;
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 informationDSP Design Lecture 2. Fredrik Edman.
DSP Design Lecture Number representation, scaling, quantization and round-off Noise Fredrik Edman fredrik.edman@eit.lth.se Representation of Numbers Numbers is a way to use symbols to describe and model
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 informationLecture 4 - Spectral Estimation
Lecture 4 - Spectral Estimation The Discrete Fourier Transform The Discrete Fourier Transform (DFT) is the equivalent of the continuous Fourier Transform for signals known only at N instants separated
More informationProc. of NCC 2010, Chennai, India
Proc. of NCC 2010, Chennai, India Trajectory and surface modeling of LSF for low rate speech coding M. Deepak and Preeti Rao Department of Electrical Engineering Indian Institute of Technology, Bombay
More informationSHOCK AND VIBRATION RESPONSE SPECTRA COURSE Unit 7A. Power Spectral Density Function
SHOCK AND VIBRATION RESPONSE SPECTRA COURSE Unit 7A. Power Spectral Density Function By Tom Irvine Introduction A Fourier transform by itself is a poor format for representing random vibration because
More informationA FAST AND ACCURATE ADAPTIVE NOTCH FILTER USING A MONOTONICALLY INCREASING GRADIENT. Yosuke SUGIURA
A FAST AND ACCURATE ADAPTIVE NOTCH FILTER USING A MONOTONICALLY INCREASING GRADIENT Yosuke SUGIURA Tokyo University of Science Faculty of Science and Technology ABSTRACT In this paper, we propose a new
More informationFinite Word Length Effects and Quantisation Noise. Professors A G Constantinides & L R Arnaut
Finite Word Length Effects and Quantisation Noise 1 Finite Word Length Effects Finite register lengths and A/D converters cause errors at different levels: (i) input: Input quantisation (ii) system: Coefficient
More informationModule 4. Signal Representation and Baseband Processing. Version 2 ECE IIT, Kharagpur
Module Signal Representation and Baseband Processing Version ECE II, Kharagpur Lesson 8 Response of Linear System to Random Processes Version ECE II, Kharagpur After reading this lesson, you will learn
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 informationDigital Signal Processing
COMP ENG 4TL4: Digital Signal Processing Notes for Lecture #24 Tuesday, November 4, 2003 6.8 IIR Filter Design Properties of IIR Filters: IIR filters may be unstable Causal IIR filters with rational system
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 informationLecture 19 IIR Filters
Lecture 19 IIR Filters Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/5/10 1 General IIR Difference Equation IIR system: infinite-impulse response system The most general class
More informationPS403 - Digital Signal processing
PS403 - Digital Signal processing 6. DSP - Recursive (IIR) Digital Filters Key Text: Digital Signal Processing with Computer Applications (2 nd Ed.) Paul A Lynn and Wolfgang Fuerst, (Publisher: John Wiley
More informationREAL TIME DIGITAL SIGNAL PROCESSING
REAL TIME DIGITAL SIGNAL PROCESSING www.electron.frba.utn.edu.ar/dplab Digital Filters FIR and IIR. Design parameters. Implementation types. Constraints. Filters: General classification Filters: General
More informationFeature Extraction for ASR: Pitch
Feature Extraction for ASR: Pitch Wantee Wang 2015-03-14 16:55:51 +0800 Contents 1 Cross-correlation and Autocorrelation 1 2 Normalized Cross-Correlation Function 3 3 RAPT 4 4 Kaldi Pitch Tracker 5 Pitch
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 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 informationDigital Signal Processing
COMP ENG 4TL4: Digital Signal Processing Notes for Lecture #20 Wednesday, October 22, 2003 6.4 The Phase Response and Distortionless Transmission In most filter applications, the magnitude response H(e
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 informationSignal Modeling Techniques in Speech Recognition. Hassan A. Kingravi
Signal Modeling Techniques in Speech Recognition Hassan A. Kingravi Outline Introduction Spectral Shaping Spectral Analysis Parameter Transforms Statistical Modeling Discussion Conclusions 1: Introduction
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 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 informationADSP ADSP ADSP ADSP. Advanced Digital Signal Processing (18-792) Spring Fall Semester, Department of Electrical and Computer Engineering
Advanced Digital Signal rocessing (18-792) Spring Fall Semester, 201 2012 Department of Electrical and Computer Engineering ROBLEM SET 8 Issued: 10/26/18 Due: 11/2/18 Note: This problem set is due Friday,
More information