Pure time updates for least squares lattice algorithms

This note presents some new time update formulas for certain types of lattice algorithms used in autoregressive modeling of stationary time series. The new formulas enable the computation of the autoregressive coefficients in a number of operations per time step proportional to the model order.

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on automatic control Ročník 28; číslo 8; s. 865 - 866
Hlavní autor: Porat, B.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.08.1983
Institute of Electrical and Electronics Engineers
Témata:
Applied sciences
Computational complexity
Computer science; control theory; systems
Control theory. Systems
Covariance matrix
Equations
Exact sciences and technology
Information filtering
Information filters
Lattices
Least squares methods
Matrices
Modelling and identification
Polynomials
Reflection
Autoregressive model
Algorithm
Modeling
Time series
ISSN:0018-9286
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This note presents some new time update formulas for certain types of lattice algorithms used in autoregressive modeling of stationary time series. The new formulas enable the computation of the autoregressive coefficients in a number of operations per time step proportional to the model order.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9286
DOI:10.1109/TAC.1983.1103328