Abstract
In this paper, we propose a new calculation method for the regularization factor in sparse recursive least squares (SRLS) with l1-norm penalty. The proposed regularization factor requires no prior knowledge of the actual system impulse response, and it also reduces computational complexity by about half. In the simulation, we use Mean Square Deviation (MSD) to evaluate the performance of SRLS, using the proposed regularization factor. The simulation results demonstrate that SRLS using the proposed regularization factor calculation shows a difference of less than 2 dB in MSD from SRLS, using the conventional regularization factor with a true system impulse response. Therefore, it is confirmed that the performance of the proposed method is very similar to that of the existing method, even with half the computational complexity.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A New Recursive Approach to Sparse Representation;2023 IEEE International Conference on Development and Learning (ICDL);2023-11-09
2. A recursive least squares algorithm with ℓ1 regularization for sparse representation;Science China Information Sciences;2023-01-05