Achievable Rate Regions for Discrete Memoryless Interference Channel with State Information

TL;DR

This paper investigates the capacity limits of a state-dependent two-user interference channel with non-causal state information at transmitters, proposing two coding schemes and establishing achievable rate regions.

Contribution

It introduces two novel coding schemes using rate splitting and Gel'fand-Pinsker coding for the discrete memoryless interference channel with state information.

Findings

Achievable rate regions are established for the proposed schemes.

Simultaneous and superposition encoding methods are analyzed.

The schemes improve understanding of capacity limits in state-dependent interference channels.

Abstract

In this paper, we study the state-dependent two-user interference channel, where the state information is non-causally known at both transmitters but unknown to either of the receivers. We propose two coding schemes for the discrete memoryless case: simultaneous encoding for the sub-messages in the first one and superposition encoding in the second one, both with rate splitting and Gel'fand-Pinsker coding. The corresponding achievable rate regions are established.