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

推荐订阅源

WordPress大学
WordPress大学
Engineering at Meta
Engineering at Meta
D
DataBreaches.Net
月光博客
月光博客
Recent Announcements
Recent Announcements
Google DeepMind News
Google DeepMind News
U
Unit 42
腾讯CDC
爱范儿
爱范儿
J
Java Code Geeks
有赞技术团队
有赞技术团队
Blog — PlanetScale
Blog — PlanetScale
N
Netflix TechBlog - Medium
B
Blog
Stack Overflow Blog
Stack Overflow Blog
GbyAI
GbyAI
T
The Blog of Author Tim Ferriss
小众软件
小众软件
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Y
Y Combinator Blog
大猫的无限游戏
大猫的无限游戏
Microsoft Azure Blog
Microsoft Azure Blog
T
Tailwind CSS Blog
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Low-Complexity Hybrid Precoding for Cell-Free Massive MU-...
[Submitted on 15 Jun 2026] · 2026-06-24 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:Integrated sensing and communication (ISAC) in cell-free (CF) massive multi-user multiple-input multiple-output (MU-MIMO) system is a promising architecture for high-rate communications and high-accuracy multi-target sensing. However, centralized coordination among distributed access points (APs) incurs substantial fronthaul overhead and computation complexity. This paper proposes a low-complexity hybrid precoding framework for CF massive MU-MIMO ISAC systems with partially-connected architectures at the APs. By applying hybrid architecture at the APs, the proposed framework converts the original high-dimensional channel information into a low-dimensional effective channel, enabling digital precoding over the compressed channel domain and thereby substantially reducing both fronthaul overhead and baseband computational complexity. We formulate the joint hybrid precoding design as an ergodic sum-rate (ESR) maximization problem with position error bound (PEB) constraints to ensure multi-target sensing accuracy. An efficient alternating optimization (AO)-based solver is then developed, where the PEB constraint is reformulated into tractable convex constraints, while the digital-domain optimization is carried out over the reduced-dimensional effective channel and the analog precoding is refined on the constant-modulus manifold. For dynamic user topology, we further propose multi-branch (MB) rate-splitting (RS) minimum mean-square-error Tomlinson-Harashima precoding (MMSE-THP) update algorithm that combines multi-branch ordering with recursive MMSE-THP matrix updates, enabling common and private digital precodings to be refreshed without repeated full matrix recomputation. Simulation results demonstrate that the proposed scheme achieves high ESR and accurate multi-target sensing while reducing computational complexity by 87.02\% compared with conventional baselines.

Submission history

From: Jun Zhu [view email]
[v1] Mon, 15 Jun 2026 03:42:16 UTC (346 KB)