Open AccessImproved sparsity‐aware NSAF‐SF adaptive algorithm
Author(s) -
Xavier P.P.S.,
Haddad D.B.,
Oliveira F.D.V.R.,
Petraglia M.R.
Publication year - 2020
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.2020.0661
Subject(s) - norm (philosophy) , convergence (economics) , computer science , adaptive filter , hyperplane , algorithm , projection (relational algebra) , mathematical optimization , control theory (sociology) , mathematics , artificial intelligence , law , geometry , control (management) , political science , economics , economic growth
Normalised subband adaptive filtering algorithms have attracted attention due to their ability to present faster convergence in the case of coloured excitation data. The NSAF‐SF scheme is an example of a state‐of‐the‐art subband adaptive algorithm that demands a low computational burden. This Letter proposes a deterministic local optimisation approach with affine constraints whose result leads to an enhanced NSAF‐SF updating mechanism. One of these constraints consists of a projection into a hyperplane derived from a relaxed ℓ 1 ‐norm restriction, which provides a sparsity‐promoting scheme. Such a constraint incorporates prior information into the (originally sparsity‐agnostic) NSAF‐SF. Such prior information concerns the energy concentration of the ideal transfer function that the adaptive filter intends to identify. Furthermore, the advanced optimisation problem is modified in order to make the advanced adaptive filter robust against impulsive noise. The simulations present a performance improvement for both transient and steady‐state regions.