Busca avançada
Ano de início
Entree


Low-complexity Approximation to the Kalman Filter Using Convex Combinations of Adaptive Filters from Different Families

Texto completo
Autor(es):
Claser, Raffaello ; Nascimento, Vitor H. ; IEEE
Número total de Autores: 3
Tipo de documento: Artigo Científico
Fonte: 2017 25TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO); v. N/A, p. 4-pg., 2017-01-01.
Resumo

It is known that combinations of the least mean square (LMS) and recursive least squares (RLS) algorithms may achieve a performance in tracking better than what is possible to obtain with either kind of filter individually. In this paper, we consider combinations of LMS and RLS filters and compare their performance under a nonstationary condition with the optimal solution obtained via Kalman filter. We show that combination schemes may have a tracking performance close to that of a Kalman filter, but with lower computational complexity (linear in the filter length instead of quadratic - in the case of the example shown here - or cubic, for general Kalman models). (AU)

Processo FAPESP: 14/04256-2 - Algoritmos de baixo custo computacional para estimação de parâmetros
Beneficiário:Vitor Heloiz Nascimento
Modalidade de apoio: Auxílio à Pesquisa - Regular