Robust widely linear beamforming using estimation of extended covariance matrix and steering vector
Bibliographic record
Abstract
Abstract The distribution of the received signals in many array processing applications is noncircular. Although optimal widely linear beamformer (WLB) can provide the best performance for noncircular received signals, its performance degrades severely under model mismatches in practical applications. As a remedy, we propose a robust WLB by using precise reconstruction of extended interference-plus-noise covariance matrix (EINCM) and low-complexity estimation of extended desired signal steering vector (EDSSV). We propose to first determine the steering vectors, powers, and noncircularity coefficients of all signals and the noise power. In contrast to the previous reconstruction methods using the integration over a wide angular sector, we reconstruct the interference-plus-noise covariance matrix (INCM) and the pseudo INCM accurately according to their definitions. By using INCM and pseudo INCM, we can precisely reconstruct the EINCM. We propose to estimate the EDSSV by intersecting two extended subspaces, which are respectively formed by eigendecomposing the extended sample covariance matrix and the extended desired signal covariance matrix. Unlike the convex optimization methods, the proposed EDSSV estimation does not require any optimization programming and yields a solution with closed expression in low computational complexity. Simulation results show that the proposed robust WLB provides near optimal performance under several model mismatch cases.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".