Asynchronous Capacity per Unit Cost
From MaRDI portal
Publication:2989339
DOI10.1109/TIT.2012.2236914zbMATH Open1364.94022arXiv1007.4872MaRDI QIDQ2989339FDOQ2989339
Authors: Venkat Chandar, David N. C. Tse, Aslan Tchamkerten 
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: The capacity per unit cost, or equivalently minimum cost to transmit one bit, is a well-studied quantity. It has been studied under the assumption of full synchrony between the transmitter and the receiver. In many applications, such as sensor networks, transmissions are very bursty, with small amounts of bits arriving infrequently at random times. In such scenarios, the cost of acquiring synchronization is significant and one is interested in the fundamental limits on communication without assuming a priori synchronization. In this paper, we show that the minimum cost to transmit B bits of information asynchronously is (B + �ar{H})k_sync, where k_sync is the synchronous minimum cost per bit and �ar{H} is a measure of timing uncertainty equal to the entropy for most reasonable arrival time distributions. This result holds when the transmitter can stay idle at no cost and is a particular case of a general result which holds for arbitrary cost functions.
Full work available at URL: https://arxiv.org/abs/1007.4872
This page was built for publication: Asynchronous Capacity per Unit Cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989339)
