New efficient LMS adaptive filtering algorithm

Sau Gee Chen*, Yung An Kao, Kwung Yee Tsai

*Corresponding author for this work

Research output: Contribution to conferenceConference Paperpeer-review

Abstract

A new LMS adaptive filtering algorithm is proposed. The algorithm has comparable performance to the direct-form LMS algorithm (DLMS), while costs N/2-1 less multiplications at the expense of N/2+3 more additions than DLMS algorithm. For coefficient update, the new algorithm needs one additional coefficient estimation. Further, the algorithm is combined with LMS sign algorithm (SA), signed regressor algorithm (SRA) and zero forcing (ZFA) algorithm for further complexity reduction. Simulation results confirm with theoretical analysis that the new algorithm and its SA, SRA and ZFA versions converge as fast as their counter DLMS algorithms, while maintain comparable performances.

Original languageEnglish
Pages644-648
Number of pages5
StatePublished - 1995
Externally publishedYes
EventProceedings of the 1994 IEEE Region 10's 9th Annual International Conference (TENCON'94). Part 1 (of 2) - Singapore, Singapore
Duration: 22 08 199426 08 1994

Conference

ConferenceProceedings of the 1994 IEEE Region 10's 9th Annual International Conference (TENCON'94). Part 1 (of 2)
CitySingapore, Singapore
Period22/08/9426/08/94

Fingerprint

Dive into the research topics of 'New efficient LMS adaptive filtering algorithm'. Together they form a unique fingerprint.

Cite this