2018
DOI: 10.1109/access.2018.2808951
|View full text |Cite
|
Sign up to set email alerts
|

Fast Dual Purpose Algorithm Based on Novel Unified Cost Function

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(6 citation statements)
references
References 16 publications
0
6
0
Order By: Relevance
“…In the case of adaptive process monitoring schemes, it is necessary to recursively calculate this matrix to track both the PCS and the RS, which is prohibitively expensive. The dual-purpose algorithms can perform tracking of these subspaces by switching the sign of one algorithm . FDPM is one of the dual-purpose algorithms with lower computational complexity; hence, a lower hardware cost is required in real industrial applications .…”
Section: Basic Theory and Problem Formulationmentioning
confidence: 99%
See 2 more Smart Citations
“…In the case of adaptive process monitoring schemes, it is necessary to recursively calculate this matrix to track both the PCS and the RS, which is prohibitively expensive. The dual-purpose algorithms can perform tracking of these subspaces by switching the sign of one algorithm . FDPM is one of the dual-purpose algorithms with lower computational complexity; hence, a lower hardware cost is required in real industrial applications .…”
Section: Basic Theory and Problem Formulationmentioning
confidence: 99%
“…Many researchers have proposed alternative algorithms requiring fewer operations. Assuming that the dimension of the tracked subspace is τ and τ ≪ m , these algorithms with regard to the computational complexity are classified into three categories: high-complexity algorithms requiring O ( m 2 ) or O ( m 2 τ) operations such as first-order perturbation (FOP) analysis, rank-one modifications, and Lanczos tridiagonalizations; medium-complexity algorithms with O ( m τ 2 ) operations such as DPM and fast dual-purpose algorithms; and low-complexity algorithms requiring only O ( m τ) such as FRANS, HFRANS, FOOJA, YAST and MYAST, , and FDPM . The last category of algorithms is considered as the fast subspace tracking algorithms and the most important one from the viewpoint of real-time implementation.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Remark: The DDT system of the proposed algorithm has a computation complexity of n 2 + 4n flops per update, which is the same as n 2 + 4n of the Chen algorithm's DDT system [14], and is cheaper than n 2 + 8n of the Hasan algorithm's DDT system in [15] and n 2 +5n the projection approximation subspace tracking with deflation (PASTd) algorithm's DDT system in [16]. In addition, the operations involved in (4) are simple matrix addition and multiplication, which are easy for the systolic array implementation.…”
Section: B Dynamic Properties Of the Mca Algorithmmentioning
confidence: 99%
“…The cost coefficient to enlarge or reduce the generalized cost is introduced [51]. The reliability cost can be distributed to different units.…”
Section: Rational Investment For a Better User Experience A Reliamentioning
confidence: 99%