Using Distributed Rate-Splitting Game to Approach Rate Region Boundary of the Gaussian Interference Channel

TL;DR

This paper proposes a distributed rate-splitting scheme modeled as a non-cooperative game to efficiently approach the rate boundary of the Gaussian interference channel, with an algorithm to find the equilibrium and numerical results close to the HK region.

Contribution

It introduces a novel distributed rate-splitting scheme formulated as a game and develops an iterative algorithm to find the Stackelberg equilibrium, approaching the rate boundary.

Findings

The DRS scheme achieves rate-tuples close to the HK region boundary.

The existence of Stackelberg equilibrium is established for the game.

The IML-WFA algorithm efficiently reaches the equilibrium.

Abstract

Determining how to approach the rate boundary of the Gaussian interference channel in practical system is a big concern. In this paper, a distributed rate-splitting (DRS) scheme is proposed to approach the rate region boundary of the Gaussian interference channel. It is shown that the DRS scheme can be formulated as a non-cooperative game. We introduce the Stackelberg equilibrium (SE) with multiple leaders as the equilibrium point of the non-cooperative game. Therefore, an iterative multiple waterlevels water-filling algorithm (IML-WFA) is developed to efficiently reach the SE of the non-cooperative game. The existence of SE is established for the game. Numerical examples show that the rate-tuples achieved by the DRS are very close to the boundary of the well-known HK region.