2003•Unpublished venueRequires access

A comparative study of the approximate RLS with LMS and RLS algorithms

Mangesh Chansarkar, U.B. Desai, Bapuji Rao

Abstract

Motivated by the real time application of adaptive signal processing algorithms, an approximate RLS (recursive least squares) algorithm is proposed. This algorithm has convergence behavior comparable to the RLS algorithm, and computational complexity comparable to the LMS (least mean square) algorithm. Simulation studies comparing the three algorithms in various modes of adaptive processing are presented.>

About this research paper

What this paper is about

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Recursive least squares filter, Convergence (economics), Algorithm, Least mean squares filter, Adaptive filter, Computer science, Signal processing, Computational complexity theory