###### Options

# On the Gaussian many-to-one X channel

Date Issued

01-01-2016

Author(s)

Prasad, Ranga

Indian Institute of Technology, Madras

Chockalingam, Ananthanarayanan

Abstract

In this paper, the Gaussian many-to-one X channel (XC), which is a special case of general multiuser XC, is studied. In the Gaussian many-to-one XC, communication links exist between all transmitters and one of the receivers, along with a communication link between each transmitter and its corresponding receiver. As per the XC assumption, transmission of messages is allowed on all the links of the channel. This communication model is different from the corresponding manyto- one interference channel (IC). Transmission strategies, which involve using Gaussian codebooks and treating interference from a subset of transmitters as noise, are formulated for the above channel. Sum-rate is used as the criterion of optimality for evaluating the strategies. Initially, a 3 × 3 many-to-one XC is considered and three transmission strategies are analyzed. The first two strategies are shown to achieve sum-rate capacity under certain channel conditions. For the third strategy, a sum-rate outer bound is derived and the gap between the outer bound and the achieved rate is characterized. These results are later extended to the K × K case. Next, a region in which the many-to-one XC can be operated as a many-to-one IC without the loss of sum-rate is identified. Furthermore, in the above region, it is shown that using Gaussian codebooks and treating interference as noise achieve a rate point that is within K/2 - 1 bits from the sum-rate capacity. Subsequently, some implications of the above results to the Gaussian many-to-one IC are discussed. Transmission strategies for the many-to-one IC are formulated, and channel conditions under which the strategies achieve sum-rate capacity are obtained. A region where the sum-rate capacity can be characterized to within K/2 - 1 bits is also identified. Finally, the regions where the derived channel conditions are satisfied for each strategy are illustrated for a 3 × 3 many-to-one XC and the corresponding many-to-one IC.

Volume

62