Training-Based Adaptive Transmit–Receive Beamforming for MIMO Radars
Bibliographic record
Abstract
The recent advancements in digital control of the waveforms transmitted by radar systems has enabled implementation of multiple-input multiple-output radar systems. In such radars, each element is capable of transmitting a different waveform; in this paper, we focus on modifying a multiplicative weight at each transmitter to improve detection performance. Several authors have considered the problem of optimizing the transmit weights and the receive filter generally to maximize the output signal-to-interference-plus-noise ratio. Crucially, these previous works assumed a priori knowledge of the required second-order statistics. In this regard, we make two key contributions: First, we formulate and solve an optimization problem to estimate these required statistics using only signals received in previous coherent processing intervals (CPIs). Essentially, we estimate the transmit interference covariance matrix using receive data. The estimation does not assume any specific structure for the clutter covariance matrix. By using the most recent CPIs in the design, our approach makes it possible to track changes in the interference environment, and, therefore, adaptively design the transmit code in real time. Second, we introduce reduced-dimension processing for transmit adaptivity. As in the case of receive space-time adaptive processing (STAP), it is crucial to be able to perform filter design with only a limited number of available training samples. While reduced-dimension processing is well established for receive adaptivity, as we will see, transmit reduced-dimension processing requires a completely different formulation. We consider transmit code design for a single look angle-Doppler bin and also for a range of Doppler bins in the case that the target Doppler shift is unknown. Finally, we present simulation results, in the context of phase-perturbed propagation and airborne radars, to illustrate the performance of the proposed 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 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.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".