MétaCan
Menu
Back to cohort
Record W2156045320 · doi:10.1109/mwscas.2007.4488672

Time-multiplexed systolic-array processors for real-time 2D IIR beam plane-wave filters

2007· article· en· W2156045320 on OpenAlexaff
Arjuna Madanayake, Leonard T. Bruton

Bibliographic record

VenueConference proceedings · 2007
Typearticle
Languageen
FieldEngineering
TopicAdvanced Adaptive Filtering Techniques
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsInfinite impulse responseField-programmable gate arrayComputer scienceBeamformingSystolic arrayMultiplexingFilter (signal processing)Computer hardwareElectronic engineeringDigital filterAcousticsEngineeringTelecommunicationsPhysicsEmbedded systemVery-large-scale integrationComputer vision

Abstract

fetched live from OpenAlex

A systolic-array architecture for real-time implementation of M number of independent 2D IIR spatio-temporal frequency-planar beam filters is proposed. The proposed architecture enables M time-multiplexed beam filters to be implemented on hardware using the arithmetic circuit real-estate required for a single beam filter. The architecture is a building block for highly-selective 2D IIR spatio-temporal fan filter banks for real-time broadband plane-wave fan filtering applications in ultrasonic imaging, intermediatefrequency (IF) digital beamforming, directional audio, and sonar imaging. A prototype of the systolic-array for M=4 beam filters is demonstrated using FPGA circuit implementations having W-bit (W=13,14,...,17) finite-precision arithmetic circuits, and is shown to operate in real-time at up to FCLK= 125 MHz on a single Xilinx Virtex-4 sx35 10ff668 device.

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

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0050.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.025
GPT teacher head0.246
Teacher spread0.221 · 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
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

Citations2
Published2007
Admission routes1
Has abstractyes

Explore more

Same venueConference proceedingsSame topicAdvanced Adaptive Filtering TechniquesFrench-language works237,207