A New Fast Convergence Adaptive Algorithm
P. Palanisamy, N. Kalyanasundaram
Abstract
P. Palanisamy, N. Kalyanasundaram
Abstract
In this paper, a new fast convergence adaptive algorithm with variable step size is proposed for FIR adaptive filter. This new proposed algorithm is derived based on the quasi-Newton family. Simulation results are presented to compare the convergence of the proposed algorithm with least mean square (LMS) algorithm and RLS algorithm. It shows that the proposed new algorithm has comparable convergence speed to the other known adaptive algorithms
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, a new fast convergence adaptive algorithm with variable step size is proposed for FIR adaptive filter. This new proposed algorithm is derived based on the quasi-Newton family. Simulation results are presented to compare the convergence of the proposed algorithm with least mean square (LMS) algorithm and RLS algorithm. It shows that the proposed new algorithm has comparable convergence speed to the other known adaptive algorithms
Key concepts: Convergence (economics), Algorithm, Adaptive filter, Computer science, Least mean squares filter, Adaptive algorithm, Algorithm design, Ramer–Douglas–Peucker algorithm