Abstract
In this paper, we focus on developing a new relaxed Givens rotations (RGR)-RLS algorithm and the corresponding RGR-RLS systolic array. The resulting algorithm and architecture posses fine-grain pipelining, nearly the same convergence as the QRD-RLS, good robustness for λ, and square-root free computation with a little area overhead.
Original language | English |
---|---|
Pages (from-to) | 37-40 |
Number of pages | 4 |
Journal | Proceedings - IEEE International Symposium on Circuits and Systems |
Volume | 1 |
DOIs | |
State | Published - 2002 |