Microkicking for fast convergence of sparse kaczmarz and sparse LMS

Algorithms based on linearized Bregman iterations are able to perform sparse reconstruction at a low computational complexity. Especially the Least-Mean-Squares (LMS) and Kacz-marz variants of linearized Bregman iterations proved to be very feasible for fixed-point digital hardware implementation. We present a method that we call microkicking for improving the convergence speed of linearized Bregman based algorithms. This method can be implemented with only a negligible complexity overhead leading to significantly faster convergence for both variants of the linearized Bregman iterations. We furthermore show simulation results demonstrating the performance gains achievable by microkicking.