WLB-CANUN: Widely Linear Beamforming in Coprime Array With Non-Uniform Noise
Bibliographic record
Abstract
The performance of widely linear beamforming (WLB) is superior to adaptive beamforming, but it is limited by the uniform linear array geometry and non-uniform noise. In this paper, to overcome these limitations together, we propose a framework for widely linear beamforming in coprime array with non-uniform noise (WLB-CANUN). We subtract the non-uniform noise component from the coprime array sample covariance matrix, and vectorize the resulted matrix to create the difference co-array (DCA). Since the DCA is not uniform, we interpolate it and recover its signal by formulating the atomic norm minimization problem with the Toeplitz and orthogonal subspace constraints.The pseudo sample covariance matrix of coprime array does not contain the non-uniform noise component, which can be directly vectorized to create the sum co-array (SCA). Due to the non-uniformity of SCA, we interpolate it and recover its signal by formulating another atomic norm minimization problem with the Hankel and orthogonal subspace constraints. The directions of non-circular signals can be estimated by the traditional subspace method, which are utilized to estimate their non-circular coefficients. A least square optimization problem using the sample and pseudo sample covariance matrices of coprime array is formulated and solved to estimate the powers of non-circular signals. The interference-plus-noise covariance matrix (INCM), pseudo INCM and augmented INCM of coprime array are reconstructed, so that the ultimate augmented weight vector can be calculated. Simulation results indicate that the proposed WLB-CANUN method overcomes the limitations of WLB in coprime array with non-uniform noise, and enhances the performance compared to the existing WLB methods.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".