MétaCan
Menu
Back to cohort
Record W2989149248 · doi:10.1049/joe.2019.1056

Calculation and error bound of Min‐approximated bitwise log‐likelihood ratios of generalised <i>M</i> ‐ary PAM

2019· article· en· W2989149248 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

VenueThe Journal of Engineering · 2019
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsDemodulationBitwise operationSpectral efficiencyCoding gainAlgorithmCoding (social sciences)MathematicsPulse-amplitude modulationComputational complexity theoryUpper and lower boundsComputer scienceChannel (broadcasting)StatisticsTelecommunicationsPulse (music)Decoding methods

Abstract

fetched live from OpenAlex

In modern digital communication systems, a high‐order modulation and advanced channel coding are often jointly used to increase the spectral efficiency and coding gain. In this work, the authors investigate a computationally efficient method for evaluating the bitwise log‐likelihood ratios of generalised M ‐ary pulse amplitude modulation (PAM) signals with the Min approximation. The proposed scheme is simple and can be applied to demodulate the M ‐ary PAM having an arbitrary symbol spacing and a bit stream mapping. The computational complexity and upper bounds of the approximation error are also provided for a better understanding of the proposed scheme.

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: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.116
Threshold uncertainty score0.364

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.009
GPT teacher head0.221
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