Energy-Efficient Communication in the Presence of Synchronization Errors

Communication systems are traditionally designed to have tight transmitter–receiver synchronization. This requirement has negligible overhead in the high-signal-to-noise ratio (SNR) regime. However, in many applications, such as wireless sensor networks, communication needs to happen primarily in the energy-efficient regime of low SNR, where requiring tight synchronization can be highly suboptimal. In this paper, we model the noisy channel with synchronization errors as a duplication/deletion/substitution channel. For this channel, we propose a new communication scheme that requires only loose transmitter–receiver synchronization. We show that the proposed scheme is asymptotically optimal for the Gaussian channel with synchronization errors in terms of energy efficiency as measured by the rate per unit energy. In the process, we also establish that the lack of synchronization causes negligible loss in energy efficiency. We further show that, for a general discrete memoryless channel with synchronization errors and a general input cost function admitting a zero-cost symbol, the rate per unit cost achieved by the proposed scheme is within a factor two of the information-theoretic optimum.

[1]  Saurabh Ganeriwal,et al.  Timing-sync protocol for sensor networks , 2003, SenSys '03.

[2]  Adam Tauman Kalai,et al.  Tight asymptotic bounds for the deletion channel with small deletion probabilities , 2010, 2010 IEEE International Symposium on Information Theory.

[3]  Stefano Ruffini,et al.  Synchronization aspects in LTE small cells , 2013, IEEE Communications Magazine.

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

[5]  David Tse,et al.  Asynchronous Capacity per Unit Cost , 2013, IEEE Trans. Inf. Theory.

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

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

[8]  Eleni Drinea,et al.  Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications , 2010, IEEE Trans. Inf. Theory.

[9]  J. Massey,et al.  Optimum Frame Synchronization , 1972, IEEE Trans. Commun..

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

[11]  Michael Mitzenmacher,et al.  A Simple Lower Bound for the Capacity of the Deletion Channel , 2006, IEEE Transactions on Information Theory.

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

[13]  Yashodhan Kanoria,et al.  On the deletion channel with small deletion probability , 2009, 2010 IEEE International Symposium on Information Theory.

[14]  R. Gallager Power Limited Channels: Coding, Multiaccess, and Spread Spectrum , 2002 .