MétaCan
Menu
Back to cohort
Record W4252717910 · doi:10.1002/wcm.528

Evaluation of bit error rate for packet combining with constellation rearrangement

2007· article· en· W4252717910 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

VenueWireless Communications and Mobile Computing · 2007
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsInstitut National de la Recherche ScientifiqueUniversité du Québec à Montréal
Fundersnot available
KeywordsComputer scienceBit error rateNetwork packetAlgorithmLogarithmErlang (programming language)Telecommunications linkConstellationPiecewiseTheoretical computer scienceMathematicsDecoding methodsTelecommunicationsComputer network

Abstract

fetched live from OpenAlex

Abstract In this paper, we propose a method for evaluation of the bit error rate (BER) for packet combining based on constellation rearrangement (CoRe). Such mapping diversity scheme, adopted in the high speed downlink packet access (HSDPA), uses Gray‐mapped constellations and is based on suboptimal accumulation of the reliability metrics generated in each of the transmissions. We present an exact model for the logarithmic likelihood ratios (LLR) obtained by means of the so‐called max‐log approximation, and we show that their conditional probability density functions (pdf) are piecewise Gaussian. We then present the derivation of the uncoded BER and illustrate it with simulation results that confirm our formulation. Finally, we propose simplifications which significantly reduce the complexity of the evaluation method and provide results with a very good accuracy; an extension to transmissions over faded channel is also presented. Copyright © 2007 John Wiley & Sons, Ltd.

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.003
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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: Empirical
Teacher disagreement score0.926
Threshold uncertainty score0.609

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
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.047
GPT teacher head0.328
Teacher spread0.281 · 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