Skip to main navigation Skip to search Skip to main content

Energy and sampling constrained asynchronous communication

  • MIT Lincoln Laboratory
  • D. E. Shaw and Co.
  • TU Berlin

Research output: Contribution to journalArticlepeer-review

10 Citations (Scopus)

Abstract

The minimum energy, and, more generally, the minimum cost, to transmit 1 bit of information was recently derived for bursty communication when the information is available infrequently at random times at the transmitter. This result assumes that the receiver is always in the listening mode and samples all channel outputs until it makes a decision. Since sampling is in practice one of the receiver's most energy consuming functions, a natural question is to evaluate capacity per unit cost when the receiver is sampling constrained. This paper investigates such a setting where the receiver can sample only a given fraction ρ ε (0, 1] of the channel outputs. It is shown that regardless of ρ > 0 , the asynchronous capacity per unit cost is the same as under full sampling, i.e., when ρ = 1. Moreover, a sparse output sampling does not even impact decoding delay - the elapsed time between when information is available and when it is decoded. Hence, surprisingly, it suffices to sample an arbitrarily small fraction of the channel outputs and yet achieve the same (asymptotic) performance as under full output sampling.

Original languageEnglish
Article number6960771
Pages (from-to)7686-7697
Number of pages12
JournalIEEE Transactions on Information Theory
Volume60
Issue number12
DOIs
Publication statusPublished - 1 Dec 2014

Keywords

  • Asynchronous communication
  • bursty communication
  • capacity per unit cost
  • change-point detection
  • energy
  • error exponents
  • hypothesis testing
  • sensor networks
  • sequential decoding
  • sparse communication
  • sparse sampling
  • synchronization

Fingerprint

Dive into the research topics of 'Energy and sampling constrained asynchronous communication'. Together they form a unique fingerprint.

Cite this