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

推荐订阅源

T
Tailwind CSS Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
雷峰网
雷峰网
量子位
有赞技术团队
有赞技术团队
阮一峰的网络日志
阮一峰的网络日志
The Cloudflare Blog
博客园 - Franky
罗磊的独立博客
宝玉的分享
宝玉的分享
博客园_首页
腾讯CDC
The GitHub Blog
The GitHub Blog
D
DataBreaches.Net
IT之家
IT之家
D
Docker
Microsoft Security Blog
Microsoft Security Blog
博客园 - 司徒正美
V
V2EX
月光博客
月光博客
N
Netflix TechBlog - Medium
爱范儿
爱范儿
I
InfoQ
P
Proofpoint News Feed

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
Energy Saving in Cell-Free Massive MIMO ISAC for Ultra-Re...
[Submitted on 18 Jan 2024 (v1), last revised 30 Jul 2026 (this v · 2024-01-19 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:Emerging 6G sensing-based applications rely on ultra-reliable target-aware actuation, where timely and accurate sensing information triggers critical actions. Achieving this requires tightly integrated sensing and communication (ISAC) under stringent reliability and latency constraints. This paper investigates ISAC in a downlink cell-free massive multiple-input multiple-output (CF-mMIMO) system supporting multi-static sensing and ultra-reliable low-latency communications (URLLC). We propose a joint power and blocklength allocation algorithm to minimize total energy consumption, accounting for both radio-site and cloud-side processing energy for communication and sensing, while meeting communication and sensing requirements. The non-convex optimization problem is solved using a combination of feasible point pursuit-successive convex approximation (FPP-SCA), concave-convex programming (CCP), and fractional programming techniques. We consider two types of target detectors: clutter-aware and clutter-unaware, each with distinct complexity and performance trade-offs. A computational complexity analysis based on giga-operations per second (GOPS) is conducted to quantify the processing requirements of communication and sensing tasks. We also introduce the refreshing rate for sensing information and derive a closed-form expression that accounts for both observation and processing delays. Simulation results show that the proposed algorithm achieves up to 34% energy reduction compared to schemes using the maximum allowable blocklength and enhances detection capability while consuming less total energy. Clutter-aware detectors, despite higher complexity, require fewer antennas and sensing receive APs, yielding up to 40% energy savings.

Submission history

From: Zinat Behdad [view email]
[v1] Thu, 18 Jan 2024 18:58:17 UTC (737 KB)
[v2] Mon, 25 Nov 2024 16:51:26 UTC (1,484 KB)
[v3] Tue, 29 Jul 2025 15:51:01 UTC (1,304 KB)
[v4] Thu, 30 Jul 2026 09:01:18 UTC (1,035 KB)