UM ALGORITMO TIPO RLS BASEADO EM SUPERFÍCIES NÃO QUADRÁTICAS

• Ano de defesa: 2013
• Autor(a) principal: Silva, Cristiane Cristina Sousa da
• Orientador(a): BARROS FILHO, Allan Kardec Duailibe
• Tipo de documento: Tese
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Federal do Maranhão
• Programa de Pós-Graduação: PROGRAMA DE PÓS-GRADUAÇÃO EM ENGENHARIA DE ELETRICIDADE/CCET
• Departamento: Engenharia
• País: BR
• Palavras-chave em Português: Filtragem adaptativa; Função não-quadrática; Velocidade de convergência
• Palavras-chave em Inglês: Adaptive filtering; Non-quadratic function; Convergence speed
• Área do conhecimento CNPq: CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO
• Link de acesso: http://tedebc.ufma.br:8080/jspui/handle/tede/550

In adaptive filtering many adaptive filter are based on the mean square error method (MSE). These filters were developed to improve convergence spedd with a lower misadjustment. The least mean square (LMS) and the recursive least square (RLS) algorithms have been the hallmark of adaptive filtering. In this work we develop adaptive algorithms based on the even powers of the error inspired in the recursive lest square (RLS) algorithm. Namely recursive nom quadratic (RNQ) algorithm. The ideas is based on Widrow s least mean square fourth (LMF) algorithm. Fisrt we derive equations based on a singal even power of the error in order to obtain criterions that guarantee convergence. We also determine equations that measure the misadjustment and the time constant of the adaptive process of the RNQ algorithm. We work also, toward making the algorithm less sensitive to the size of the error in na alternative direction, by proposing a cost function which is a sum of the even powers of the error. This second approach bring the error explicitly to the RLS algorithm formulation by proposing a new cost function that preserves the measnsquare-error (MSE) solution, but allows for the exploitation of higher order moments of the error to speedup the converge of the algorithm. The main goal this work is to create form first principles (new cost functions ) a mechanism to include instantaneous error information in the RLS algorithm, make it track better, and allow for the design of the forgetting factor. As we will see the key aspecto of our approach is to include the error in the Kalman gain that effectively controls the speed of adaptation of the RLS algorithm.