MétaCan
Menu
Back to cohort
Record W2128726013 · doi:10.1109/glocom.1994.512686

Tight bounds on the error probability of coded modulation schemes in Rayleigh fading channels

2002· article· en· W2128726013 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

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsConcordia University
Fundersnot available
KeywordsPairwise error probabilityUpper and lower boundsBounding overwatchRayleigh fadingFadingProbability of errorPhase-shift keyingMathematicsAlgorithmChernoff boundComputer scienceBit error rateDecoding methodsMathematical analysis

Abstract

fetched live from OpenAlex

This paper presents a tight upper bound on the bit error performance of coded modulation schemes in Rayleigh fading channels. Upper and lower bounds on the pairwise error probability are first derived. The upper bound is then expressed in a product form to be used with the transfer function bounding technique. This upper bound has the same simplicity as the union-Chernoff bound while providing closer results to the exact expression. Examples for 4-state and 8-state TCM 8PSK schemes are also given to illustrate the tightness and the application of this upper bound.

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 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: Empirical
Teacher disagreement score0.173
Threshold uncertainty score0.267

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.053
GPT teacher head0.257
Teacher spread0.203 · 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