Open AccessPolynomial sparse adaptive algorithm
Author(s) -
Maheshwari J.,
George N.V.
Publication year - 2016
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2016.3747
Subject(s) - zero (linguistics) , polynomial , algorithm , scheme (mathematics) , zero order , path (computing) , zero crossing , sparse approximation , computer science , mathematics , first order , engineering , voltage , electrical engineering , mathematical analysis , philosophy , linguistics , programming language
Sparse learning algorithms for system identification differ from their non‐sparse counterparts in their improved ability in quickly identifying the zero coefficients in a sparse system. This improvement has been achieved using the principle of zero attraction, whereby the near zero coefficients of the model are forced to zero. In order to further improve the zero attraction capability of sparse adaptive algorithms, an attempt has been made to design a polynomial sparse adaptive algorithm. The enhanced modelling ability of the proposed scheme is evident from the simulation results. The proposed method has also been successfully applied in modelling an acoustic feedback path in a behind the ear digital hearing aid.