Repository logo
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Scholalry Output
  3. Publications
  4. Polynomial sparse adaptive algorithm
 
  • Details

Polynomial sparse adaptive algorithm

Source
Electronics Letters
ISSN
00135194
Date Issued
2016-12-08
Author(s)
Maheshwari, J.
George, N. V.  
DOI
10.1049/el.2016.3747
Volume
52
Issue
25
Abstract
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.
Unpaywall
URI
https://d8.irins.org/handle/IITG2025/21795
IITGN Knowledge Repository Developed and Managed by Library

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify