Abstract

Cognitive radio (CR) is a promising technology for solving spectrum sacristy problem. Spectrum sensing is the main step of CR. Sensing the wideband spectrum produces more challenges. Compressive sensing (CS) is a technology used as spectrum sening in CR to solve these challenges. CS consists of three stages: sparse representation, encoding and decoding. In encoding stage sensing matrix are required, and it plays an important role for performance of CS. The design of efficient sensing matrix requires achieving low mutual coherence . In decoding stage the recovery algorithm is applied to reconstruct a sparse signal. İn this paper a new chaotic matrix is proposed based on Chebyshev map and modified gram Schmidt (MGS). The CS based proposed matrix is applied for sensing real TV signal as a PU. The proposed system is tested under two types of recovery algorithms. The performance of CS based proposed matrix is measured using recovery error (Re), mean square error (MSE), and probability of detection (Pd) and evaluated by comparing it with Gaussian, Bernoulli and chaotic matrix in the literature. The simulation results show that the proposed system has low Re and high Pd under low SNR values and has low MSE with high compression.

Highlights

  • Cognitive radio (CR) is a promising technology for wireless communications

  • The main contributions in this paper are: 1) We proposed a chaotic matrix based on Chebyshev and Gram Schmidt without using sample distance as compared with the above references in the literature

  • The TV white space (TVWS) technology was considered after the transition from analogue to digital to increase the capacity, without causing interference to licensed users (PU) of television channels transmitting at low-power levels and low-cost equipment

Read more

Summary

INTRODUCTION

Cognitive radio (CR) is a promising technology for wireless communications. It needs the design of novel spectrum sensing techniques which have a high degree of reliability, even at low SNR [1]. A measurement (sensing) matrix is used to sample the sparse signal. The most important works that used chaotic matrix are [4] and [11] where different types of 1-D chaotic map are used, this matrix provides security from PU attacks and low complexity as compared to the random matrix but have a challenge that large sample distance is required for low coherence which requires large resources and long sensing time. In [13] measurement matrix is created using a Chebyshev map with reduced sample distance. All these works do not apply to sensing real signals. 2) applying the proposed system for sensing real TV signals, while this is not considered in the previous works. 3) The proposed matrix has low complexity since it requires storage only maps, parameters and equations as compared with the random matrix that is required to store all matrices. 4) The proposed system provides high security for sensing information from an attacker outside the network. 5) The proposed matrix has low mutual coherence and this produce low reconstruction error and gives the same performance of random matrix and better performance than matrix based logistic map in [4]

SENSING TV SIGNALS IN COGNITIVE RADIO
RECOVERY ALGORITHMS
THE PROPOSED CHAOTIC MATRIX
SYSTEM MODEL
SIMULATION RESULTS AND DISCUSSION
VIII. CONCLUSION
Full Text
Published version (Free)

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 call