Multi-Objective Design and Optimization of Hardware-Friendly Grid-Based Sparse MIMO Arrays
Bibliographic record
Abstract
A comprehensive design framework is proposed for optimizing sparse MIMO (multiple-input, multiple-output) arrays to enhance multi-target detection. The framework emphasizes efficient utilization of antenna resources, including strategies for minimizing inter-element mutual coupling and exploring alternative grid-based sparse array (GBSA) configurations by efficiently separating interacting elements. Alternative strategies are explored to enhance angular beamforming metrics, including beamwidth (BW), peak-to-sidelobe ratio (PSLR), and grating lobe limited field of view. Additionally, a set of performance metrics is introduced to evaluate virtual aperture effectiveness and beamwidth loss factors. The framework explores optimization strategies for the partial sharing of antenna elements, specifically tailored for multi-mode radar applications, utilizing the desirability function to enhance performance across various operational modes. A novel machine learning initialization approach is introduced for rapid convergence. Key observations include the potential for peak-to-sidelobe ratio (PSLR) reduction in dense arrays and insights into GBSA feasibility and performance compared to uniform arrays. The study validates the efficacy of the proposed framework through simulated and measured results. The study emphasizes the importance of effective sparse array processing in multi-target scenarios and highlights the advantages of the proposed design framework. The proposed design framework for grid-spaced sparse arrays stands out for its superior efficiency and applicability in processing hardware compared to both uniform and non-uniform arrays.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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".