MétaCan
Menu
Back to cohort
Record W2953439278 · doi:10.1109/tcsii.2019.2924455

High-Throughput Low-Latency Encoder and Decoder for a Class of Generalized Reed–Solomon Codes for Short-Reach Optical Communications

2019· article· en· W2953439278 on OpenAlexaff
B. Zheng, Carlo Condo, Warren J. Gross, Odile Liboiron-Ladouceur

Bibliographic record

VenueIEEE Transactions on Circuits & Systems II Express Briefs · 2019
Typearticle
Languageen
FieldComputer Science
TopicCoding theory and cryptography
Canadian institutionsMcGill University
Fundersnot available
KeywordsEncoderComputer scienceLatency (audio)ThroughputCMOSComputer hardwarePower consumptionError detection and correctionLow latency (capital markets)Forward error correctionDecoding methodsEmbedded systemPower (physics)Electronic engineeringComputer networkTelecommunicationsAlgorithmEngineeringWirelessOperating system

Abstract

fetched live from OpenAlex

Forward error correction is imperative in most communication systems. Applications like short-reach optical communications have a limited power and area occupation budget for encoder and decoder implementation. In this brief, we propose high-throughput low-latency Reed Solomon (RS) encoder and decoder architectures, compatible with a recently proposed class of generalized RS codes. The architectures are synthesized in TSMC 65 nm CMOS technology, showing a significant performance improvement with moderate hardware cost and power consumption. Throughput is increased by ×11.5 for the encoder, with respect to a conventional architecture, while the latency is reduced by ×10.3. These improvements respectively amount to ×14.7 and ×7.5 for the decoder.

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 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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.899
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0010.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.267
Teacher spread0.239 · 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 teacher head, not a consensus.

Study designTheoretical or conceptual
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

Citations4
Published2019
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Circuits & Systems II Express BriefsSame topicCoding theory and cryptographyFrench-language works237,207