Circular Folding Cooperative Power Spectral Density Split Cancellation Algorithm for Spectrum Sensing

The cooperative power spectral density split cancellation (CPSC) algorithm for spectrum sensing has low computational complexity and is robust under dynamical noise. We propose a novel circular folding CPSC (CF-CPSC) algorithm that expressively outperforms the original CPSC. Making use of the incomplete regularized Beta function, the cumulative distribution functions of the main random variables that form the decision statistic of the CF-CPSC model are derived. It is also derived an expression for the global probability of false alarm of the CF-CPSC, which is particularized to an approximate simple closed form that yields very accurate results. A closed-form expression of the decision threshold is provided as well. The analytical results are verified by Monte Carlo simulations. Other simulation results are provided to demonstrate the suitability of the CF-CPSC for scenarios of practical interest.