Achievable rate regions for interference channel with two relays

In this paper, we introduce discrete memoryless Interference Channel (IFC) with two relays as two interfering transmitter-receiver pairs that are aided by two relays. We propose two different coding strategies for this channel. In the first strategy, we assume that each relay tries to mainly help one of the transmitter-receiver pairs through signal relaying and interference cancellation, while in the second strategy we assume that each relay tries to help both transmitter-receiver pairs. In our coding schemes, we employ rate-splitting, generalized block Markov coding, superposition coding and Gel´fand-Pinsker binning to cancel parts of the interference known to be experienced at the receivers. The derived achievable rate regions can be specialized to new achievable rate regions for discrete memoryless IFC with a relay. Under special conditions, the derived achievable rate regions also reduce to some previously known ones.transmitter-receiver pairs.