惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

C
Check Point Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
博客园 - 聂微东
月光博客
月光博客
博客园 - 司徒正美
爱范儿
爱范儿
aimingoo的专栏
aimingoo的专栏
量子位
Recent Announcements
Recent Announcements
V
V2EX
P
Proofpoint News Feed
小众软件
小众软件
云风的 BLOG
云风的 BLOG
腾讯CDC
宝玉的分享
宝玉的分享
Microsoft Azure Blog
Microsoft Azure Blog
大猫的无限游戏
大猫的无限游戏
Vercel News
Vercel News
The GitHub Blog
The GitHub Blog
A
About on SuperTechFans
B
Blog
博客园_首页
GbyAI
GbyAI
博客园 - Franky

cs.IT updates on arXiv.org

Theoretical Limits of Language Model Alignment $f$-Divergence Regularized RLHF: Two Tales of Sampling and Unified Analyses A Unified Measure-Theoretic View of Diffusion, Score-Based, and Flow Matching Generative Models When Can Voting Help, Hurt, or Change Course? Exact Structure of Binary Test-Time Aggregation When Semantic Communication Meets Queueing: Cross-Layer Latency and Task Fidelity Optimization Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation Conditional Diffusion Under Linear Constraints: Langevin Mixing and Information-Theoretic Guarantees Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Expert Routing for Communication-Efficient MoE via Finite Expert Banks Contextual Memory-Enhanced Source Coding for Low-SNR Communications Realizable Bayes-Consistency for General Metric Losses Leveraging Code Automorphisms for Improved Syndrome-Based Neural Decoding A Hierarchical Sampling Framework for bounding the Generalization Error of Federated Learning Dueling DDQN-Based Adaptive Multi-Objective Handover Optimization for LEO Satellite Networks The Causal Description Gap: Information-Theoretic Separations Across Pearl's Hierarchy Optimization of CV-QKD Under Practical Constraints Benchmarking Wireless Representations: High-Dimensional vs. Compressed Embeddings for Efficiency and Robustness Real-Time Text Transmission via LLM-Based Entropy Coding over Fixed-Rate Channels SwiftChannel: Algorithm-Hardware Co-Design for Deep Learning-Based 5G Channel Estimation Evolving Token Communication with Parametric Memory Network Remote Action Generation: Remote Control with Minimal Communication The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions Stabilizing Private LASSO under Heterogeneous Covariates via Anisotropic Objective Perturbation Linear-Readout Floors and Threshold Recovery in Computation in Superposition Soft Graph Diffusion Transformer for MIMO Detection Hierarchical Federated Learning for Networked AI: From Communication Saving to Architecture-Aware Design Exponential families from a single KL identity MIFair: A Mutual-Information Framework for Intersectionality and Multiclass Fairness Diffusion-OAMP for Joint Image Compression and Wireless Transmission Decoupled Descent: Exact Test Error Tracking Via Approximate Message Passing
Capacity Characterization and Formation Optimization for ...
Yong Zeng · 2026-05-14 · via cs.IT updates on arXiv.org

For a multi-user multiple-input multiple-output (MU-MIMO) wireless communication system, imagining that the locations of the users are now fully controllable, what is the maximum sum-capacity, and what are the corresponding optimal user locations? While these questions are irrelevant in conventional human-centric communications with random user mobility, they become critically important for emerging applications involving ground or aerial robots. This paper addresses these fundamental questions in the context of MU-MIMO communications with an unmanned aerial vehicle (UAV) swarm acting as the users. To this end, we first derive closed-form expressions for the sum-capacity of MU-MIMO UAV swarm communications. Our results reveal that, compared to conventional MU-MIMO systems, the additional degrees of freedom provided by the coordinated mobility of the UAV swarm yields substantial capacity enhancement. Specifically, when the base station (BS) is equipped with an $M$-element uniform linear array (ULA), the full spatial multiplexing gain and beamforming gain, both equal to $M$, can be achieved simultaneously. For a BS with a uniform planar array (UPA), we show that asymptotically $\frac{πM}{4}$ users can simultaneously enjoy the full beamforming gain $M$. Furthermore, we propose a novel framework to optimize UAV swarm formation for maximizing the sum-capacity achieved by successive interference cancellation (SIC) and maximizing the sum-rate via treating interference as noise (TIN), taking into account practical considerations such as collision avoidance and swarm cohesion constraints. By exploiting the manifold structure of the array response vectors with respect to UAV directions, we develop an efficient algorithm to solve the resulting non-convex formation optimization problems. Extensive simulation results demonstrate that the proposed algorithms achieve near-optimal performance.