Abstract
The sum capacity of the general K-user Gaussian Interference Channel (GIC) is known only when the channel coefficients are such that treating interference as noise (TIN) is optimal. The Han-Kobayashi (HK) scheme is an extensively studied coding scheme for the K-user interference channel (IC). Simple HK schemes are HK schemes with Gaussian signaling, no time sharing and no private-common power splitting. The class of simple HK (S-HK) schemes includes the TIN scheme and schemes that involve various levels of interference decoding and cancellation at each receiver. For the 2-user GIC, simple HK schemes are sufficient to achieve all known sum capacity results—sum capacity under mixed, strong and noisy interference conditions. We derive channel conditions under which simple HK schemes achieve sum capacity for general K-user Gaussian ICs. For the K-user GIC, these results generalize existing sum capacity results for the TIN scheme to the class of simple HK schemes.
Highlights
Wireless cellular networks have evolved significantly in terms of both channel-adaptive transmission and interference management
For the general K-user Gaussian Interference Channel (GIC), the channel conditions under which Treating Interference as Noise (TIN) achieves sum capacity were obtained in References [5] (Thm. 3) and [9] (Thm. 9)
We derive two sets of channel conditions for the general K-user GIC under which sum capacity is achieved by simple HK (S-HK) schemes
Summary
Wireless cellular networks have evolved significantly in terms of both channel-adaptive transmission and interference management. For the general K-user GIC, the channel conditions under which Treating Interference as Noise (TIN) achieves sum capacity were obtained in References [5] (Thm. 3) and [9] (Thm. 9). We derive two sets of channel conditions under which S-HK schemes are sum capacity optimal for general K-user GICs. For the first set of channel conditions, we consider schemes where interference is decoded and cancelled before decoding the desired message. For the second set of channel conditions, we consider schemes where the one interference signal is jointly decoded with the message signal at one of the receivers These two sets of channel conditions provide us new sum capacity results for several channel conditions under which sum capacity was not known earlier. Three different random network models are considered and we observe that this probability is significant under all three models
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have