Abstract
Compressed sensing (CS) enables the recovery of sparse or compressible signals from relatively a small number of randomized measurements compared to Nyquist-rate samples. Although most of the CS literature has focused on sparse signal recovery, exact recovery is not actually necessary in many signal processing applications. Solving inference problems with compressive measurements has been addressed by recent CS literature. This paper takes some further steps to investigate the potential of CS in signal detection problems. We provide theoretical performance limits verified by simulations for detection performance in arbitrary random signal detection with compressive measurements.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
