Tesis y Trabajos de Investigación PUCP

URI permanente para esta comunidadhttp://54.81.141.168/handle/123456789/6

El Repositorio Digital de Tesis y Trabajos de Investigación PUCP aporta al Repositorio Institucional con todos sus registros, organizados por grado: Doctorado, Maestría, Licenciatura y Bachillerato. Se actualiza permanentemente con las nuevas tesis y trabajos de investigación sustentados y autorizados, así como también con los que que fueron sustentados años atrás.
Ingresa a su web: Repositorio Digital de Tesis y Trabajos de Investigación PUCP

Explorar

Filtros

20171

Ajustes

Asesorsearch.filters.applied.operator.equals: search.filters.advisor.Reger, JohannAutorsearch.filters.applied.operator.equals: search.filters.author.Cieza Aguirre, Oscar Benjamín

Resultados de búsqueda

Mostrando 1 - 1 de 1
  • No hay miniatura disponible
    ÍtemTexto completo enlazado
    Rapid continuous-time identification of linear and nonlinear systems using modulation function approaches
    (Pontificia Universidad Católica del Perú, 2017-03-09) Cieza Aguirre, Oscar Benjamín; Reger, Johann
    At the present, system identification through modulation functions has a wide range of methods. Many of them have reached maturity levels that surpass customary Kalmanfilter approaches for discrete-time identification. In this thesis, the modulation function technique is analyzed in view of its real-time capability, as well as the possible unification of the modulation function methods based on the frequency spectrum, and ability to deal with nonlinearities. Besides, to increase the rate of convergence, the optimal parameter estimation with constraints of Byrski et al. [BFN03] is applied on integrable and convolvable systems. Furthermore, the modulated white Gaussian noise influence on linear systems is examined. The proposed methods together with the Loab-Cahen modulation functions are compared in performance for linear and convolvable systems concerning three different inputs, three normalizations, identification parameters and computational cost.