International Journal of Circuits, Systems and Signal Processing

E-ISSN: 1998-4464
Volume 15, 2021

Notice: As of 2014 and for the forthcoming years, the publication frequency/periodicity of NAUN Journals is adapted to the 'continuously updated' model. What this means is that instead of being separated into issues, new papers will be added on a continuous basis, allowing a more regular flow and shorter publication times. The papers will appear in reverse order, therefore the most recent one will be on top.

Main Page

Submit a paper | Submission terms | Paper format


Volume 15, 2021

Title of the Paper: A Novel Sparse Data Reconstruction Algorithm for Dynamically Detect and Adjust Signal Sparsity


Authors:  Dongxue Lu, Zengke Wang

Pages: 550-555  

DOI: 10.46300/9106.2021.15.61     XML


Abstract: This paper proposed a novel algorithm which is called the joint step-size matching pursuit algorithm (JsTMP) to solve the issue of calculating the unknown signal sparsity. The proposed algorithm falls into the general category of greedy algorithms. In the process of iteration, this method can adjust the step size and correct the indices of the estimated support that were erroneously selected in a dynamical way. And it uses the dynamical step sizes to increase the estimated sparsity level when the energy of the residual is less than half of that of the measurement vectory. The main innovations include two aspects: 1) The high probability of exact reconstruction, comparable to other classical greedy algorithms reconstruct arbitrary spare signal. 2) The sinh() function is used to adjust the right step with the value of the objective function in the late iteration. Finally, by following this approach, the simulation results show that the proposed algorithm outperforms stateof- the-art similar algorithms used for solving the same problem.