
Fast signal reconstruction and recognition algorithm based on cascading redundant dictionary and block sparsity for compressed sensing radar receiver
Author(s) -
Zhang Chaozhu,
Qiu Peipei,
Xu Hongyi
Publication year - 2019
Publication title -
the journal of engineering
Language(s) - English
Resource type - Journals
ISSN - 2051-3305
DOI - 10.1049/joe.2019.0448
Subject(s) - compressed sensing , computer science , signal (programming language) , block (permutation group theory) , matching pursuit , algorithm , radar , signal reconstruction , greedy algorithm , sampling (signal processing) , artificial intelligence , pattern recognition (psychology) , signal processing , mathematics , telecommunications , detector , geometry , programming language
The compressed sensing (CS) radar receiver based on the theory of CS has a great advantage in receiving wide‐band signal and can receive high‐frequency radar signal at a sampling rate far lower than the traditional receiver. However, in order to obtain the information of the target signal, the parameters of the reconstructed signal still need to be measured by conventional methods. In order to make full use of the compressed sampling and the characteristics of radar signals, this study proposed a cascading dictionary matching pursuit algorithm based on block‐sparsity (BS‐CDMP) to achieve fast identification and reconstruction of received signals. First, a signal‐level redundant dictionary is constructed for quickly identifying the signal in which the authors are interested in. Then, they study the feasibility of cascading the signal‐level redundant dictionary and the DFT basis as a whole sparsity dictionary. Finally, the block sparsity is introduced for the selection of different parts of the dictionary during greedy iteration. Experimental results show that their proposed algorithm has considerable and universal reconfiguration performance and can directly perform fast reconstruction and recognition of the target signal.