Near-Field Multiuser Communications Aided by Movable Antennas
Jingze Ding, Lipeng Zhu, Zijian Zhou, Bingli Jiao, Rui Zhang

TL;DR
This paper explores the use of movable antennas at both the base station and users in near-field multiuser downlink systems, optimizing antenna positions to reduce power consumption while maintaining user rates.
Contribution
It introduces a new near-field channel model and a novel DNPPSO algorithm for efficient antenna position optimization in multiuser systems.
Findings
Significant power savings demonstrated in simulations.
Proposed algorithm reduces computational complexity.
Effective in near-field multiuser communication scenarios.
Abstract
This letter investigates movable antenna (MA)-aided downlink (DL) multiuser communication systems under the near-field channel condition, where both the base station (BS) and the users are equipped with MAs to fully exploit the degrees of freedom (DoFs) in antenna position optimization. We develop a general channel model to accurately describe the channel characteristics in the near-field region and formulate an MA-position optimization problem to minimize the BS's transmit power subject to users' individual rate constraints. To solve this problem, we propose a two-loop dynamic neighborhood pruning particle swarm optimization (DNPPSO) algorithm that significantly reduces the computational complexity as compared to the standard particle swarm optimization (PSO) algorithm while achieving similar performance. Simulation results validate the effectiveness and advantages of the proposed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAntenna Design and Analysis · Advanced MIMO Systems Optimization · Full-Duplex Wireless Communications
MethodsPruning · Balanced Selection · Mixing Adam and SGD
