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

推荐订阅源

云风的 BLOG
云风的 BLOG
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
J
Java Code Geeks
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Engineering at Meta
Engineering at Meta
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
小众软件
小众软件
博客园 - 聂微东
酷 壳 – CoolShell
酷 壳 – CoolShell
月光博客
月光博客
Last Week in AI
Last Week in AI
博客园_首页
I
InfoQ
T
Tailwind CSS Blog
爱范儿
爱范儿
雷峰网
雷峰网
Recent Announcements
Recent Announcements
F
Fortinet All Blogs
B
Blog
WordPress大学
WordPress大学
A
About on SuperTechFans
V
Visual Studio Blog
有赞技术团队
有赞技术团队
P
Proofpoint News Feed

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
Cache-Aided Combination Networks with Interference
Ahmed Roushdy, Abolfazl Seyed Motahari, Mohammed Nafie, Deniz Gu · 2018-12-16 · via cs.IT updates on arXiv.org

Centralized coded caching and delivery is studied for a radio access combination network (RACN), whereby a set of $H$ edge nodes (ENs), connected to a cloud server via orthogonal fronthaul links with limited capacity, serve a total of $K$ user equipments (UEs) over wireless links. Each user, equipped with a cache of size $μ_R N F$ bits, is connected to a distinct set of $r$ ENs each of which equipped with a cache of size $μ_T N F$ bits, where $μ_T$, $μ_R \in [0,1]$ are the fractional cache capacities of the UEs and the ENs, respectively. The objective is to minimize the normalized delivery time (NDT. Three coded caching and transmission schemes are considered, namely the\textit{ MDS-IA}, \textit{soft-transfer} and \textit{ zero-forcing (ZF)} schemes. The achievable NDT for MDS-IA scheme is presented for $r=2$ and arbitrary fractional cache sizes $μ_T$ and $μ_R$, and also for arbitrary value of $r$ and fractional cache size $μ_T$ when the cache capacity of the UE is above a certain threshold. The achievable NDT for the soft-transfer scheme is presented for arbitrary $r$ and arbitrary fractional cache sizes $μ_T$ and $μ_R$. The last scheme utilizes ZF between the ENs and the UEs without the participation of the cloud server in the delivery phase. The achievable NDT for this scheme is presented for an arbitrary value of $r$ when the total cache size at a pair of UE and EN is sufficient to store the whole library, i.e., $μ_T+μ_R \geq 1$. The results indicate that the fronthaul capacity determines which scheme achieves a better performance in terms of the NDT, and the soft-transfer scheme becomes favorable as the fronthaul capacity increases.