Documentos de Académico
Documentos de Profesional
Documentos de Cultura
:Edited by
Ashkan masomi
gs
S (ω ) = U (ω )
frequency domain: M
1 − ∑α m e − jω m
m =1
M
s[k ] = ∑ α m s[k − m] + g s u[ k ]
time domain: m =1
α = [α 1 α M ]
T
= linear prediction parameters
EE493Q: Digital Speech Processing
Overview
Single-microphone noise reduction
Problem description
Spectral subtraction methods (=spectral
(filtering
Iterative Wiener filtering based on speech
modeling
? s [k ]
(some) speech estimate
s[k ]
m1[k ]
s [k ]
mi [ k ] = s i [ k ] + n i [ k ]
wi = ? 4
s [k ] = ∑ mTi [k ].w i
i =1
wi = ? 4
s [k ] = ∑ mTi [k ].w i
i =1
[
w = w1T w T2 w T3 w T4 ]
T
[
m[k ] = m1T [k ] mT2 [k ] mT3 [k ] mT4 [k ] ]T
…where
4
s [k ] = ∑mTi [k ].w i = mT [k ].w
i =1
[
w = E{m[k ].m[k ] } . E{…Solution
T
m[k ].d [kis]} ] −1
s [k ] = mT [k ].w
wi = ?
2
min wi E{ s [k ] − d [k ] }
= estimateSMOOTHING’`
EE493Q: Digital Speech Processing
Kalman filter for Speech
Enhancement
M
s[k ] = ∑ αAR
Assume s[k − model
m] + g u[k ] of speech and
m s
m =1
N
n[k ] = ∑ β n[k − m] + g w[k ]
m n
noise
u[k], w[k] = zero mean, unit
variance,white noise
m =1
0 1 0 0 1 0
0 0 0 0
As = ; An =
0 0 1 0 0 1
α M α M −1 α1 β N β N −1 β1
[
g Ts = 0 0 ] [
g s ; g Tn = 0 0 gn ;]
EE493Q: Digital Speech Processing
Kalman filter for Speech
Enhancement
Same A, x, v
EE493Q: Digital Speech Processing
Kalman filter for Speech
Enhancement
Iterative algorithm
iterations