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

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

2009-02-26

arxiv.org/abs/0902.4577v3

Computer Science

Information Theory

29 pages, 10 figures, submitted to IEEE Trans on Information Theory,Feb.,2009

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Using Distributed Rate-Splitting Game to Approach Rate Region Boundary of the Gaussian Interference Channel does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Using Distributed Rate-Splitting Game to Approach Rate Region Boundary of the Gaussian Interference Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Using Distributed Rate-Splitting Game to Approach Rate Region Boundary of the Gaussian Interference Channel will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-254350