A novel architecture for QR decomposition-based recursive least squares is presented. It offers low latency for applications where the channel equalization and adaptive filtering are mandatory. This approach reduces the computations by rewriting the equations in a manner that lets intense hardware resource sharing by reusing similar values in different computations. Moreover, precision range conversion allows for combining complex operations such as root square and division with minimum effect on the overall quantization error. Hence, an efficient lookup table-based solution has highly enhanced the performance of the design by 2.7 times with respect to the previous works.