Dynamical Sparse Recovery with Finite-time Convergence - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Signal Processing Year : 2017

Dynamical Sparse Recovery with Finite-time Convergence

(1) , (2) , (3)
1
2
3
Lei Yu
  • Function : Author
Gang Zheng
Jean-Pierre Barbot

Abstract

Even though Sparse Recovery (SR) has been successfully applied in a wide range of research communities, there still exists a barrier to real applications because of the inefficiency of the state-of-the-art algorithms. In this paper, we propose a dynamical approach to SR which is highly efficient and with finite-time convergence property. Firstly, instead of solving the ℓ1 regularized optimization programs that requires exhausting iterations, which is computer-oriented, the solution to SR problem in this work is resolved through the evolution of a continuous dynamical system which can be realized by analog circuits. Moreover, the proposed dynamical system is proved to have the finite-time convergence property, and thus more efficient than LCA (the recently developed dynamical system to solve SR) with exponential convergence property. Consequently, our proposed dynamical system is more appropriate than LCA to deal with the time-varying situations. Simulations are carried out to demonstrate the superior properties of our proposed system.
Fichier principal
Vignette du fichier
dynamic_sparse_recovery_finite_time_V8.pdf (1.1 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01649419 , version 1 (27-11-2017)

Identifiers

Cite

Lei Yu, Gang Zheng, Jean-Pierre Barbot. Dynamical Sparse Recovery with Finite-time Convergence. IEEE Transactions on Signal Processing, 2017, 65 (23), pp.6146-6157. ⟨10.1109/TSP.2017.2745468⟩. ⟨hal-01649419⟩
232 View
257 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More