MétaCan
Menu
Back to cohort
Record W2921807597 · doi:10.1109/isscc.2019.8662379

6.8 A 36Gb/s Adaptive Baud-Rate CDR with CTLE and 1-Tap DFE in 28nm CMOS

2019· article· en· W2921807597 on OpenAlexaff
Danny Yoo, Mohammad Bagherbeik, Wahid Rahman, Ali Sheikholeslami, Hirotaka Tamura, Takayuki Shibasaki

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvancements in PLL and VCO Technologies
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsBaudCMOSComputer scienceSerDesComparatorEqualization (audio)Electronic engineeringSampling (signal processing)Data recoveryVery-large-scale integrationComputer hardwareEmbedded systemEngineeringAlgorithmElectrical engineeringVoltageFilter (signal processing)Decoding methodsTelecommunicationsTransmission (telecommunications)

Abstract

fetched live from OpenAlex

Baud-rate clock-and-data recovery circuits (CDR) are ubiquitous in recent receiver designs as a means of lowering power consumption by sampling the data only once per UI. To further reduce power, prior works in pattern-based baud-rate PD [1] and FD [2] combine clock & data recovery by sharing comparators between the DFE and the PD. However, both CDRs [1, 2] were manually tuned by sweeping the equalization settings of the CTLE and the comparator levels in order to achieve lock. Since the two settings are correlated, it is time-consuming and tedious to sweep the entire solution space. In this paper, we propose an adaptive engine where the CDR system searches and converges to an optimal lock and sampling point. The proposed scheme, implemented in 28nm CMOS and operating at 36Gb/s, relies on the data eye to autonomously adapt the parameters of a CTLE, a 1-tap DFE, and the PD locking point.

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.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: Observational · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.273
Threshold uncertainty score0.326

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.004
GPT teacher head0.171
Teacher spread0.167 · 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.

The models applied no category: nothing in the taxonomy fit this work.
Study designObservational
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

Citations22
Published2019
Admission routes1
Has abstractyes

Explore more

Same topicAdvancements in PLL and VCO TechnologiesFrench-language works237,207