dc.contributor.author |
Maoudj, Rabah |
|
dc.contributor.author |
Fety, Luc |
|
dc.contributor.author |
Alexandre, Christophe |
|
dc.date.accessioned |
2018-07-05T10:09:20Z |
|
dc.date.available |
2018-07-05T10:09:20Z |
|
dc.date.issued |
2013 |
|
dc.identifier.issn |
2210-142X |
|
dc.identifier.uri |
http://10.7.0.19:8080/xmlui/handle/123456789/213 |
|
dc.description.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 shown that it provides a compromise of the two performance criterias cited above. A joint theoretical and experimental analysis of global performance of the three methods has been presented and discussed. |
en_US |
dc.language.iso |
en_US |
en_US |
dc.publisher |
University of Bahrain |
en_US |
dc.rights |
Attribution-NonCommercial-ShareAlike 4.0 International |
* |
dc.rights.uri |
http://creativecommons.org/licenses/by-nc-sa/4.0/ |
* |
dc.subject |
fixed-point |
en_US |
dc.subject |
cholesky |
en_US |
dc.subject |
qr |
en_US |
dc.subject |
system solving |
en_US |
dc.subject |
dsp |
en_US |
dc.subject |
signal processing |
en_US |
dc.title |
Performance Analysis of Modified Gram-Schmidt Cholesky Implementation on 16 bits-DSP-chip |
en_US |
dc.type |
Article |
en_US |
dc.identifier.doi |
http://dx.doi.org/10.12785/IJCDS/020103 |
|
dc.volume |
02 |
|
dc.issue |
01 |
|
dc.source.title |
International Journal of Computing and Digital Systems |
|
dc.abbreviatedsourcetitle |
IJCDS |
|