Research on ELMS Algorithm and Variable Step Size Algorithm
Han Ying-chen
Abstract
Han Ying-chen
Abstract
Based on analysis of LMS algorithm, the ELMS algorithm is researched, which is regarded as an improved algorithm of LMS. The performances of the two algorithms are analyzed and compared, and the advantages of ELMS are pointed out. Then, a variable step size ELMS algorithm is proposed, the theoretical analysis and computer simulation indicate that the new algorithm has quite fast convergence rate, better steady performance and can be applied to adaptive systems effectively.
OpenAlex reports 1 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.
Based on analysis of LMS algorithm, the ELMS algorithm is researched, which is regarded as an improved algorithm of LMS. The performances of the two algorithms are analyzed and compared, and the advantages of ELMS are pointed out. Then, a variable step size ELMS algorithm is proposed, the theoretical analysis and computer simulation indicate that the new algorithm has quite fast convergence rate, better steady performance and can be applied to adaptive systems effectively.
Key concepts: Algorithm, Variable (mathematics), Convergence (economics), Rate of convergence, Computer science, Output-sensitive algorithm, Mathematics, Key (lock)