Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

access icon free Polynomial sparse adaptive algorithm

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.

References

    1. 1)
      • 2. Chen, Y., Gu, Y., Hero, A.O.: ‘Sparse LMS for system identification’. IEEE Int. Conf. on Acoustics, Speech and Signal Processing, Taipei, Taiwan, April 2009, pp. 31253128.
    2. 2)
      • 4. Elad, M.: ‘Sparse and redundant representations: from theory to applications in signal and image processing’ (Springer Science & Business Media, New York, NY, USA, 2010).
    3. 3)
    4. 4)
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2016.3747
Loading

Related content

content/journals/10.1049/el.2016.3747
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address