2017 Signal Processing Symposium (SPSympo) 2017
DOI: 10.1109/sps.2017.8053665
|View full text |Cite
|
Sign up to set email alerts
|

Nonlinear complexity reduction: Sparsity of the generalized schur coefficient matrices and frobenius norm criterion

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2018
2018

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 3 publications
0
1
0
Order By: Relevance
“…This problem, however, is of crucial importance in nonlinear generalizations to higherorder time-series of the the algorithms presented in this paper. In the nonlinear approach, the number of hyperbolic/circular rotations increases tremendously, making the resulting algorithms practically useless, as it was shown in [20]. Therefore, the nonlinear complexity reduction via consideration of pstationary higher-order time series, spanning p-shift invariant generalized sample-product spaces, can be the subject of a separate paper.…”
Section: Discussionmentioning
confidence: 99%
“…This problem, however, is of crucial importance in nonlinear generalizations to higherorder time-series of the the algorithms presented in this paper. In the nonlinear approach, the number of hyperbolic/circular rotations increases tremendously, making the resulting algorithms practically useless, as it was shown in [20]. Therefore, the nonlinear complexity reduction via consideration of pstationary higher-order time series, spanning p-shift invariant generalized sample-product spaces, can be the subject of a separate paper.…”
Section: Discussionmentioning
confidence: 99%