Title: A new distributed subspace pursuit algorithm and its performance analysis
Abstract:In order to make full use of the joint sparse characteristics of sparse signals, a new distributed Subspace Pursuit algorithm based on the Subspace Pursuit (SP) algorithm is proposed in this paper. Th...In order to make full use of the joint sparse characteristics of sparse signals, a new distributed Subspace Pursuit algorithm based on the Subspace Pursuit (SP) algorithm is proposed in this paper. The algorithm improves the support set initialization and update processing of the traditional SP algorithm. During the initialization stage of the support set, the positions of the larger values of inner product appear most times were chosen as the initial set of support. In the update stage of the support set, sum coefficient values of all non-zero entries of signals and add the positions corresponding to the larger values to the support set. Compared with the existing SP algorithm and distributed algorithms which based on SP algorithm, the proposed method is capable of improving the accuracy of reconstruction, reducing the measured values and boosting the efficiency of the signal reconstruction. Theoretical analysis and simulation results show the effectiveness of the proposed method.Read More
Publication Year: 2017
Publication Date: 2017-10-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot