Padded Coprime Arrays for Improved DOA Estimation: Exploiting Hole Representation and Filling Strategies
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.
Bibliographic record
Abstract
As a generalized coprime array structure, the coprime array with displaced subarrays (CADiS) allows a large minimum inter-element spacing by introducing a specific displacement between two sparse subarrays. While this structure can effectively reduce mutual coupling, the holes in its difference co-array greatly decrease the achievable number of uniform degrees of freedom (DOFs). In this paper, we first provide a complete characterization for the hole locations in the difference co-array generated by a tailored CADiS (tCADiS) as the union of four subsets of locations related via simple symmetry properties. We then introduce two representation approaches for the hole locations, revealing that the latter can be generated from the differences between sensor locations in the subarray of tCADiS and a small uniform linear array, referred to as a padded subarray. Subsequently, we propose novel padded coprime arrays (PCAs) by incorporating the padded subarray into tCADiS to enlarge the consecutive segments in the difference co-array. This not only contributes to increase the number of available uniform DOFs, but also helps mitigating the mutual coupling by limiting the number of sensor pairs with small separations. Finally, numerical simulation results are provided to demonstrate the superiority of PCAs over existing sparse array configurations in terms of DOF, mutual coupling and DOA estimation accuracy.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.002 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it