A novel givens rotation based fast SQR-RLS algorithm

A novel Fast RLS Algorithm based on the Givens Rotation and developed from an UDU
^T
square-root factorization of autocorrelation matrix is discussed. The algorithm presents excellent numerical properties and requires 14N multiplications and 6N divisions per sampling interval, where N is the linear filter order.