MétaCan
Menu
← Back to cohort
Record W1562137704 · doi:10.1002/9783527631506.ch6

Switched‐Capacitor Filters

2010· other· en· W1562137704 on OpenAlexaff
R. Raut, M. N. S. Swamy

Bibliographic record

Venuenot available
Typeother
Languageen
FieldComputer Science
TopicNeural Networks and Applications
Canadian institutionsConcordia University
Fundersnot available
KeywordsSwitched capacitorCapacitorElectrical engineeringEngineeringVoltage

Abstract

fetched live from OpenAlex

This chapter introduces the topic of second-order switched-capacitor (SC) filters. It deals with the equivalence between a resistance and an SC. The chapter introduces the notion of discrete time operation, and explores several possible transform relations between the frequency in sampled-data time domain and continuous-time frequency domain. It then addresses case of bilinear transformation (BLT). The chapter considers the situation of parasitic capacitances associated with physical switches and capacitors, and presents the technique of parasitic-insensitive (PI) operation. It describes a simple method of analysis of SC networks using discrete-time and z-transformed equations. Techniques for analyzing SC networks using common network analysis tools are suggested. The chapter outlines the design of a second-order SC filter, using standard structures. In addition, the chapter discusses the potential of realizing high-frequency SC filters with unity-gain voltage amplifiers as the active building blocks. Finally, some second-order filter structures based on unity-gain amplifiers (UGAs) are presented.

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.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Other · Consensus signal: none
Teacher disagreement score0.019
Threshold uncertainty score0.065

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0010.000
Scholarly communication0.0020.001
Open science0.0010.000
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0190.003

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.010
GPT teacher head0.229
Teacher spread0.218 · 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 designNot applicable
Domainnot available
GenreOther

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

Citations0
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicNeural Networks and Applications→French-language works237,207→