MétaCan
Menu
Back to cohort
Record W2963184790 · doi:10.1109/glocom.2012.6503684

Constrained Joint Bit and Power Allocation for Multicarrier Systems

2013· article· en· W2963184790 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueUlster University Research Portal (Ulster University) · 2013
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Network Optimization
Canadian institutionsCommunications Research Centre CanadaMemorial University of Newfoundland
Fundersnot available
KeywordsSubcarrierComputer scienceBit error rateComputational complexity theoryFadingBit (key)Joint (building)Transmitter power outputConstraint (computer-aided design)ThroughputOrthogonal frequency-division multiplexingPower (physics)AlgorithmMathematical optimizationWirelessTelecommunicationsMathematicsComputer networkDecoding methodsEngineeringTransmitterChannel (broadcasting)

Abstract

fetched live from OpenAlex

This paper proposes a novel low complexity joint bit and power suboptimal allocation algorithm for multicarrier systems operating in fading environments. The algorithm jointly maximizes the throughput and minimizes the transmitted power, while guaranteeing a target bit error rate (BER) per subcarrier and meeting a constraint on the total transmit power. Simulation results are described that illustrate the performance of the proposed scheme and demonstrate its superiority when compared to the algorithm in [4] with similar or reduced computational complexity. Furthermore, the results show that the performance of the proposed suboptimal algorithm approaches that of an optimal exhaustive search with significantly lower computational complexity.<br/>

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.348
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.024
GPT teacher head0.225
Teacher spread0.200 · 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