MétaCan
Menu
Back to cohort
Record W2141578547 · doi:10.1109/tcomm.2003.818099

Techniques for early stopping and error detection in turbo decoding

2003· article· en· W2141578547 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

VenueIEEE Transactions on Communications · 2003
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsTurbo codeConvolutional codeDecoding methodsSerial concatenated convolutional codesComputer scienceRedundancy (engineering)AlgorithmCyclic redundancy checkTurboEncoderError detection and correctionConcatenated error correction codeBlock codeEngineering

Abstract

fetched live from OpenAlex

In this letter, we present three new criteria for early stopping and error detection in turbo decoding. The approaches are based on monitoring the mean of the absolute values of the log-likelihood ratio of the decoded bits, which we show to be directly related to the variance of the metachannel. We demonstrate that this mean value increases as the number of errors in a frame decreases, and as a result, propose the simple mean-estimate criterion. We show that the systematic component of a terminated recursive systematic convolutional encoder used in turbo codes provides a built-in cyclic redundancy check (CRC). To further improve the performance, we also propose the mean-sign-change (MSC) criterion and the MSC-CRCeb criterion, in which a short external CRC code and the built-in CRC are concatenated with the MSC criterion.

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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.863
Threshold uncertainty score0.750

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.034
GPT teacher head0.292
Teacher spread0.258 · 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