Leveraging High Order Cumulants for Spectrum Sensing and Power Recognition in Cognitive Radio Networks
Bibliographic record
Abstract
Hybrid interweave-underlay spectrum access in cognitive radio networks can explore spectrum opportunities when primary users (PUs) are either active or inactive, which significantly improves spectrum utilization. The practical wireless systems, such as long-term evolution-advanced, usually operate at multiple transmission power levels, leading to a multiple primary transmission power scenario. In such a case, the two fundamental issues in hybrid interweave-underlay spectrum access are to detect the “ON/OFF” status of PUs and to recognize the operating power level of PUs, which are challenging due to non-Gaussian transmitted signals. In this paper, we exploit high-order cumulants (HOCs) to efficiently perform spectrum sensing and power recognition. Specifically, for a given order and time lag, we first propose a single HOC-based spectrum sensing and power recognition scheme with low computational complexity, by leveraging minimum Bayes risk criterion. Moreover, we propose a hybrid multiple HOCs-based spectrum sensing and power recognition scheme with multiple orders and time lags, to further improve the detection performance. Both the proposed schemes can eliminate the adverse impact of the noise power uncertainty. Finally, simulation results are provided to evaluate the proposed schemes.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".