Achievable Rates of Gaussian Interference Channel with Multi‐Layer Rate‐Splitting and Successive Simple Decoding

Abstract

The capacity bound of the Gaussian interference channel (IC) has received extensive research interests in recent years. Since the IC model consists of multiple transmitters and multiple receivers, its exact capacity region is generally unknown. One well‐known capacity achieving method in IC is Han‐Kobayashi (H‐K) scheme, which applies two‐layer rate‐splitting (RS) and simultaneous decoding (SD) as the pivotal techniques and is proven to achieve the IC capacity region within 1 bit. However, the computational complexity of SD grows exponentially with the number of independent signal layers, which is not affordable in practice. To this end, we propose a scheme which employs multi‐layer RS at the transmitters and successive simple decoding (SSD) at the receivers in the two‐transmitter and two‐receiver IC model and then study the achievable sum capacity of this scheme. Compared with the complicated SD, SSD regards interference as noise and thus has linear complexity. We first analyze the asymptotic achievable sum capacity of IC with equal‐power multi‐layer RS and SSD, where the number of layers approaches to infinity. Specifically, we derive the closed‐form expression of the achievable sum capacity of the proposed scheme in symmetric IC, where the proposed scheme only suffers from a little capacity loss compared with SD. We then present the achievable sum capacity with finite‐layer RS and SSD. We also derive the sufficient conditions where employing finite‐layer RS may even achieve larger sum capacity than that with infinite‐layer RS. Finally, numerical simulations are proposed to validate that multi‐layer RS and SSD are not generally weaker than SD with respect to the achievable sum capacity, at least for some certain channel gain conditions of IC.