• DocumentCode
    287983
  • Title

    A reduced complexity sub-optimal nonlinear predictor

  • Author

    Nisbet, K.C. ; Mulgrew, B. ; McLaughlin, S.

  • Author_Institution
    Bell Coll. of Technol., Glasgow, UK
  • fYear
    1994
  • fDate
    34472
  • Firstpage
    42522
  • Lastpage
    613
  • Abstract
    In this paper radial basis function (RBF) and Volterra series (VS) nonlinear predictors are examined with a view to reducing their complexity while maintaining prediction performance. A geometrical interpretation is presented which results in a predictor which although suboptimal is of considerably reduced complexity. The geometric interpretation indicates that while a multiplicity of choices of reduced state predictors exists, some choices are better than others in terms of the numerical conditioning of the solution. Two algorithms are developed using this signal subspace approach to find reduced state solutions which are “close to” the minimum norm solution and which share its numerical properties. The performance of these algorithms is assessed using chaotic time series as test signals
  • Keywords
    Volterra series; computational complexity; eigenvalues and eigenfunctions; matrix algebra; prediction theory; Volterra series type; chaotic time series test signals; prediction performance; radial basis function type; reduced complexity predictor; reduced state solutions; signal subspace approach; suboptimal nonlinear predictor;
  • fLanguage
    English
  • Publisher
    iet
  • Conference_Titel
    Non-Linear Filters, IEE Colloquium on
  • Conference_Location
    London
  • Type

    conf

  • Filename
    367924