TY - JOUR
T1 - Capacity of Energy Harvesting Binary Symmetric Channels with a (σ ,ρ ) -Power Constraint
AU - Chen, Zhengchuan
AU - Ferrante, Guido Carlo
AU - Yang, Howard H.
AU - Quek, Tony Q.S.
N1 - Funding Information:
Manuscript received September 25, 2016; revised February 4, 2017; accepted March 2, 2017. Date of publication March 23, 2017; date of current version February 14, 2018. This work was supported in part by the SUTD-ZJU Research Collaboration under Grant SUTD-ZJU/RES/01/2014 and the MOE ARF Tier 2 under Grant MOE2015-T2-2-104. This work was presented at the 2017 IEEE International Conference on Communications [1]. The associate editor coordinating the review of this paper and approving it for publication was D. Gunduz. (Corresponding author: Zhengchuan Chen.) Z. Chen is with the College of Communication Engineering, Chongqing University, Chongqing 400044, China, and also with the Information Systems Technology and Design Pillar, Singapore University of Technology and Design, Singapore 487372 (e-mail: [email protected]).
Publisher Copyright:
© 1972-2012 IEEE.
PY - 2018/2
Y1 - 2018/2
N2 - Capacity of energy harvesting communications with deterministic energy arrival and finite battery size is investigated. An abstraction of the physical layer is considered, where binary sequences are transmitted through a binary symmetric channel, and a cost function is associated with the transmission of each symbol. Upper and lower bounds on the channel capacity are derived for the general case by studying the normalized exponent of the cardinality of the set of feasible input sequences. Several upper bounds on the exponent are proposed by studying supersets of the feasible set. Lower bounds are derived by applying the binary entropy-power inequality and by using specific signaling schemes based on a save-and-transmit strategy. Numerical results are presented for several values of the energy arrival rate and battery size, validating the usefulness of the capacity bounds established for the energy harvesting channels.
AB - Capacity of energy harvesting communications with deterministic energy arrival and finite battery size is investigated. An abstraction of the physical layer is considered, where binary sequences are transmitted through a binary symmetric channel, and a cost function is associated with the transmission of each symbol. Upper and lower bounds on the channel capacity are derived for the general case by studying the normalized exponent of the cardinality of the set of feasible input sequences. Several upper bounds on the exponent are proposed by studying supersets of the feasible set. Lower bounds are derived by applying the binary entropy-power inequality and by using specific signaling schemes based on a save-and-transmit strategy. Numerical results are presented for several values of the energy arrival rate and battery size, validating the usefulness of the capacity bounds established for the energy harvesting channels.
UR - http://www.scopus.com/inward/record.url?scp=85042208433&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85042208433&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2017.2686865
DO - 10.1109/TCOMM.2017.2686865
M3 - Article
AN - SCOPUS:85042208433
SN - 0090-6778
VL - 66
SP - 601
EP - 614
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 2
ER -