TY - GEN
T1 - Non-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels
T2 - 2018 IEEE International Symposium on Information Theory, ISIT 2018
AU - Fong, Silas L.
AU - Yang, Jing
AU - Yener, Aylin
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/8/15
Y1 - 2018/8/15
N2 - An additive white Gaussian noise (AWGN) energy-harvesting (EH) channel is considered where the transmitter is equipped with an infinite-sized battery which stores energy harvested from the environment. The energy arrival process is modeled as a sequence of independent and identically distributed (i.i.d.) random variables. The capacity of this channel is known and is achievable by the so-called best-effort and save-and-transmit schemes. This paper investigates the best-effort scheme in the finite blocklength regime and establishes the first nonasymptotic achievable rate for it. The first-order term of the nonasymptotic achievable rate equals the capacity, and the second-order term is proportional to -sqrt log n/n - where n denotes the blocklength. The proof technique involves analyzing the escape probability of a Markov process. In addition, we use this new proof technique to analyze the save-and-transmit and obtain a new non-asymptotic achievable rate for it, whose first-order and second-order terms achieve the capacity and the scaling -1/sqrt n respectively. For all sufficiently large signal-to-noise ratios (SNRs), our new achievable rate outperforms the existing ones.
AB - An additive white Gaussian noise (AWGN) energy-harvesting (EH) channel is considered where the transmitter is equipped with an infinite-sized battery which stores energy harvested from the environment. The energy arrival process is modeled as a sequence of independent and identically distributed (i.i.d.) random variables. The capacity of this channel is known and is achievable by the so-called best-effort and save-and-transmit schemes. This paper investigates the best-effort scheme in the finite blocklength regime and establishes the first nonasymptotic achievable rate for it. The first-order term of the nonasymptotic achievable rate equals the capacity, and the second-order term is proportional to -sqrt log n/n - where n denotes the blocklength. The proof technique involves analyzing the escape probability of a Markov process. In addition, we use this new proof technique to analyze the save-and-transmit and obtain a new non-asymptotic achievable rate for it, whose first-order and second-order terms achieve the capacity and the scaling -1/sqrt n respectively. For all sufficiently large signal-to-noise ratios (SNRs), our new achievable rate outperforms the existing ones.
UR - http://www.scopus.com/inward/record.url?scp=85052468235&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85052468235&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2018.8437918
DO - 10.1109/ISIT.2018.8437918
M3 - Conference contribution
AN - SCOPUS:85052468235
SN - 9781538647806
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 871
EP - 875
BT - 2018 IEEE International Symposium on Information Theory, ISIT 2018
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 17 June 2018 through 22 June 2018
ER -