MétaCan
Menu
Back to cohort
Record W2133978553 · doi:10.1109/igcc.2011.6008606

An efficient CMOS rectifier with low-voltage operation for RFID tags

2011· article· en· W2133978553 on OpenAlexaff
Pouya Kamalinejad, Shahriar Mirabbasi, Victor C. M. Leung

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicEnergy Harvesting in Wireless Networks
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsCMOSRectifier (neural networks)TransistorElectrical engineeringVoltageElectronic engineeringPrecision rectifierComputer scienceEngineeringPower factor

Abstract

fetched live from OpenAlex

A high-efficiency CMOS rectifier for radio-frequency identification (RFID) applications is presented. Using an on-chip generated clock signal, a new switching scheme is proposed to enhance the power efficiency of the conventional 4 transistor (4T)-cell rectifier. By switching the gate of charge-transfer transistors to the intermediate nodes of preceding and succeeding stages, low on-resistance and small leakage current are obtained simultaneously. To further improve the low-voltage operation capability, an external gate-boosting technique is also applied to the proposed design which enables an efficient operation for input voltage levels well below the nominal standard threshold voltage of MOS transistors. The two proposed rectifier architectures are designed and laid out in a standard 0.13μm CMOS technology. For a 950 MHz RF input and 10 kΩ output load, post-layout simulation results confirm a power conversion efficiency (PCE) of 74% at -10 dBm and 57%at -26 dBm for switched 4T-cell and gate-boosted switched 4T-cell, respectively. While the PCE of the proposed switched 4T-cell rectifier compares favorably with that of the state-of-the-art rectifier designs, the gate-boosted version achieves a relatively high PCE while operating with a very low input power.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.006

Distilled classifier scores by category (both heads)

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.0010.001
Open science0.0010.000
Research integrity0.0010.000
Insufficient payload (model declined to judge)0.0020.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.

Opus teacher head0.012
GPT teacher head0.197
Teacher spread0.185 · 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 source (direct Gemma or distilled Codex), not a consensus.

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

Citations8
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicEnergy Harvesting in Wireless NetworksFrench-language works237,207