Fixed-Point Implementation of Fast QR-Decomposition Recursive Least-Squares Algorithms (FQRD-RLS): Stability Conditions and Quantization Errors Analysis
The fast QR-decomposition based recursive least-squares (FQRD-RLS) algorithms offer RLS-like convergence and misadjustment at a lower computational cost, and therefore are desirable for implementation on a fixed-point digital signal processor (DSP). Furthermore, the FQRD-RLS algorithms are derived f...
Saved in:
| Published in: | Circuits, systems, and signal processing Vol. 32; no. 4; pp. 1551 - 1574 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Boston
Springer US
01.08.2013
Springer Nature B.V |
| Subjects: | |
| ISSN: | 0278-081X, 1531-5878 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The fast QR-decomposition based recursive least-squares (FQRD-RLS) algorithms offer RLS-like convergence and misadjustment at a lower computational cost, and therefore are desirable for implementation on a fixed-point digital signal processor (DSP). Furthermore, the FQRD-RLS algorithms are derived from QR-decomposition based RLS algorithms that are well known for their numerical stability in finite precision. Hence, these algorithms are often assumed numerically stable, although there is no rigorous analysis addressing the stability of such algorithms in finite precision. In this paper, we derive the conditions that guarantee stability of the FQRD-RLS algorithms, and also derive mathematical expressions for the mean-squared quantization error (MSQE) of internal variables of the FQRD-RLS algorithms at steady state. The objective is to quantify the propagation error due to quantization effects. The derived MSQE expressions have been verified by comparisons with fixed-point computer simulations. |
|---|---|
| Bibliography: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
| ISSN: | 0278-081X 1531-5878 |
| DOI: | 10.1007/s00034-012-9526-7 |