MétaCan
Menu
Back to cohort
Record W2592790278

Simulation of potential adaptive array algorithms for 3G CDMA systems

2002· article· en· W2592790278 on OpenAlex
Danyan Chen, A.K. Elhakeem

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

VenueInternational Symposium on Antenna Technology and Applied Electromagnetics · 2002
Typearticle
Languageen
FieldEngineering
TopicAdvanced Adaptive Filtering Techniques
Canadian institutionsConcordia University
Fundersnot available
KeywordsCode division multiple accessBeamformingComputer scienceAlgorithmBase stationAdaptive beamformerChannel (broadcasting)Antenna arraySignal-to-noise ratio (imaging)Smart antennaSignal-to-interference-plus-noise ratioInterference (communication)Electronic engineeringAntenna (radio)TelecommunicationsEngineeringDirectional antennaPower (physics)
DOInot available

Abstract

fetched live from OpenAlex

The goal of using adaptive arrays is to increase the Signal-to-Interference-Noise Ratio (SINR) of the communication in order to reduce error rates and to lead to better utilization of the capacity of the channel. This paper considers a number of algorithms that could be used for antenna array receivers in the mobile-to-base station link of a cellular code division multiple access (CDMA) system. Two classes of algorithms are considered: non-blind and blind adaptive beamforming algorithms. For non-blind beamforming, two solutions are presented: 1) LMS solution with training sequence, 2) Wiener solution with pilot channel on reverse link of 3G CDMA systems. For blind beamforming, we choose Least Squares De-spread Re-spread Multitarget Constant Modulus Algorithm (LS-DRMTCMA). The simulation results show the improvement of both system SINR and BER.

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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.927
Threshold uncertainty score0.814

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.012
GPT teacher head0.229
Teacher spread0.217 · 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