A Blind Background Calibration Technique for Super-Regenerative Receivers
Bibliographic record
Abstract
In this brief, a blind background calibration technique for super-regenerative receivers (SRRs) is presented. The proposed calibration scheme is designed to help SRRs to maintain their high sensitivity and immunity to negative transconductance (${\mathrm {-}\mathrm {G}}_{\mathrm {m}}$) variations under process-voltage- temperature (PVT) variations. Unlike the conventional foreground${-\mathrm {G}}_{\mathrm {m}}$variations calibration techniques that require interruption of the receiver input, the proposed calibration technique employs input signal statistics and does not require interruption of the input bit-stream for extraction of the errors. The proposed scheme is based on an adaptive algorithm that compares the probability distribution of the pseudorandom-input (PI) stream and the output of the super-regenerative oscillator (SRO) and forces them to coincide at the end of the calibration. The proposed technique is implemented using a mixed-signal detection circuit and a finite state machine (FSM) that drives an 8-bit successive approximation register (SAR) to adjust the compensation current in the SRO. The simulation results successfully verify the effectiveness and reliability of the proposed calibration technique and show significant improvements in terms of SRR sensitivity under different process corners.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".