MétaCan
Menu
Back to cohort

Active Uplink Sensing Beamformer Design via Bayesian Cramér-Rao Bound Dual Optimization

2025· article· en· W4414538939 on OpenAlexaff
Nadim Ghaddar, Wei Yu

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Communication Networks Research
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsBeamformingTelecommunications linkBase stationChannel (broadcasting)Metric (unit)Bayesian optimizationMinificationOptimization problemUpper and lower boundsWireless

Abstract

fetched live from OpenAlex

This paper presents a novel optimization framework for solving active sensing problems in wireless communications, in which a base station equipped with massive multiple-input multiple-output (MIMO) and a limited number of radio-frequency chains aims to estimate the channel parameters of a sensing target. Specifically, the receive beamforming matrix at the BS is designed sequentially through optimizing the Bayesian Cramér-Rao bound (B-CRB) metric at each sensing stage, while satisfying a rank constraint and that the receive beamformers must be implementable by analog phase shifters. The proposed approach tackles this B-CRB minimization problem in the Lagrangian dual domain. This dual optimization approach has the advantage of reducing the dimension of the search space from the number of antenna elements to the number of channel parameters, which is typically much smaller for sparse mmWave channels. We propose efficient numerical methods for obtaining the primal solution from the dual and subsequentially setting the phase shifts in each active sensing stage based on this approach. Finally, we demonstrate the benefits of the proposed approach as compared to existing beamforming strategies.

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 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.001
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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.346
Threshold uncertainty score0.605

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.001
Open science0.0010.001
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.024
GPT teacher head0.294
Teacher spread0.270 · 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 teacher head, 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

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicWireless Communication Networks ResearchFrench-language works237,207