MétaCan
Menu
Back to cohort
Record W1956559477 · doi:10.1109/acc.2003.1243770

Designing of adaptive bandpass filter with adjustable notch for frequency demodulation

2004· article· en· W1956559477 on OpenAlexaff
Qing Zhang, Lyndon J. Brown

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Adaptive Filtering Techniques
Canadian institutionsWestern University
Fundersnot available
KeywordsControl theory (sociology)Band-stop filterBand-pass filterTransfer functionBandwidth (computing)Adaptive filterDemodulationComputer scienceController (irrigation)Feedback loopLow-pass filterFilter (signal processing)Electronic engineeringEngineeringAlgorithmTelecommunicationsArtificial intelligence

Abstract

fetched live from OpenAlex

The state variables of an internal model controller in a feedback loop can provide direct estimate of the instantaneous frequency of a signal. An adaptive algorithm to identify and track the instantaneous frequency was developed in our previous works (L.J. Brown et. al., 2002, June 2003). This approach has as design parameters a fictitious plant and feedback controller. This paper presents a strategy for choosing the transfer functions of the fictitious plant and controller to incorporate a desired filter in the scheme. By choosing and designing the suitable forms and coefficients of transfer functions for the controller and plant in the system, a bandpass filter with an adjustable notch can be achieved. The location of the notch frequency is adjusted in the range of bandwidth by our adaptive algorithm. It is shown that a bandpass filter characteristics enhances the ability of the algorithm to reject noise. However, simulations show that this benefit comes at the expense of slower transient characteristics of the feedback loop which has negative consequence for identification of the instantaneous frequency.

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.001
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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.001
Threshold uncertainty score0.004

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.000
Open science0.0010.000
Research integrity0.0010.000
Insufficient payload (model declined to judge)0.0010.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.020
GPT teacher head0.221
Teacher spread0.202 · 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 designSimulation or modeling
Domainnot available
GenreMethods

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
Published2004
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Adaptive Filtering TechniquesFrench-language works237,207