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

推荐订阅源

Vercel News
Vercel News
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Apple Machine Learning Research
Apple Machine Learning Research
T
Tailwind CSS Blog
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
人人都是产品经理
人人都是产品经理
V
V2EX
量子位
Last Week in AI
Last Week in AI
Jina AI
Jina AI
博客园 - 【当耐特】
爱范儿
爱范儿
宝玉的分享
宝玉的分享
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Hugging Face - Blog
Hugging Face - Blog
博客园 - 三生石上(FineUI控件)
有赞技术团队
有赞技术团队
小众软件
小众软件
IT之家
IT之家
博客园_首页
博客园 - 聂微东
S
SegmentFault 最新的问题
阮一峰的网络日志
阮一峰的网络日志
博客园 - 叶小钗

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
Resource Allocation for Mutualistic Symbiotic Radio with ...
Hong Guo, Yinghui Ye, Haijian Sun, Liqin Shi, Rose Qingyang Hu · 2025-09-18 · via cs.IT updates on arXiv.org

Mutualistic SR is a communication paradigm that offers high spectrum efficiency and low power consumption, where the SU transmits information by modulating and backscattering the PT's signal, enabling shared use of spectrum and power with PT. In return, the PT's performance can be enhanced by SU's backscattered signal, forming a mutualistic relationship. However, the low modulation rate causes extremely inferior transmission rates for SUs. To improve the SU transmission rate, this paper proposes a new mutualistic SR with HAPC to explore the tradeoff between BC and AC in terms of power consumption and transmission rate, enabling each SU to transmit signal via passive BC and AC alternatively. We propose two problems to maximize the total rate of all SUs under the fixed and dynamic SIC ordering, respectively. The fixed SIC ordering-based problem is to jointly optimize the SUs' reflection coefficients, the transmit power of each SU during AC, and the time allocation for each SU during BC and AC, subject to the energy causality constraint and the PT's transmission rate gain constraint. In addition to pondering the constraints involved in the fixed SIC ordering-based problem, the dynamic SIC ordering-based problem, which is a mixed integer programming one, further considers the SIC ordering constraint. The above two problems are solved by our proposed SCA-based and BCD-based iterative algorithms, respectively. Simulation results demonstrate that: 1) the proposed mutualistic SR system outperforms traditional designs in terms of the rates achieved by SUs under the same constraints; 2) the total rate of all SUs under the dynamic SIC ordering is larger than that of the fixed one when the PT's minimum rate gain is high, and becomes nearly identical when the PT's minimum rate gain is low.