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

推荐订阅源

freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
T
Tailwind CSS Blog
J
Java Code Geeks
Microsoft Azure Blog
Microsoft Azure Blog
GbyAI
GbyAI
爱范儿
爱范儿
量子位
Martin Fowler
Martin Fowler
V
V2EX
博客园 - 三生石上(FineUI控件)
I
InfoQ
MongoDB | Blog
MongoDB | Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
N
Netflix TechBlog - Medium
D
DataBreaches.Net
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
Last Week in AI
Last Week in AI
U
Unit 42
Apple Machine Learning Research
Apple Machine Learning Research
H
Help Net Security
T
The Blog of Author Tim Ferriss
Hugging Face - Blog
Hugging Face - Blog
美团技术团队
Engineering at Meta
Engineering at Meta

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
Dynamic Resource Allocation for Multiple-Antenna Wireless...
Gang Yang, Chin Keong Ho, Yong Liang Guan · 2013-11-17 · via cs.IT updates on arXiv.org

We consider a point-to-point multiple-input-single-output (MISO) system where a receiver harvests energy from a wireless power transmitter to power itself for various applications. The transmitter performs energy beamforming by using an instantaneous channel state information (CSI). The CSI is estimated at the receiver by training via a preamble, and fed back to the transmitter. The channel estimate is more accurate when longer preamble is used, but less time is left for wireless power transfer before the channel changes. To maximize the harvested energy, in this paper, we address the key challenge of balancing the time resource used for channel estimation and wireless power transfer (WPT), and also investigate the allocation of energy resource used for wireless power transfer. First, we consider the general scenario where the preamble length is allowed to vary dynamically. Taking into account the effects of imperfect CSI, the optimal preamble length is obtained online by solving a dynamic programming (DP) problem. The solution is shown to be a threshold-type policy that depends only on the channel estimate power. Next, we consider the scenario in which the preamble length is fixed. The optimal preamble length is optimized offline. Furthermore, we derive the optimal power allocation schemes for both scenarios. For the scenario of dynamic-length preamble, the power is allocated according to both the optimal preamble length and the channel estimate power; while for the scenario of fixed-length preamble, the power is allocated according to only the channel estimate power. The analysis results are validated by numerical simulations. Encouragingly, with optimal power allocation, the harvested energy by using optimized fixed-length preamble is almost the same as the harvested energy by employing dynamic-length preamble, hence allowing a low-complexity WPT system to be implemented in practice.