Abstract
Compressed sensing aims to compress sparse signals losslessly into significantly smaller samples and recover them if needed. One of the most critical approaches to recovering the sparse signal is minimizing l1-norm, the convex relaxation of l0-norm with the limit of linear measurement. However, sometimes such as the recovery of piecewise constant sparse signal, the need for controlling the convergence time has become an inevitable problem to solve. To solve this problem, the predefined time pseudo-inverse locally competitive algorithm (PPLCA) based on a nonlinear neurodynamic system is proposed in this paper, which is exceptionally effective if the signal is piecewise constant. Further, under the restricted isometry property (RIP), the predefined-time convergence rate of the proposed PPLCA is proven using Lyapunov’s stability theory. Finally, the numerical simulations show that the PPLCA could converge to the stationary point within the predefined time.
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 callMore From: IEEE Transactions on Circuits and Systems II: Express Briefs
Disclaimer: 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.
