Abstract
Bayesian Compressive Sensing (BCS) can effectively relax the requirement of hardware operational bandwidth and perfectly recover sparse wideband signal at sub-Nyquist rate in wideband spectrum sensing. However, one of the problem of BCS is the long recovery time caused by the high computational complexity. In this paper, a PU Probability Prediction based Bayesian Compressive Sensing algorithm (PBCS) is proposed, in which PU (Primary User) probability prediction results are utilized as an index to select basis functions in the fast RVM (Relevance Vector Machine) algorithm to decrease the iterative times and thus reduce the recovery time. In addition, the simulation results are illustrated that it needs less measurements and has enhanced robustness against noise.
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.
