Caifeng Cheng1,2, Deshu Lin3,*
Journal on Internet of Things, Vol.2, No.1, pp. 47-54, 2020, DOI:10.32604/jiot.2020.09117
- 06 August 2020
Abstract In this paper, the observation matrix and reconstruction algorithm of
compressed sensing sampling theorem are studied. The advantages and
disadvantages of greedy reconstruction algorithm are analyzed. The
disadvantages of signal sparsely are preset in this algorithm. The sparsely
adaptive estimation algorithm is proposed. The compressed sampling matching
tracking algorithm supports the set selection and culling atomic standards to
improve. The sparse step size adaptive compressed sampling matching tracking
algorithm is proposed. The improved algorithm selects the sparsely as the step
size to select the support set atom, and the maximum correlation value. Half of
the More >
Login
Register
