For the binary energy harvesting channel, the authors provide convex optimization formulations of Q-graph lower and upper bounds that converge to the capacity with an O(1/N) gap, enabling capacity computations to 1e-6 precision.
Optimal broadcast sched uling for an energy harvesting rechargeable transmitter with a finite ca pacity battery,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2025 1verdicts
ACCEPT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Capacity of the Binary Energy Harvesting Channel
For the binary energy harvesting channel, the authors provide convex optimization formulations of Q-graph lower and upper bounds that converge to the capacity with an O(1/N) gap, enabling capacity computations to 1e-6 precision.