MétaCan
Menu
Back to cohort
Record W3118489215 · doi:10.1109/ojcas.2020.3039256

Low-Latency Burst Error Detection and Correction in Decision-Feedback Equalization

2021· article· en· W3118489215 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 Open Journal of Circuits and Systems · 2021
Typearticle
Languageen
FieldEngineering
TopicAnalog and Mixed-Signal Circuit Design
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsComputer scienceLatency (audio)Burst errorError detection and correctionEncoderPower consumptionCMOSReal-time computingConvolutional codeElectronic engineeringDecoding methodsPower (physics)AlgorithmTelecommunicationsEngineering

Abstract

fetched live from OpenAlex

This article describes low latency, zero overhead DFE burst error correction technique. Without any encoder or decoder latency, the proposed technique makes use of the existing pre-cursor ISI to detect and correct errors on a burst of data. The implemented proof-of-concept 2-tap DFE prototype in 65nm CMOS operates at 16 Gb/s and compensates 32 dB loss consuming 58 mW only. With an additional 18 mW, the receiver enables error correction capability that translates to 2-to-6 dB SNR gain depending on the pre-cursor magnitude. Experimental results demonstrate that for lossy channels where pre-cursor is 60% or higher of main, this error correction outperforms RS(528, 514) without any overhead and with much lower latency and power consumption.

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.001
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.508
Threshold uncertainty score0.465

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.028
GPT teacher head0.255
Teacher spread0.227 · 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