An EM Approach for Cooperative Spectrum Sensing in Multiantenna CR Networks
Bibliographic record
Abstract
In this paper, a cooperative wideband spectrum sensing scheme based on the expectation-maximization (EM) algorithm is proposed for the detection of a primary user (PU) system in multiantenna cognitive radio (CR) networks. Given noisy signal observations from N secondary users (SUs) over multiple subbands at a fusion center (FC), prior works on cooperative spectrum sensing often use the set of received subband energy as decision statistics over the sensing interval. However, to achieve satisfactory performance, knowledge of the channel state information (CSI) and the noise variances at all the SUs is required by these algorithms. To overcome this limitation, our proposed method, which is referred to as joint detection and estimation (JDE), adopts the EM algorithm to jointly detect the PU signal and estimate the unknown channel frequency responses and noise variances over multiple subbands in an iterative manner. Various aspects of this proposed EM-JDE scheme are investigated, including a reliable initialization strategy to ensure convergence under practical conditions and a distributed implementation to reduce communication overhead. Under the assumption of perfect estimation for the channel frequency responses and noise variances, we further show that the proposed EM-JDE converges to the maximum-likelihood (ML) solution, which serves as an upper bound on its performance. Monte Carlo simulations over Rayleigh fading channels show that the proposed scheme significantly improves the performance of spectrum detection by exploiting the diversity of the spatially distributed SUs with multiple antennas.
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.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| 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.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".