Open AccessImproved simple set‐membership affine projection algorithm for sparse system modelling: Analysis and implementation
Author(s) -
Yazdanpanah Hamed,
Diniz Paulo S.R.,
Lima Markus V.S.
Publication year - 2020
Publication title -
iet signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.384
H-Index - 42
eISSN - 1751-9683
pISSN - 1751-9675
DOI - 10.1049/iet-spr.2019.0294
Subject(s) - algorithm , simple (philosophy) , affine transformation , set (abstract data type) , projection (relational algebra) , exploit , function (biology) , computer science , computational complexity theory , simple algorithm , mathematics , mathematical optimization , philosophy , epistemology , pure mathematics , programming language , physics , computer security , evolutionary biology , biology , thermodynamics
Recently, the improved simple set‐membership affine projection (IS‐SM‐AP) algorithm has been proposed in order to exploit sparsity in system models. Although its update equation resembles that of the set‐membership affine projection (SM‐AP) algorithm, the IS‐SM‐AP algorithm has two fundamental advantages over the SM‐AP algorithm: (i) it can exploit sparsity in system models and (ii) its computational complexity is lower. Up to now, the properties of this algorithm have been addressed only through numerical simulations, and no analytical study has been presented. To fill this gap, in this study, the authors analyse the steady‐state mean squared error of the IS‐SM‐AP algorithm using the energy conservation method. Furthermore, some important implementation issues are addressed, and a time‐varying parameter for the discard function is proposed. Finally, the authors present numerical results corroborating the theoretical analysis and the effectiveness of the proposed time‐varying parameter.