Adaptive Reconstruction Algorithm Based on Compressed Sensing Broadband Receiver
Existing greedy reconstruction algorithms require signal sparsity, and the remaining sparsity adaptive algorithms can be reconstructed but cannot achieve accurate sparsity estimation. To address this problem, a blind sparsity reconstruction algorithm is proposed in this paper, which is applied to co...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi-Wiley
2021-01-01
|
| Series: | Wireless Communications and Mobile Computing |
| Online Access: | http://dx.doi.org/10.1155/2021/6673235 |
| Summary: | Existing greedy reconstruction algorithms require signal sparsity, and the remaining sparsity adaptive algorithms can be reconstructed but cannot achieve accurate sparsity estimation. To address this problem, a blind sparsity reconstruction algorithm is proposed in this paper, which is applied to compressed sensing radar receiver system. The proposed algorithm can realize the estimation of signal sparsity and channel position estimation, which mainly consists of two parts. The first part is to use fast search based on dichotomy search, which is based on the high probability reconstruction of greedy algorithm, and uses dichotomy search to cover the number of sparsity. The second part is the signal matching and tracking algorithm, which is mainly used to judge the signal position and reconstruct the signal. Combine the two parts together to realize the blind estimation of the sparsity and the accurate estimation of the number of signals when the number of signals is unknown. The experimental analyses are carried out to evaluate the performance of the reconstruction probability, the accuracy of sparsity estimation, the running time of the algorithm, and the signal-to-noise ratio. |
|---|---|
| ISSN: | 1530-8669 1530-8677 |