MétaCan
Menu
Back to cohort
Record W7019041408

On the Error-Free Computation of Fast Cosine Transform

2009· article· en· W7019041408 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.

fundA Canadian funder is recorded on the work.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueBulgarian Digital Mathematics Library (BulDML) at IMI-BAS (Institute of Mathematics and Informatics) · 2009
Typearticle
Languageen
FieldComputer Science
TopicDigital Filter Design and Implementation
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of CanadaCMC Microsystems
KeywordsDiscrete cosine transformModified discrete cosine transformQuantization (signal processing)Lapped transformTransform codingComputationSeparable spaceRepresentation (politics)Trigonometric functions
DOInot available

Abstract

fetched live from OpenAlex

We extend our previous work into error-free representations of transform basis functions by presenting\na novel error-free encoding scheme for the fast implementation of a Linzer-Feig Fast Cosine Transform (FCT)\nand its inverse. We discuss an 8x8 L-F scaled Discrete Cosine Transform where the architecture uses a new\nalgebraic integer quantization of the 1-D radix-8 DCT that allows the separable computation of a 2-D DCT without\nany intermediate number representation conversions. The resulting architecture is very regular and reduces\nlatency by 50% compared to a previous error-free design, with virtually the same hardware cost.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.701
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.006
Open science0.0010.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.019
GPT teacher head0.220
Teacher spread0.201 · 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