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 language | English |
---|---|
Pages | 644-648 |
Number of pages | 5 |
State | Published - 1995 |
Externally published | Yes |
Event | Proceedings of the 1994 IEEE Region 10's 9th Annual International Conference (TENCON'94). Part 1 (of 2) - Singapore, Singapore Duration: 22 08 1994 → 26 08 1994 |
Conference
Conference | Proceedings of the 1994 IEEE Region 10's 9th Annual International Conference (TENCON'94). Part 1 (of 2) |
---|---|
City | Singapore, Singapore |
Period | 22/08/94 → 26/08/94 |