Title: Sparse signal reconstruction via expanded subspace pursuit
Abstract:Due to their low computational complexity, greedy pursuit algorithms are widely used in sparse signal reconstruction. An improved greedy iterative algorithm, called the expanded subspace pursuit, is p...Due to their low computational complexity, greedy pursuit algorithms are widely used in sparse signal reconstruction. An improved greedy iterative algorithm, called the expanded subspace pursuit, is proposed. By incorporating a simple backtracking technique, the proposed algorithm removes the mismatching atoms to refine the estimated support set effectively. Furthermore, the proposed algorithm can achieve blind sparse reconstruction even without the prior of the sparsity degree. Compared with other greedy algorithms, the proposed algorithm exhibits superior reconstruction accuracy and lower computational complexity. Finally, numerical results are presented to demonstrate the validity of the proposed algorithm.Read More
Publication Year: 2019
Publication Date: 2019-10-11
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 3
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot