17.04.2013 Views

Tese de Doutorado

Tese de Doutorado

Tese de Doutorado

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Aquisição e Processamento <strong>de</strong> Sons Crepitantes<br />

O projeto do FLSI po<strong>de</strong> ser ilustrado pela Figura 3.17 (HAYES, 1996).<br />

Se g[n] correspon<strong>de</strong> à resposta ao impulso do sistema causal a ser<br />

equalizado, o problema consiste em calcular hN[n] <strong>de</strong> tamanho N como:<br />

Daniel Ferreira da Ponte<br />

dˆ<br />

[ n]<br />

= h [ n]<br />

* g[<br />

n]<br />

sendo d[n] = δ[n]. A saída e[n] po<strong>de</strong> ser escrita como:<br />

N<br />

e[ n]<br />

= d[<br />

n]<br />

− dˆ<br />

[ n]<br />

ou<br />

N<br />

N −1<br />

e[<br />

n]<br />

= d[<br />

n]<br />

− h [ n]<br />

* g[<br />

n]<br />

= d[<br />

n]<br />

− ∑<br />

l=<br />

0<br />

h<br />

N<br />

[ l]<br />

g[<br />

n − l]<br />

Figura 3.17: Diagrama <strong>de</strong> bloco simplificado para ilustrar o projeto <strong>de</strong> um filtro<br />

FLSI.<br />

O erro e[n] po<strong>de</strong> ser minimizado com o método <strong>de</strong> Shanks (HAYES,<br />

1996). O ótimo Filtro Least Square Inverse é obtido através da Eq. 3-5.<br />

on<strong>de</strong><br />

N 1<br />

∑<br />

l 0<br />

−<br />

=<br />

h<br />

N<br />

[ l]<br />

r [ k − l]<br />

= r [ k]<br />

; k = 0 1, ,......, N −1<br />

3-5<br />

g dg<br />

∞ * *<br />

r [ k − l]<br />

= ∑ g[<br />

n − l]<br />

g [ n − k]<br />

= r [ l − k]<br />

g<br />

g<br />

n=<br />

0<br />

r [ k]<br />

dg<br />

*<br />

∑ d[<br />

n]<br />

g [ n − k]<br />

=<br />

n 0<br />

∞<br />

=<br />

e<br />

59

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!