2018 26th European Signal Processing Conference (EUSIPCO) 2018
DOI: 10.23919/eusipco.2018.8553017
|View full text |Cite
|
Sign up to set email alerts
|

Fast Algorithms for the Schur- Type Nonlinear Parametrization of Higher-Order Stochastic Processes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…allowing for a considerable complexity reduction in a uniform way. The results presented here are a good starting point and prove to be useful for nonlinear generalizations to higher-order near-stationary stochastic processes, treated in [22], as complexity in the general nonlinear Schur parametrization problem solution becomes an essential constraint in the resulting algorithms efficient implementations so that complexity reduction is of crucial importance in that case.…”
Section: Introductionmentioning
confidence: 91%
“…allowing for a considerable complexity reduction in a uniform way. The results presented here are a good starting point and prove to be useful for nonlinear generalizations to higher-order near-stationary stochastic processes, treated in [22], as complexity in the general nonlinear Schur parametrization problem solution becomes an essential constraint in the resulting algorithms efficient implementations so that complexity reduction is of crucial importance in that case.…”
Section: Introductionmentioning
confidence: 91%