earticle

영어

The Recursive Least Squares (RLS) algorithm is renowned for its rapid convergence but in some scenarios it fails to show swiftness required by several applications. Such failure may result due to different limiting conditions. Gain vector plays an essential role in the performance of RLS algorithm. This paper proposes a modification in Gain vector that results in RLS algorithm performing much better in perspective of convergence, without adding significant complexity. Simulation results are presented which prove the authenticity of the finding, and comparison with conventional RLS algorithm is presented.