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 OpenAlexaff
Mustapha Benjillali, Leszek Szczeciński, Sonia Aı̈ssa, C. González

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.

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.003
metaresearch head score (Gemma)0.013
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.016

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.013
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.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.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

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

Citations10
Published2007
Admission routes1
Has abstractyes

Explore more

Same venueWireless Communications and Mobile ComputingSame topicAdvanced Wireless Communication TechniquesFrench-language works237,207