Finite Blocklength Achievable Rates for Energy Harvesting AWGN Channels with Infinite Buffer
K Gautam Shenoy, Vinod Sharma

TL;DR
This paper derives a lower bound on the maximum achievable coding rate for energy harvesting AWGN channels with infinite buffers at finite blocklengths, advancing understanding of their performance limits.
Contribution
It introduces a new lower bound on the maximal codebook size for finite blocklengths in energy harvesting AWGN channels with infinite buffers, improving upon existing bounds.
Findings
New lower bound on achievable rates at finite blocklengths.
Improved understanding of energy harvesting channel performance.
Enhanced bounds compared to previous work.
Abstract
We consider an additive White Gaussian channel where the transmitter is powered by an energy harvesting source. For such a system, we provide a lower bound on the maximal code book at finite code lengths that improves upon previously known bounds.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
