Polarized 6D Movable Antenna for Wireless Communication: Channel Modeling and Optimization
Bibliographic record
Abstract
In this paper, we propose a novel polarized six-dimensional movable antenna (P-6DMA) to enhance the performance of wireless communication cost-effectively. Specifically, the P-6DMA enables polarforming by adaptively tuning the antenna’s polarization electrically as well as controls the antenna’s rotation mechanically, thereby exploiting both polarization and spatial diversity to reconfigure wireless channels for improving communication performance. First, we model the P-6DMA channel in terms of transceiver antenna polarforming vectors and antenna rotations. We then propose a new two-timescale transmission protocol to maximize the weighted sumrate for a P-6DMA-enhanced multiuser system. Specifically, antenna rotations at the base station (BS) are first optimized based on the statistical channel state information (CSI) of all users, which varies at a much slower rate compared to their instantaneous CSI. Then, transceiver polarforming vectors are designed to cater to the instantaneous CSI under the optimized BS antennas’ rotations. Under the polarforming phase shift and amplitude constraints, a new polarforming and rotation joint design problem is efficiently addressed by a low-complexity algorithm based on penalty dual decomposition, where the polarforming coefficients are updated in parallel to reduce computational time. Simulation results demonstrate the significant performance advantages of polarforming, antenna rotation, and their joint design in comparison with various benchmarks without polarforming or antenna rotation adaptation.
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.001 | 0.001 |
| 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.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".