Non-Asymptotic Achievable Rates for Energy-Harvesting Channels Using Save-And-Transmit

Silas L. Fong, Vincent Y.F. Tan, Jing Yang

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

This paper investigates the information-Theoretic limits of energy-harvesting (EH) channels in the finite blocklength regime. The EH process is characterized by a sequence of i.i.d. random variables with finite variances. We use the save-And-Transmit strategy proposed by Ozel and Ulukus (2012) together with Shannon's non-Asymptotic achievability bound to obtain lower bounds on the achievable rates for both additive white Gaussian noise channels and discrete memoryless channels under EH constraints. The first-order terms of the lower bounds of the achievable rates are equal to C and the second-order (backoff from capacity) terms are proportional to-√ Log n/n where n denotes the blocklength and C denotes the capacity of the EH channel which is the same as the capacity without the EH constraints. The constant of proportionality of the backoff term is found and qualitative interpretations are provided.

Original languageEnglish (US)
Article number7542530
Pages (from-to)3499-3511
Number of pages13
JournalIEEE Journal on Selected Areas in Communications
Volume34
Issue number12
DOIs
StatePublished - Dec 1 2016

Fingerprint

Energy harvesting
Random variables

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{080ef1fe6bb94a36b88c69b272e5461b,
title = "Non-Asymptotic Achievable Rates for Energy-Harvesting Channels Using Save-And-Transmit",
abstract = "This paper investigates the information-Theoretic limits of energy-harvesting (EH) channels in the finite blocklength regime. The EH process is characterized by a sequence of i.i.d. random variables with finite variances. We use the save-And-Transmit strategy proposed by Ozel and Ulukus (2012) together with Shannon's non-Asymptotic achievability bound to obtain lower bounds on the achievable rates for both additive white Gaussian noise channels and discrete memoryless channels under EH constraints. The first-order terms of the lower bounds of the achievable rates are equal to C and the second-order (backoff from capacity) terms are proportional to-√ Log n/n where n denotes the blocklength and C denotes the capacity of the EH channel which is the same as the capacity without the EH constraints. The constant of proportionality of the backoff term is found and qualitative interpretations are provided.",
author = "Fong, {Silas L.} and Tan, {Vincent Y.F.} and Jing Yang",
year = "2016",
month = "12",
day = "1",
doi = "10.1109/JSAC.2016.2600138",
language = "English (US)",
volume = "34",
pages = "3499--3511",
journal = "IEEE Journal on Selected Areas in Communications",
issn = "0733-8716",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "12",

}

Non-Asymptotic Achievable Rates for Energy-Harvesting Channels Using Save-And-Transmit. / Fong, Silas L.; Tan, Vincent Y.F.; Yang, Jing.

In: IEEE Journal on Selected Areas in Communications, Vol. 34, No. 12, 7542530, 01.12.2016, p. 3499-3511.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Non-Asymptotic Achievable Rates for Energy-Harvesting Channels Using Save-And-Transmit

AU - Fong, Silas L.

AU - Tan, Vincent Y.F.

AU - Yang, Jing

PY - 2016/12/1

Y1 - 2016/12/1

N2 - This paper investigates the information-Theoretic limits of energy-harvesting (EH) channels in the finite blocklength regime. The EH process is characterized by a sequence of i.i.d. random variables with finite variances. We use the save-And-Transmit strategy proposed by Ozel and Ulukus (2012) together with Shannon's non-Asymptotic achievability bound to obtain lower bounds on the achievable rates for both additive white Gaussian noise channels and discrete memoryless channels under EH constraints. The first-order terms of the lower bounds of the achievable rates are equal to C and the second-order (backoff from capacity) terms are proportional to-√ Log n/n where n denotes the blocklength and C denotes the capacity of the EH channel which is the same as the capacity without the EH constraints. The constant of proportionality of the backoff term is found and qualitative interpretations are provided.

AB - This paper investigates the information-Theoretic limits of energy-harvesting (EH) channels in the finite blocklength regime. The EH process is characterized by a sequence of i.i.d. random variables with finite variances. We use the save-And-Transmit strategy proposed by Ozel and Ulukus (2012) together with Shannon's non-Asymptotic achievability bound to obtain lower bounds on the achievable rates for both additive white Gaussian noise channels and discrete memoryless channels under EH constraints. The first-order terms of the lower bounds of the achievable rates are equal to C and the second-order (backoff from capacity) terms are proportional to-√ Log n/n where n denotes the blocklength and C denotes the capacity of the EH channel which is the same as the capacity without the EH constraints. The constant of proportionality of the backoff term is found and qualitative interpretations are provided.

UR - http://www.scopus.com/inward/record.url?scp=85009724737&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85009724737&partnerID=8YFLogxK

U2 - 10.1109/JSAC.2016.2600138

DO - 10.1109/JSAC.2016.2600138

M3 - Article

AN - SCOPUS:85009724737

VL - 34

SP - 3499

EP - 3511

JO - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

SN - 0733-8716

IS - 12

M1 - 7542530

ER -