Movable Antenna Enabled Integrated Sensing and Communication
Bibliographic record
Abstract
In this paper, we investigate a novel integrated sensing and communication (ISAC) system aided by movable antennas (MAs). A bistatic radar system, in which the base station (BS) is configured with MAs, is integrated into a multi-user multiple-input-single-output (MU-MISO) system. Flexible beamforming is studied by jointly optimizing the antenna coefficients and the antenna positions. Compared to conventional fixed-position antennas (FPAs), MAs provide a new degree of freedom (DoF) in beamforming to reconfigure the field response, and further improve the received signal quality for both wireless communication and sensing. We propose a communication rate and sensing mutual information (MI) maximization problem by flexible beamforming optimization. The complex fractional objective function with logarithms are first transformed with the fractional programming (FP) framework. Then, we propose an efficient algorithm to address the non-convex problem with coupled variables by alternatively solving four sub-problems. We derive the closed-form expression to update the antenna coefficients by Karush-Kuhn-Tucker (KKT) conditions. To improve the direct gradient ascent (DGA) scheme in updating the positions of the antennas, a 3-stage search-based projected GA (SPGA) method is proposed. Simulation results show that MAs significantly enhance the overall performance of the ISAC system, achieving 59.8% performance gain compared to conventional ISAC system enabled by FPAs. Meanwhile, the proposed SPGA-based method has remarkable performance improvement compared the DGA method in antenna position optimization.
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.000 |
| 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.000 | 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".