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

推荐订阅源

罗磊的独立博客
U
Unit 42
N
Netflix TechBlog - Medium
人人都是产品经理
人人都是产品经理
Hugging Face - Blog
Hugging Face - Blog
腾讯CDC
小众软件
小众软件
V
Visual Studio Blog
T
Tailwind CSS Blog
Engineering at Meta
Engineering at Meta
博客园 - 叶小钗
GbyAI
GbyAI
爱范儿
爱范儿
雷峰网
雷峰网
Microsoft Azure Blog
Microsoft Azure Blog
D
DataBreaches.Net
博客园_首页
D
Docker
A
About on SuperTechFans
G
Google Developers Blog
I
InfoQ
T
The Blog of Author Tim Ferriss
V
V2EX
博客园 - 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
Continuous Aperture Array (CAPA)-Based Multi-Group Multic...
Mengyu Qian, Xidong Mu, Li You, Michail Matthaiou · 2025-05-02 · via cs.IT updates on arXiv.org

A continuous aperture array (CAPA)-based multi-group multicast communication system is investigated. An integral-based CAPA multi-group multicast beamforming design is formulated for the maximization of the system energy efficiency (EE), subject to a minimum multicast SE constraint of each user group and a total transmit power constraint. To address this non-econvex fractional programming problem, the Dinkelbach's method is employed. Within the Dinkelbach's framework, the non-convex group-wise multicast spectral efficiency (SE) constraint is first equivalently transformed into a tractable form with auxiliary variables. Then, an efficient block coordinate descent (BCD)-based algorithm is developed to solve the reformulated problem. The CAPA beamforming design subproblem can be optimally solved via the Lagrangian dual method and the calculus of variations (CoV) theory. It reveals that the optimal CAPA beamformer should be a combination of all the groups' user channels. To further reduce the computational complexity, a low-complexity zero-forcing (ZF)-based approach is proposed. The closed-form ZF CAPA beamformer is derived using each group's most representative user channel to mitigate the inter-group interference while ensuring the intra-group multicast performance. Then, the beamforming design subproblem in the BCD-based algorithm becomes a convex power allocation subproblem, which can be efficiently solved. Numerical results demonstrate that 1) the CAPA can significantly improve the EE compared to conventional spatially discrete arrays (SPDAs); 2) due to the enhanced spatial resolutions, increasing the aperture size of CAPA is not always beneficial for EE enhancement in multicast scenarios; and 3) wider user distributions of each group cause a significant EE degradation of CAPA compared to SPDA.