The performance comparison of improved continuous mixed P-norm and other adaptive algorithms in sparse system identification Online publication date: Mon, 20-Apr-2020
by Afsaneh Akhbari; Aboozar Ghaffari
International Journal of Advanced Intelligence Paradigms (IJAIP), Vol. 16, No. 1, 2020
Abstract: One of the essential usages of adaptive filters is in sparse system identification on which the performance of classic adaptive filters is not acceptable. There are several algorithms that designed especially for sparse systems; we call them sparsity aware algorithms. In this paper we studied the performance of two newly presented adaptive algorithms in which P-norm constraint is considered in defining cost function. The general title of these algorithms is continuous mixed P-norm (CMPN). The performances of these algorithms are considered for the first time in sparse system identification. Also the performance of l0 norm LMS algorithm is analysed and compared with our proposed algorithms. The performance analyses are carried out through several simulation scenarios and with the steady-state and transient mean square deviation (MSD) criterion of adaptive algorithms. We hope that this work will inspire researchers to look for other advanced algorithms against systems that are sparse.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Intelligence Paradigms (IJAIP):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook