Generalized Transceiver Beamforming for DFRC With MIMO Radar and MU-MIMO Communication
Bibliographic record
Abstract
Spatial beamforming is an efficient way to realize dual-functional radar-communication (DFRC). In this paper, we study the DFRC design for a general scenario, where the dual-functional base station (BS) simultaneously detects the target as a multiple-input-multiple-output (MIMO) radar while communicating with multiple multi-antenna communication users (CUs). This necessitates a joint transceiver beamforming design for both MIMO radar and multi-user MIMO (MU-MIMO) communication. In order to characterize the performance tradeoff between MIMO radar and MU-MIMO communication, we first define the achievable performance region of the DFRC system. Then, both radar-centric and communication-centric optimizations are formulated to achieve the boundary of the performance region. For the radar-centric optimization, successive convex approximation (SCA) method is adopted to solve the non-convex constraint. For the communication-centric optimization, a solution based on weighted mean square error (MSE) criterion is obtained to solve the non-convex objective function. Furthermore, two low-complexity beamforming designs based on CU-selection and zero-forcing are proposed to avoid iteration, and the closed-form expressions of the low-complexity beamforming designs are derived. Simulation results are provided to verify the effectiveness of all proposed designs.
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.000 | 0.001 |
| 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.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".