{'fraction_non_alphanumeric': 0.018218623481781375, 'fraction_numerical': 0.0, 'mean_word_length': 5.067484662576687, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A blind spectrum sensing based on low-rank and sparse matrix decomposition

As a crucial component in Cognitive Radio (CR) networks, spectrum sensing has been attracting lots of attention. Some conventional methods for spectrum sensing are sensitive to uncertain signal and noise, its applicability is limited thereof. In this paper, a novel blind spectrum sensing method is proposed, where low-rank and sparse matrix decomposition is applied to the observation signal of a CR in the frequency domain. Then the ratio of the energy of the sparse part and the received signal in the time domain is considered as the criterion to decide whether the radio frequency band is idle by means of a comparison with a predefined threshold. The proposed method is independent of prior knowledge of signal and white noise, and has a better detection performance. Simulation experiments verify the performance of the proposed method in additive white Gaussian noise (AWGN), Rayleighand Rician channels.