Adaptive sparse system identification using normalized least mean fourth algorithm. (23rd September 2013)

• Record Type: Journal Article
• Authors: Gui, Guan; Adachi, Fumiyiuki
• Is Part Of: International journal of communication systems. Volume 28:Number 1(2015:Jan.)
• Page Start: 38
• Page End: 48
• Publication Date: 2013-09-23
• Subjects: Telecommunication systems -- Periodicals; 621.382
• DOI: 10.1002/dac.2637
• Languages: English
• ISSNs: 1074-5351

Abstract

<abstract abstract-type="main"> <title>SUMMARY</title> <p>Normalized least mean square (NLMS) was considered as one of the classical adaptive system identification algorithms. Because most of systems are often modeled as sparse, sparse NLMS algorithm was also applied to improve identification performance by taking the advantage of system sparsity. However, identification performances of NLMS type algorithms cannot achieve high‐identification performance, especially in low signal‐to‐noise ratio regime. It was well known that least mean fourth (LMF) can achieve high‐identification performance by utilizing fourth‐order identification error updating rather than second‐order. However, the main drawback of LMF is its instability and it cannot be applied to adaptive sparse system identifications. In this paper, we propose a stable sparse normalized LMF algorithm to exploit the sparse structure information to improve identification performance. Its stability is shown to be equivalent to sparse NLMS type algorithm. Simulation results show that the proposed normalized LMF algorithm can achieve better identification performance than sparse NLMS one. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p> </abstract>