scholarly journals Blind Spectrum Detector for Cognitive Radio Using Compressed Sensing and Symmetry Property of the Second Order Cyclic Autocorrelation

Author(s):  
Jacques PALICOT ◽  
Ziad KHALAF ◽  
Amor NAFKHA
2021 ◽  
Author(s):  
Olusegun Peter Awe ◽  
Daniel Adebowale Babatunde ◽  
Sangarapillai Lambotharan ◽  
Basil AsSadhan

AbstractWe address the problem of spectrum sensing in decentralized cognitive radio networks using a parametric machine learning method. In particular, to mitigate sensing performance degradation due to the mobility of the secondary users (SUs) in the presence of scatterers, we propose and investigate a classifier that uses a pilot based second order Kalman filter tracker for estimating the slowly varying channel gain between the primary user (PU) transmitter and the mobile SUs. Using the energy measurements at SU terminals as feature vectors, the algorithm is initialized by a K-means clustering algorithm with two centroids corresponding to the active and inactive status of PU transmitter. Under mobility, the centroid corresponding to the active PU status is adapted according to the estimates of the channels given by the Kalman filter and an adaptive K-means clustering technique is used to make classification decisions on the PU activity. Furthermore, to address the possibility that the SU receiver might experience location dependent co-channel interference, we have proposed a quadratic polynomial regression algorithm for estimating the noise plus interference power in the presence of mobility which can be used for adapting the centroid corresponding to inactive PU status. Simulation results demonstrate the efficacy of the proposed algorithm.


Frequenz ◽  
2016 ◽  
Vol 70 (7-8) ◽  
Author(s):  
Dennis Wieruch ◽  
Peter Jung ◽  
Thomas Wirth ◽  
Armin Dekorsy ◽  
Thomas Haustein

AbstractWe suggest an interweave cognitive radio system with a


2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Karl K. Sabelfeld ◽  
Dmitrii Smirnov

Abstract We suggest in this paper a global random walk on grid (GRWG) method for solving second order elliptic equations. The equation may have constant or variable coefficients. The GRWS method calculates the solution in any desired family of m prescribed points of the gird in contrast to the classical stochastic differential equation based Feynman–Kac formula, and the conventional random walk on spheres (RWS) algorithm as well. The method uses only N trajectories instead of mN trajectories in the RWS algorithm and the Feynman–Kac formula. The idea is based on the symmetry property of the Green function and a double randomization approach.


Sign in / Sign up

Export Citation Format

Share Document