.png){kind=icon}
.png){kind=icon}
Return
Weighted Circular Folding Cooperative Power Spectral Density Split Cancellation Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2021.3049707.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Low computation complexity and robustness against dynamical noise are attributes of the cooperative power spectral density split cancellation (CPSC) algorithm, developed for centralized data-fusion cooperative spectrum sensing. Recently, an improved version of the CPSC was proposed, named circular folding CPSC (CFCPSC), which outperforms the CPSC while maintaining low complexity and robustness against dynamical noise. This correspondence proposes the weighted CFCPSC (WCFCPSC), which improves the performance of the CFCPSC, retaining the attributes of its predecessors. Expressions are derived for the probability of false alarm, and for the probability density and the cumulative distribution functions of the main random variables that form the WCFCPSC test statistics. Simulations results are given to support the theoretical findings and to demonstrate the superior performance of the WCFCPSC.
Keywords:
Sensors
Radio frequency
Phase shift keying
Heuristic algorithms
Cascading style sheets
Robustness
Wireless sensor networks
CFCPSC
CPSC
cognitive radio
cooperative spectrum sensing
dynamic spectrum access
WCFCPSC
Journal
IF:
7.1
Papers:
1.8W
Citations:
6.6W