A Robust Variable Step-Size NLMS Algorithm Through A Combination of Robust Cost Functions
Keywords:
Adaptive filter, robust filtering, impulsive noise, normalized least-mean-square (NLMS) algorithm.Abstract
This letter introduces a new gradient-based adaptive filtering algorithm based on a cost function that is constructed by combining two robust cost functions, which are a new tanh-type cost function and Vega’s cost function. Through the approach to combine robust cost functions, the robustness of the proposed algorithm outperforms that of other adaptive algorithms.Since the proposed algorithm is derived by combining two robust cost functions, it leads to an excellent transient and steady-state behavior in high probability of impulsive measurement noise. The proposed algorithm is tested in different probability of impulsive measurement noise.
Downloads
Downloads
Published
Issue
Section
License
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
