To Decode the Interference or to Consider It as Noise

In this paper, the impact of noncoordinated interfering signals on a point to point communication is addressed. While the transmitter has no information about the other users' messages, the receiver has full knowledge of the codebooks of the interfering users and can potentially decode some part of the interference. A simple coding strategy is proposed for this channel. Assuming its own data is decoded successfully, the receiver partitions the set of interfering users into two disjoint subsets, namely the set of decodable users and the set of nondecodable users. Then the transmitter's rate is chosen such that the intended signal can be jointly decoded with the set of decodable users. It is proved that the proposed strategy achieves the capacity of the additive Gaussian channel with Gaussian interfering users. A polynomial time algorithm is proposed to compute the achievable rate of the scheme. This algorithm is based a subroutine which separates the set of interfering users into decodable and nondecodable users in polynomial time. The proposed scheme is also applied to the case of -user interference channel and some achievable points are characterized by successive maximization of users' rates.

[1]  Satoru Iwata,et al.  A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.

[2]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[3]  Te Sun Han,et al.  The Capacity Region of General Multiple-Access Channel with Certain Correlated Sources , 1979, Inf. Control..

[4]  Jeffrey G. Andrews,et al.  The Effect of Fading, Channel Inversion, and Threshold Scheduling on Ad Hoc Networks , 2007, IEEE Transactions on Information Theory.

[5]  Mehul Motani,et al.  On The Han–Kobayashi Region for theInterference Channel , 2008, IEEE Transactions on Information Theory.

[6]  H. Boche,et al.  Iterative algorithm for finding optimal resource allocations in symbol-asynchronous CDMA channels with different SIR requirements , 2002, Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002..

[7]  Abhay Parekh,et al.  Spectrum sharing for unlicensed bands , 2005, IEEE Journal on Selected Areas in Communications.

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

[9]  R. Ahlswede.  The Capacity Region of a Channel with Two Senders and Two Receivers , 1974 .

[10]  Emre Telatar,et al.  Information-theoretic upper bounds on the capacity of large extended ad hoc wireless networks , 2005, IEEE Transactions on Information Theory.

[11]  Nonlinear functional analysis and its applications, part I: Fixed-point theorems , 1991 .

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

[13]  Amir K. Khandani,et al.  Optimal Order of Decoding for Max-Min Fairness in K-User Memoryless Interference Channels , 2007, 2007 IEEE International Symposium on Information Theory.

[14]  Gerhard Kramer,et al.  A New Outer Bound and the Noisy-Interference Sum–Rate Capacity for Gaussian Interference Channels , 2007, IEEE Transactions on Information Theory.

[15]  Thomas M. Cover,et al.  Broadcast channels , 1972, IEEE Trans. Inf. Theory.

[16]  Igal Sason,et al.  On achievable rate regions for the Gaussian interference channel , 2004, IEEE Transactions on Information Theory.

[17]  Xiaodong Wang,et al.  Outage Minimization and Rate Allocation for the Multiuser Gaussian Interference Channels With Successive Group Decoding , 2009, IEEE Transactions on Information Theory.

[18]  Alexander Schrijver,et al.  A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.

[19]  Aydano B. Carleial,et al.  A case where interference does not reduce capacity (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[20]  Shunsuke Ihara,et al.  On the Capacity of Channels with Additive Non-Gaussian Noise , 1978, Inf. Control..

[21]  David Gesbert,et al.  Joint power control and user scheduling in multicell wireless networks: Capacity scaling laws , 2007, ArXiv.

[22]  Jeffrey G. Andrews,et al.  Transmission Capacity of Wireless Ad Hoc Networks With Successive Interference Cancellation , 2007, IEEE Transactions on Information Theory.

[23]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[24]  Aydano B. Carleial,et al.  Interference channels , 1978, IEEE Trans. Inf. Theory.

[25]  Hiroshi Sato,et al.  The capacity of the Gaussian interference channel under strong interference , 1981, IEEE Trans. Inf. Theory.

[26]  Amir K. Khandani,et al.  Capacity bounds for the Gaussian Interference Channel , 2008, 2008 IEEE International Symposium on Information Theory.

[27]  Slawomir Stanczak,et al.  Convexity of some feasible QoS regions and asymptotic behavior of the minimum total power in CDMA systems , 2004, IEEE Transactions on Communications.

[28]  Igal Sason.  On achievable rate regions for the Gaussian interference channel , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[29]  Max H. M. Costa,et al.  On the Gaussian interference channel , 1985, IEEE Trans. Inf. Theory.

[30]  Suhas N. Diggavi,et al.  The worst additive noise under a covariance constraint , 2001, IEEE Trans. Inf. Theory.

[31]  Amir K. Khandani,et al.  Throughput Scaling Laws for Wireless Networks With Fading Channels , 2007, IEEE Transactions on Information Theory.

[32]  Rudolf Mathar,et al.  Capacity regions and optimal power allocation for CDMA cellular radio , 2005, IEEE Transactions on Information Theory.

[33]  Jacob Wolfowitz,et al.  Multiple Access Channels , 1978 .