M-user Gaussian Interference Channels: To Decode the Interference or To Consider it as Noise

We address data transmission over the M-user Gaussian interference channel, where users send data using single Gaussian codebooks. We first present a polynomial-time algorithm for finding the maximum decodable subset among interfering users, provided the users´ rates and powers are given. Given any ordering of users, we characterize an achievable rate vector in which users´ rates are successively maximized based on the ordering. It is also shown that in a noncooperative scenario where users refuse to send below their conservative rates, there are achievable vectors that are feasible with respect to the conservative rates vector which can be obtained by using a simple iterative algorithm.