MétaCan
Menu
Back to cohort
Record W1957158527 · doi:10.1109/iscas.1993.393796

A method of evaluating the effects of signal quantization at arbitrary locations in recursive digital filters

2002· article· en· W1957158527 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venue1993 IEEE International Symposium on Circuits and Systems · 2002
Typearticle
Languageen
FieldComputer Science
TopicDigital Filter Design and Implementation
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsQuantization (signal processing)Upper and lower boundsDigital filterAlgorithmComputer scienceIterative methodNorm (philosophy)Digital signal processingInvariant (physics)Recursive filterMathematicsFilter (signal processing)Mathematical analysisRoot-raised-cosine filterComputer vision

Abstract

fetched live from OpenAlex

Digital implementations of recursive discrete time linear shift invariant filters require that signals within the filter be quantized. The problem of characterizing the effects of quantization operations at arbitrary locations within recursive digital filters is examined. A bound on the peak amplitude of undesirable error signals due to quantization is developed. This bound can be expressed in both closed form and iterative form. A means of computing the number of iterations required for both the iterative bound and the l/sub 1/ norm bound to converge to a specified accuracy is derived.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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: Empirical · Consensus signal: none
Teacher disagreement score0.929
Threshold uncertainty score0.356

Codex and Gemma teacher scores by category

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.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.057
GPT teacher head0.320
Teacher spread0.262 · 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