An Array Recursive Least-Squares Algorithm With Generic Nonfading Regularization Matrix
| Contribuinte(s) |
UNIVERSIDADE DE SÃO PAULO |
|---|---|
| Data(s) |
18/10/2012
18/10/2012
2010
|
| Resumo |
We present a novel array RLS algorithm with forgetting factor that circumvents the problem of fading regularization, inherent to the standard exponentially-weighted RLS, by allowing for time-varying regularization matrices with generic structure. Simulations in finite precision show the algorithm`s superiority as compared to alternative algorithms in the context of adaptive beamforming. FAPESP[2009/06837-4] |
| Identificador |
IEEE SIGNAL PROCESSING LETTERS, v.17, n.12, p.1001-1004, 2010 1070-9908 http://producao.usp.br/handle/BDPI/18611 10.1109/LSP.2010.2083652 |
| Idioma(s) |
eng |
| Publicador |
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC |
| Relação |
Ieee Signal Processing Letters |
| Direitos |
restrictedAccess Copyright IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC |
| Palavras-Chave | #Arrays #Equations #Array signal processing #Complexity theory #Robustness #Eigenvalues and eigenfunctions #RLS #Array forms #regularization #SYSTEMS #CHANNEL #Engineering, Electrical & Electronic |
| Tipo |
article original article publishedVersion |
