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 possess fine-grain pipelining, nearly the same convergence as the QRD-RLS, good robustness for , and square-root free computation with a little area overhead.