Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
