2013
DOI: 10.12785/ijcds/020103
|View full text |Cite
|
Sign up to set email alerts
|

Performance Analysis of Modified Gram-Schmidt Cholesky Implementation on 16 bits-DSP-chip

Abstract: This paper focuses on the performance analysis of a linear system solving based on Cholesky decomposition and QR factorization, implemented on 16bits fixed-point DSP-chip (TMS320C6474). The classical method of Cholesky decomposition has the advantage of low execution time. However, the modified Gram-Schmidt QR factorization performs better in term of robustness against the round-off error propagation. In this study, we have proposed a third method called Modified Gram-Schmidt Cholesky Decomposition. We have sh… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…Several methods of decomposition are available from numerous studies (Bellantoni and Dodge 1967;Gonzalez et al 2014;Roncero 2014;Thornton 1976). In this study, we employ the Bierman-Thornton algorithm (see appendix A), which uses modified Cholesky factors of the state variance-covariance matrix, since the modified Cholesky decomposition has been found to be more robust than the classical one (Maoudj et al 2013). It is acts as a square root filter, though it does not use any square root operations in its implementation.…”
Section: B Kalman Filtermentioning
confidence: 99%
“…Several methods of decomposition are available from numerous studies (Bellantoni and Dodge 1967;Gonzalez et al 2014;Roncero 2014;Thornton 1976). In this study, we employ the Bierman-Thornton algorithm (see appendix A), which uses modified Cholesky factors of the state variance-covariance matrix, since the modified Cholesky decomposition has been found to be more robust than the classical one (Maoudj et al 2013). It is acts as a square root filter, though it does not use any square root operations in its implementation.…”
Section: B Kalman Filtermentioning
confidence: 99%
“…He applied the dedicated structure in compressed sensing reconstruction further [4]. However, it is normally expensive for a GPU and its performance is limited for a CPU [1] or a DSP approach [5,6]. In [7], a software-and hardware co-design has been used in matrix manipulation with hardware taken as acceleration.…”
Section: Introductionmentioning
confidence: 99%