A Dynamical System With Fixed Convergence Time for Sparse Recovery
The sparse recovery (SR) algorithm, under the premise that signals are sparse, can be divided into two categories. One is a digital discrete method implemented via lots of iterative computations and the other is a continuous method implemented via analog circuits, which is usually faster. In this pa...
Main Authors: | Junying Ren, Lei Yu, Yulun Jiang, Jean-Pierre Barbot, Hong Sun |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8638783/ |
Similar Items
-
An Armijo-Type Hard Thresholding Algorithm for Joint Sparse Recovery
by: Lili Pan, et al.
Published: (2021-01-01) -
Sparse signal recovery from modulo observations
by: Viraj Shah, et al.
Published: (2021-04-01) -
Compressive hard thresholding pursuit algorithm for sparse signal recovery
by: Liping Geng, et al.
Published: (2022-07-01) -
Structured Bayesian learning for recovery of clustered sparse signal
by: Wang, Lu, et al.
Published: (2022) -
An Overview on Sparse Recovery-based STAP
by: Ma Ze-qiang, et al.
Published: (2014-04-01)