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

推荐订阅源

IT之家
IT之家
Engineering at Meta
Engineering at Meta
腾讯CDC
宝玉的分享
宝玉的分享
H
Help Net Security
I
InfoQ
博客园 - Franky
The GitHub Blog
The GitHub Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Microsoft Security Blog
Microsoft Security Blog
M
MIT News - Artificial intelligence
博客园_首页
美团技术团队
Recent Announcements
Recent Announcements
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
雷峰网
雷峰网
The Cloudflare Blog
博客园 - 司徒正美
Vercel News
Vercel News
MyScale Blog
MyScale Blog
人人都是产品经理
人人都是产品经理
爱范儿
爱范儿
月光博客
月光博客

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
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 cs.IT 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)