A Modified Recursive Regularization Factor Calculation For Sparse Rls Algorithm With L(1)-Norm

In this paper, we propose a new calculation method for the regularization factor in sparse recursive least squares (SRLS) with l(1)-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.