Abstract

In this paper, a robust adaptive filter based on kernel risk-sensitive loss for bilinear forms is proposed. The proposed algorithm, called minimum kernel risk-sensitive loss bilinear form (MKRSL-BF), is derived by minimizing the cost function based on the minimum kernel risk-sensitive loss (MKRSL) criterion. The proposed algorithm can obtain the excellent performance when the system is corrupted by the impulsive noise. In addition, to further improve the performance of the MKRSL-BF algorithm, the novel algorithm based on the convex scheme is proposed, which can suppress the confliction between the fast convergence rate and the low steady-state error. Finally, simulations are carried out to verify the advantages of the proposed algorithms.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call