Asynchronous Transmission over Gaussian Interference Channels with Stochastic Data Arrival

This paper addresses a Gaussian interference channel with two transmitter-receiver~(Tx-Rx) pairs under stochastic data arrival~(GIC-SDA). Information bits arrive at the transmitters according to independent and asynchronous Bernoulli processes~(Tx-Tx~asynchrony). Each information source turns off after generating a given total number of bits. The transmissions are \textit{asynchronous} (Tx-Rx~asynchrony) in the sense that each Tx sends a codeword to its Rx immediately after there are enough bits available in its buffer. Such asynchronous style of transmission is shown to significantly reduce the transmission delay in comparison with the existing Tx-Rx synchronous transmission schemes. The receivers learn the activity frames of both transmitters by employing sequential joint-typicality detection. As a consequence, the GIC-SDA under Tx-Rx asynchrony is represented by a standard GIC with state known at the receivers. The cardinality of the state space is $\binom{2N_1+2N_2}{2N_2}$ in which $N_1, N_2$ are the numbers of transmitted codewords by the two transmitters. Each realization of the state imposes two sets of constraints on $N_1, N_2$ referred to as the geometric and reliability constraints. In a scenario where the transmitters are only aware of the statistics of Tx-Tx~asynchrony, it is shown how one designs $N_1,N_2$ to achieve target transmission rates for both users and minimize the probability of unsuccessful decoding.

[1]  Te Sun Han,et al.  A new achievable rate region for the interference channel , 1981, IEEE Trans. Inf. Theory.

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

[3]  Umberto Spagnolini,et al.  Stable Throughput of Cognitive Radios With and Without Relaying Capability , 2007, IEEE Transactions on Communications.

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

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

[6]  Dudley,et al.  Real Analysis and Probability: Measurability: Borel Isomorphism and Analytic Sets , 2002 .

[7]  Massimo Franceschetti,et al.  Random Access: An Information-Theoretic Perspective , 2012, IEEE Transactions on Information Theory.

[8]  Patrick Mitran,et al.  Achievable rates in cognitive radio channels , 2006, IEEE Transactions on Information Theory.

[9]  Anthony Ephremides,et al.  Information Theory and Communication Networks: An Unconsummated Union , 1998, IEEE Trans. Inf. Theory.

[10]  James L. Massey,et al.  The collision channel without feedback , 1985, IEEE Trans. Inf. Theory.

[11]  Robert J. McEliece,et al.  Asynchronous multiple-access channel capacity , 1981, IEEE Trans. Inf. Theory.

[12]  Gábor Lugosi,et al.  Concentration Inequalities - A Nonasymptotic Theory of Independence , 2013, Concentration Inequalities.

[13]  I-Hsiang Wang,et al.  A relay can increase degrees of freedom in bursty mimo interference networks , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[14]  Ashutosh Sabharwal,et al.  Paranoid Secondary: Waterfilling in a Cognitive Interference Channel with Partial Knowledge , 2012, IEEE Transactions on Wireless Communications.

[15]  Pierre A. Humblet,et al.  The capacity region of the totally asynchronous multiple-access channel , 1985, IEEE Trans. Inf. Theory.

[16]  Hua Wang,et al.  Gaussian Interference Channel Capacity to Within One Bit , 2007, IEEE Transactions on Information Theory.

[17]  Sergio Verdú,et al.  A general formula for channel capacity , 1994, IEEE Trans. Inf. Theory.

[18]  Vinod M. Prabhakaran,et al.  Harnessing bursty interference , 2009, 2009 IEEE Information Theory Workshop on Networking and Information Theory.

[19]  Josep Vidal,et al.  On the totally asynchronous interference channel with single-user receivers , 2009, 2009 IEEE International Symposium on Information Theory.

[20]  Kamyar Moshksar,et al.  Decentralized Wireless Networks With Asynchronous Users and Burst Transmissions , 2015, IEEE Transactions on Information Theory.

[21]  Suhas N. Diggavi,et al.  Interference channels with bursty traffic and delayed feedback , 2013, 2013 IEEE 14th Workshop on Signal Processing Advances in Wireless Communications (SPAWC).

[22]  Eli Upfal,et al.  Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .