MétaCan
Menu
Back to cohort
Record W2002260266 · doi:10.1109/tsp.2013.2274279

Efficient Implementation of Broadband Beamformers Using Nested Hexagonal Arrays and Frustum Filters

2013· article· en· W2002260266 on OpenAlexaff
Iman Moazzen, P. Agathoklis

Bibliographic record

VenueIEEE Transactions on Signal Processing · 2013
Typearticle
Languageen
FieldComputer Science
TopicSpeech and Audio Processing
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsFrustumHexagonal crystal systemBroadbandFilter (signal processing)SIGNAL (programming language)Aperture (computer memory)Computer scienceAcousticsMathematicsPhysicsTelecommunicationsGeometry

Abstract

fetched live from OpenAlex

A broadband beamformer is proposed based on nested hexagonal arrays, hexagonal frustum filters and multirate techniques. The nested hexagonal arrays used here consist of several hexagonal arrays of increasing size in the x-y plane (each one called subarray) where the distance between elements in each subarray is two times larger than in the previous one. The proposed beamformer consists of subarray beamformers, each one using the signals obtained from one of the nested hexagonal arrays as the input. These signals are filtered and downsampled so that the Region of Support (ROS) of the resulting 3D signals in the 3D frequency domain are the same for all subbands. The same hexagonal frustum filter design can therefore be used for all subarray beamformers to pass the desired signal and eliminate interferences. The use of nested arrays leads to larger effective aperture at low temporal frequencies and thus, better selectivity for low frequencies. Further, hexagonal arrays are known to require a lower sensor density for alias free sampling than rectangular arrays. Examples illustrate the performance of the proposed beamformer with respect to beampattern and computational complexity.

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

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.000
Insufficient payload (model declined to judge)0.0020.002

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.267
Teacher spread0.248 · 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

Citations7
Published2013
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Signal ProcessingSame topicSpeech and Audio ProcessingFrench-language works237,207