MétaCan
Menu
Back to cohort
Record W3204125689 · doi:10.18280/ts.380431

Subsampled Circulant Matrix Based Wideband Spectrum Sensing Using Fusion Based Recovery Algorithm

2021· article· en· W3204125689 on OpenAlexvenueno aff
T. V. N. L. Aswini, Padma K Raju, Leela Kumari

Bibliographic record

VenueTraitement du signal · 2021
Typearticle
Languageen
FieldEngineering
TopicSparse and Compressive Sensing Techniques
Canadian institutionsnot available
Fundersnot available
KeywordsWidebandCompressed sensingCognitive radioCirculant matrixNyquist–Shannon sampling theoremComputer scienceAlgorithmSpectrum (functional analysis)Matrix (chemical analysis)WirelessElectronic engineeringTelecommunicationsEngineeringComputer visionPhysics

Abstract

fetched live from OpenAlex

This paper reflects the problem of wideband spectrum recovery. The demand for spectrum usage is increasing exponentially as the wireless technologies rules the world. To meet these needs, Cognitive Radio is one of the emerging technologies, which intelligently allots the spectrum to the secondary users. Since the spectrum is wideband, the capability of spectrum sensing is improved by introducing sub-nyquist sampling under compressive sensing framework. In this paper, a sub-nyquist sampling technique of Modulated Wideband Converter (MWC) is used as it possesses m-parallel channels providing fast sensing and robust structure. A circulant matrix method is used to improve the hardware complexity of MWC. Also at the reconstruction of MWC, a fusion based recovery algorithm is proposed which became an added benefit for perfect recovery of the support. The results are compared with conventional MWC in terms of support recovery, mean square error and SNR gain. Simulations proved that the proposed algorithm performs superior at low as well as high SNR with increased gain.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.003

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.

Opus teacher head0.020
GPT teacher head0.232
Teacher spread0.212 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations2
Published2021
Admission routes1
Has abstractyes

Explore more

Same venueTraitement du signalSame topicSparse and Compressive Sensing TechniquesFrench-language works237,207