2008
DOI: 10.1134/s000511790805010x
|View full text |Cite
|
Sign up to set email alerts
|

Decomposition of the multi-dimensional time series identification problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…At this stage, the filter F k−1 (q −1 ), found at the (k−1)th stage, is used in order to transform the matrix G k (q −1 ) = F k (q −1 )F k T (q) so that its transform contains nonzero elements in only one line, one column, and on the main diagonal. This technique substantially simplifies the procedure of spectral factorization (finding the matrix function F k (q −1 )) [11].…”
Section: Filter Designmentioning
confidence: 99%
See 1 more Smart Citation
“…At this stage, the filter F k−1 (q −1 ), found at the (k−1)th stage, is used in order to transform the matrix G k (q −1 ) = F k (q −1 )F k T (q) so that its transform contains nonzero elements in only one line, one column, and on the main diagonal. This technique substantially simplifies the procedure of spectral factorization (finding the matrix function F k (q −1 )) [11].…”
Section: Filter Designmentioning
confidence: 99%
“…Simultaneously, the model for the transfer matrix of the inverse filter F 0 −1 (q −1 ), which transforms the initial time series into the white noise, is also found. The algorithm for constructing both the shaping filter F 0 (q −1 ) and its inverse F 0 −1 (q −1 ) is described in [11]. Based on this algorithm, the sequence of prediction errors ε t should be N-dimensional white noise.…”
Section: Filter Designmentioning
confidence: 99%