On code design for simultaneous energy and information transfer

Anshoo Tandon, Mehul Motani, Lav R Varshney

Research output: Contribution to conferencePaper

Abstract

We consider the problem of binary code design for simultaneous energy and information transfer where the receiver completely relies on the received signal for fulfilling its real-time power requirements. The receiver, in this scenario, would need a certain amount of energy (derived from the received signal) within a sliding time window for its continuous operation. In order to meet this energy requirement at the receiver, the transmitter should use only those codewords which carry sufficient energy. In this paper, we assume that the transmitter uses on-off keying where bit one corresponds to transmission of a high energy signal. The transmitter uses only those codewords which have at least dones in a sliding window of W = d + 1 bits. We show that with this constraint, the noiseless code capacity is achieved by sequences generated from a finite state Markov machine. We also investigate achievable rates when such constrained codes are used on noisy communication channels. Although a few of these results are well known for run-length limited codes used for data storage, they do not seem to appear in literature in the form presented here.

Original languageEnglish (US)
DOIs
StatePublished - Jan 1 2014
Event2014 IEEE Information Theory and Applications Workshop, ITA 2014 - San Diego, CA, United States
Duration: Feb 9 2014Feb 14 2014

Other

Other2014 IEEE Information Theory and Applications Workshop, ITA 2014
CountryUnited States
CitySan Diego, CA
Period2/9/142/14/14

Fingerprint

Transmitters
Binary codes
Data storage equipment
Amplitude shift keying

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Cite this

Tandon, A., Motani, M., & Varshney, L. R. (2014). On code design for simultaneous energy and information transfer. Paper presented at 2014 IEEE Information Theory and Applications Workshop, ITA 2014, San Diego, CA, United States. https://doi.org/10.1109/ITA.2014.6804257

On code design for simultaneous energy and information transfer. / Tandon, Anshoo; Motani, Mehul; Varshney, Lav R.

2014. Paper presented at 2014 IEEE Information Theory and Applications Workshop, ITA 2014, San Diego, CA, United States.

Research output: Contribution to conferencePaper

Tandon, A, Motani, M & Varshney, LR 2014, 'On code design for simultaneous energy and information transfer' Paper presented at 2014 IEEE Information Theory and Applications Workshop, ITA 2014, San Diego, CA, United States, 2/9/14 - 2/14/14, . https://doi.org/10.1109/ITA.2014.6804257
Tandon A, Motani M, Varshney LR. On code design for simultaneous energy and information transfer. 2014. Paper presented at 2014 IEEE Information Theory and Applications Workshop, ITA 2014, San Diego, CA, United States. https://doi.org/10.1109/ITA.2014.6804257
Tandon, Anshoo ; Motani, Mehul ; Varshney, Lav R. / On code design for simultaneous energy and information transfer. Paper presented at 2014 IEEE Information Theory and Applications Workshop, ITA 2014, San Diego, CA, United States.
@conference{84db029ca8ee4010a7ceb53ab9665328,
title = "On code design for simultaneous energy and information transfer",
abstract = "We consider the problem of binary code design for simultaneous energy and information transfer where the receiver completely relies on the received signal for fulfilling its real-time power requirements. The receiver, in this scenario, would need a certain amount of energy (derived from the received signal) within a sliding time window for its continuous operation. In order to meet this energy requirement at the receiver, the transmitter should use only those codewords which carry sufficient energy. In this paper, we assume that the transmitter uses on-off keying where bit one corresponds to transmission of a high energy signal. The transmitter uses only those codewords which have at least dones in a sliding window of W = d + 1 bits. We show that with this constraint, the noiseless code capacity is achieved by sequences generated from a finite state Markov machine. We also investigate achievable rates when such constrained codes are used on noisy communication channels. Although a few of these results are well known for run-length limited codes used for data storage, they do not seem to appear in literature in the form presented here.",
author = "Anshoo Tandon and Mehul Motani and Varshney, {Lav R}",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/ITA.2014.6804257",
language = "English (US)",
note = "2014 IEEE Information Theory and Applications Workshop, ITA 2014 ; Conference date: 09-02-2014 Through 14-02-2014",

}

TY - CONF

T1 - On code design for simultaneous energy and information transfer

AU - Tandon, Anshoo

AU - Motani, Mehul

AU - Varshney, Lav R

PY - 2014/1/1

Y1 - 2014/1/1

N2 - We consider the problem of binary code design for simultaneous energy and information transfer where the receiver completely relies on the received signal for fulfilling its real-time power requirements. The receiver, in this scenario, would need a certain amount of energy (derived from the received signal) within a sliding time window for its continuous operation. In order to meet this energy requirement at the receiver, the transmitter should use only those codewords which carry sufficient energy. In this paper, we assume that the transmitter uses on-off keying where bit one corresponds to transmission of a high energy signal. The transmitter uses only those codewords which have at least dones in a sliding window of W = d + 1 bits. We show that with this constraint, the noiseless code capacity is achieved by sequences generated from a finite state Markov machine. We also investigate achievable rates when such constrained codes are used on noisy communication channels. Although a few of these results are well known for run-length limited codes used for data storage, they do not seem to appear in literature in the form presented here.

AB - We consider the problem of binary code design for simultaneous energy and information transfer where the receiver completely relies on the received signal for fulfilling its real-time power requirements. The receiver, in this scenario, would need a certain amount of energy (derived from the received signal) within a sliding time window for its continuous operation. In order to meet this energy requirement at the receiver, the transmitter should use only those codewords which carry sufficient energy. In this paper, we assume that the transmitter uses on-off keying where bit one corresponds to transmission of a high energy signal. The transmitter uses only those codewords which have at least dones in a sliding window of W = d + 1 bits. We show that with this constraint, the noiseless code capacity is achieved by sequences generated from a finite state Markov machine. We also investigate achievable rates when such constrained codes are used on noisy communication channels. Although a few of these results are well known for run-length limited codes used for data storage, they do not seem to appear in literature in the form presented here.

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

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

U2 - 10.1109/ITA.2014.6804257

DO - 10.1109/ITA.2014.6804257

M3 - Paper

AN - SCOPUS:84901227912

ER -