Non-Asymptotic Achievable Rates For Gaussian Energy-Harvesting Channels: Best-Effort And Save-And-Transmit
2018 IEEE International Symposium on Information Theory (ISIT)(2018)
摘要
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 nona-symptotic achievable rate for it. The first-order term of the non-asymptotic achievable rate equals the capacity, and the second-order term is proportional to -root logn/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/root n respectively. For all sufficiently large signal-to-noise ratios (SNRs), our new achievable rate outperforms the existing ones.
更多查看译文
关键词
first-order terms,save-transmit schemes,AWGN EH channel,transmitter,infinite-sized battery,independent and identically distributed random variable sequences,i.i.d random variables,channel capacity,finite blocklength regime,proof technique,escape probability,Markov process,signal-to-noise ratios,SNRs,second-order terms,best-effort scheme,energy arrival process,additive white Gaussian noise energy-harvesting,Gaussian energy-harvesting channels,nonasymptotic achievable rate
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络