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

推荐订阅源

V
Visual Studio Blog
量子位
大猫的无限游戏
大猫的无限游戏
Hugging Face - Blog
Hugging Face - Blog
S
SegmentFault 最新的问题
Blog — PlanetScale
Blog — PlanetScale
月光博客
月光博客
Google DeepMind News
Google DeepMind News
小众软件
小众软件
WordPress大学
WordPress大学
宝玉的分享
宝玉的分享
MongoDB | Blog
MongoDB | Blog
B
Blog RSS Feed
博客园 - Franky
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
B
Blog
博客园 - 聂微东
The GitHub Blog
The GitHub Blog
Recent Announcements
Recent Announcements
Y
Y Combinator Blog
Microsoft Security Blog
Microsoft Security Blog
雷峰网
雷峰网
Jina AI
Jina AI
酷 壳 – CoolShell
酷 壳 – CoolShell

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
Exploiting Semantic Communication for Non-Orthogonal Mult...
Xidong Mu, Yuanwei Liu · 2022-09-13 · via cs.IT updates on arXiv.org

A novel semantics-empowered two-user uplink non-orthogonal multiple access (NOMA) framework is proposed for resource efficiency enhancement. More particularly, a secondary far user (F-user) employs the semantic communication (SemCom) while a primary near user (N-user) employs the conventional bit-based communication (BitCom). The fundamental performance limit, namely semantic-versus-bit (SvB) rate region, of the proposed semantics-empowered NOMA framework is characterized. The equivalent SvB rate region achieved by the conventional BitCom-based NOMA is provided as the baseline scheme. It unveils that, compared to BitCom, SemCom can significantly improve the F-user's performance when its permitted transmit power is strictly capped, but may perform worse when its permitted transmit power is high. Guided by this result, the proposed semantics-empowered NOMA framework is investigated over fading channels. An opportunistic SemCom and BitCom scheme is proposed, which enables the secondary F-user to participate in NOMA via the most suitable communication method at each fading state, thus striking a good tradeoff between its own achieved performance and the interference imposed to the primary N-user. Two scenarios are considered for employing the opportunistic scheme, namely on-off resource management and continuous resource management. For each scenario, the optimal communication policy over fading channels is derived for maximizing the ergodic semantic rate achieved at the secondary F-user, subject to the minimum ergodic bit rate constraint of the primary N-user. Numerical results show that the proposed opportunistic scheme in both scenarios can achieve higher communication performance for NOMA than the baseline schemes merely employing SemCom or BitCom.