A Compressive Sensing Recovery Hardware Implementation Based On Half-Candidate Subspace Pursuit Algorithm

2022 IEEE 16th International Conference on Solid-State & Integrated Circuit Technology (ICSICT)(2022)

Cited 0|Views0
No score
Abstract
Compressed sensing (CS) theory has been very popular since its inception for its ability to sample signals at the sub-Nyquist rate. However, the hardware implementation of the recovery algorithm still has much room for improvement. In this paper, we propose a new algorithm named Half-Candidate Subspace Pursuit (HC-SP) algorithm and a hardware structure based on Square-Root-Free Gram–Schmidt QR decomposition (SRF-GS-QRD) to reduce resource consumption. The functionalities are implemented on the Xilinx Virtex7 FPGA and the results show that our algorithm achieved a normalized root mean square error (NMSE) of -100.1dB with the clock frequency of 12.5 MHZ.
More
Translated text
Key words
compressive sensing recovery hardware implementation,CS theory,frequency 12.5 MHz,gain -100.1 dB,half-candidate subspace pursuit algorithm,HC-SP algorithm,NMSE,normalized root mean square error,signal sampling,square-root-free Gram-Schmidt QR decomposition,SRF-GS-QRD,sub-Nyquist rate,Xilinx Virtex7 FPGA
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined