MétaCan
Menu
Back to cohort
Record W2154489416 · doi:10.1109/isspa.2001.949836

An on-line CORDIC based 2-D IDCT implementation using distributed arithmetic

2002· article· en· W2154489416 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNumerical Methods and Algorithms
Canadian institutionsConcordia University
Fundersnot available
KeywordsCORDICComputer scienceVery-large-scale integrationParallel computingBlock (permutation group theory)ArithmeticAdderComputationComputer hardwareCMOSAlgorithmEmbedded systemField-programmable gate arrayMathematicsElectronic engineering

Abstract

fetched live from OpenAlex

This paper presents a cost-effective VLSI architecture for a two-dimensional (2-D) inverse discrete cosine transform (IDCT) core based on a modified on-line CORDIC algorithm. In order to have a low hardware complexity and to provide a good performance, the proposed design is based on the row-column decomposition approach and distributed arithmetic (DA). By reformulating the 1-D IDCT functions using the CORDIC approach, the proposed design requires about 60% less ROM than the conventional DA-based IDCT without using CORDIC. In our architecture the on-line algorithm is used to further reduce the area and to enhance the computation speed. The core operates on blocks of 8/spl times/8 pixels, with 12-bit and 8-bit precision for inputs and outputs, respectively. The proposed design has been synthesized by using 0.35-/spl mu/m CMOS technology. The simulation results show that the core for IDCT can run at 150 MHz with 60 Mpixel/s throughput, while meeting the requirement of the H.26x standard.

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: Methods · Consensus signal: Methods
Teacher disagreement score0.988
Threshold uncertainty score0.428

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
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.102
GPT teacher head0.385
Teacher spread0.283 · 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

Quick stats

Citations6
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicNumerical Methods and AlgorithmsFrench-language works237,207