On the Scaling Exponent of Polar Codes for Binary-Input Energy-Harvesting Channels
Silas L. Fong, Vincent Y. F. Tan

TL;DR
This paper establishes that the scaling exponent of polar codes for binary-input energy-harvesting channels remains bounded by 4.714, indicating that energy-harvesting constraints do not slow down the rate of convergence to capacity.
Contribution
It extends the known upper bound on the scaling exponent of polar codes to energy-harvesting channels, showing EH constraints do not affect the convergence rate.
Findings
The upper bound of 4.714 on the scaling exponent applies to EH channels.
EH constraints do not worsen the convergence rate of polar codes.
The result leverages existing analyses and strategies for BMSCs and EH channels.
Abstract
This paper investigates the scaling exponent of polar codes for binary-input energy-harvesting (EH) channels with infinite-capacity batteries. The EH process is characterized by a sequence of i.i.d. random variables with finite variances. The scaling exponent of polar codes for a binary-input memoryless channel (BMC) characterizes the closest gap between the capacity and non-asymptotic rates achieved by polar codes with error probabilities no larger than some non-vanishing . It has been shown that for any , the scaling exponent for any binary-input memoryless symmetric channel (BMSC) with lies between 3.579 and 4.714 , where the upper bound was shown by an explicit construction of polar codes. Our main result shows that remains to be a valid upper bound on the scaling exponent for any binary-input…
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.
