Design of spectrally compatible waveform with constant modulus for colocated multiple‐input multiple‐output radar
Bibliographic record
Abstract
This study investigates the problem of designing unimodular waveform with spectral compatibility for multiple‐input multiple‐output radar in the presence of multiple targets and the signal‐dependent interferences. A new approach is proposed to optimise the spectrally compatible radar waveform subject to not only the constant modulus constraint and the similarity constraint but also the signal‐to‐interference‐plus‐noise ratio (SINR) requirements for targets, aiming at suppressing the radar energy in some space‐frequency areas occupied by other cooperative communication systems. However, the formulated optimisation problem is NP‐hard because of the existence of the non‐convex constraints. Based on the dual ascent framework, the authors develop an iterative algorithm to solve this challenging problem. The receive filter is obtained at the beginning of each iteration with the off‐the‐shelf technique and an innovative method termed phase‐only dual ascent method is proposed to get the desired waveform. Additionally, they analyse the performance of the waveforms designed under the global SINR constraint and the local SINR constraint, respectively. Moreover, the convergence of the proposed algorithm is discussed concretely. Finally, the numerical simulations are provided to show the validity of the proposed approach.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| 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".