MétaCan
Menu
Back to cohort
Record W1977111878 · doi:10.1109/icassp.2002.5745259

On constraint design and implementation for broadband adaptive array beamforming

2002· article· en· W1977111878 on OpenAlex
Yahong Rosa Zheng, Rafik Goubran, M. El-Tanany

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

VenueIEEE International Conference on Acoustics Speech and Signal Processing · 2002
Typearticle
Languageen
FieldEngineering
TopicAntenna Design and Optimization
Canadian institutionsCarleton University
Fundersnot available
KeywordsConstraint (computer-aided design)Adaptive beamformerBroadbandDimension (graph theory)Eigenvalues and eigenvectorsBeamformingSimple (philosophy)Computer scienceComputational complexity theoryMathematical optimizationMathematicsAlgorithmTelecommunicationsCombinatoricsPhysicsGeometry

Abstract

fetched live from OpenAlex

This paper discusses eigenvector constraint design for broadband adaptive array beam forming. The constraint equations are constructed using the real and imaginary parts of the steering vectors and the response vectors, thus perm its real arithmetic and guarantees real outputs. A simple and elegant structure is developed for implementing the designed beam former by a Generalized Sidelobe Canceler (GSC). This structure reduces the computational complexity from O (N <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> ) to O (N), where N being the dimension of the weight vector.

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: none
Teacher disagreement score0.937
Threshold uncertainty score0.635

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.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.055
GPT teacher head0.285
Teacher spread0.230 · 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