Adaptive data-transition decision feedback equalizer for serial links
Bibliographic record
Abstract
Data-state decision feedback equalizers (DFEs) suffer from a fundamental drawback of deteriorating vertical eye-opening when consecutive 1s or 0s are present in data. To combat this, a new data-transition adaptive DFE termed data-transition DFE is proposed. We show that data-transition DFE does not reduce vertical eye-opening whereas data-state DFE shrinks vertical eye-opening when consecutive 1s or 0s are present. We further show for the high-frequency components of data, datatransition DFE is capable of increasing vertical eye-opening. Although data-state DFE is also capable of increasing vertical eye-opening for the high-frequency components of data, this is at the expense of sacrificing vertical eye-opening for the low-frequency components of data. The stronger the DFE action, the severer the reduction of the vertical eye-opening of the low-frequency components of data. The optimal tap of data-state DFE occurs when the vertical eye-opening of the low-frequency components of data is the same as that of the high-frequency components of data. Moreover, we show that data-transition DFE not only offers a unity signal transfer function at low frequencies where most of the energy of data is located but also provides first-order shaping on the difference between the desired and equalized data. Both give rise large vertical eye-opening. The theoretical findings are validated using the simulation results of two serial links, one with data-state DFE with loop-unrolling and the other with the data-transition DFE designed in TSMC 65 nm CMOS technology.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".