Intermittent Communication

We formulate a model for intermittent communication that can capture bursty transmissions or a sporadically available channel, where in either case the receiver does not know $a~priori$ when the transmissions will occur. Focusing on the point-to-point case, we develop a decoding structure, decoding from pattern detection, and its achievable rate for such communication scenarios. Decoding from pattern detection first detects the locations of code word symbols and then uses them to decode. We introduce the concept of partial divergence and study some of its properties in order to obtain stronger achievability results. As the system becomes more intermittent, the achievable rates decrease due to the additional uncertainty about the positions of the code word symbols at the decoder. In addition, we provide upper bounds on the capacity of binary noiseless intermittent communication with the help of a genie-aided encoder and decoder. The upper bounds imply a tradeoff between the capacity and the intermittency rate of the communication system, even if the receive window scales linearly with the code word length.

[1]  Urs Niesen,et al.  Energy-efficient communication in the presence of synchronization errors , 2013, 2013 IEEE International Symposium on Information Theory.

[2]  Yury Polyanskiy.  Asynchronous Communication: Exact Synchronization, Universality, and Dispersion , 2013, IEEE Transactions on Information Theory.

[3]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[4]  Dario Fertonani,et al.  Novel Bounds on the Capacity of the Binary Deletion Channel , 2010, IEEE Transactions on Information Theory.

[5]  Giuseppe Caire,et al.  Energy and Sampling Constrained Asynchronous Communication , 2013, IEEE Transactions on Information Theory.

[6]  Gregory W. Wornell,et al.  Communication Under Strong Asynchronism , 2007, IEEE Transactions on Information Theory.

[7]  Eleni Drinea,et al.  Directly Lower Bounding the Information Capacity for Channels With I.I.D. Deletions and Duplications , 2010, IEEE Transactions on Information Theory.

[8]  Michael Mitzenmacher,et al.  Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels , 2007, IEEE Transactions on Information Theory.

[9]  Sergio Verdú,et al.  On channel capacity per unit cost , 1990, IEEE Trans. Inf. Theory.

[10]  Richard E. Blahut,et al.  Computation of channel capacity and rate-distortion functions , 1972, IEEE Trans. Inf. Theory.

[11]  Sae-Young Chung,et al.  Error exponents in asynchronous communication , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[12]  J. Nicholas Laneman,et al.  Communications overhead as the cost of constraints , 2011, 2011 IEEE Information Theory Workshop.

[13]  Suhas N. Diggavi,et al.  Capacity Upper Bounds for the Deletion Channel , 2007, 2007 IEEE International Symposium on Information Theory.

[14]  Sae-Young Chung,et al.  On reliability functions for single-message unequal error protection , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[15]  Michael Mitzenmacher,et al.  A Survey of Results for Deletion Channels and Related Synchronization Channels , 2008, SWAT.

[16]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[17]  Gregory W. Wornell,et al.  Asynchronous Communication: Capacity Bounds and Suboptimality of Training , 2013, IEEE Transactions on Information Theory.

[18]  J. Nicholas Laneman,et al.  Upper bounds on the capacity of binary intermittent communication , 2013, 2013 Information Theory and Applications Workshop (ITA).

[19]  J. Nicholas Laneman,et al.  Intermittent communication and partial divergence , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[20]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[21]  J. Nicholas Laneman,et al.  Achievable rates for intermittent communication , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[22]  David Tse,et al.  Asynchronous Capacity per Unit Cost , 2010, IEEE Transactions on Information Theory.

[23]  Michael Mitzenmacher,et al.  Capacity Bounds for Sticky Channels , 2008, IEEE Transactions on Information Theory.

[24]  Gregory W. Wornell,et al.  Optimal Sequential Frame Synchronization , 2007, IEEE Transactions on Information Theory.

[25]  Thomas M. Cover,et al.  Network Information Theory , 2001 .

[26]  Dario Fertonani,et al.  Bounds on the Capacity of Channels with Insertions, Deletions and Substitutions , 2011, IEEE Transactions on Communications.

[27]  Suhas N. Diggavi,et al.  On information transmission over a finite buffer channel , 2000, IEEE Transactions on Information Theory.

[28]  Kannan Ramchandran,et al.  Achievable Rates for Channels With Deletions and Insertions , 2011, IEEE Transactions on Information Theory.

[29]  R. Gallager.  SEQUENTIAL DECODING FOR BINARY CHANNELS WITH NOISE AND SYNCHRONIZATION ERRORS , 1961 .