pith. sign in

arxiv: 1011.1225 · v2 · pith:6YGH2II7new · submitted 2010-11-04 · 💻 cs.IT · math.IT

On the Capacity of Multiple-Access-Z-Interference Channels

classification 💻 cs.IT math.IT
keywords channelcapacityinterferenceregiongaussiancasestrongdiscrete
0
0 comments X
read the original abstract

The capacity of a network in which a multiple access channel (MAC) generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case. If the interference is very strong, the capacity region is obtained for both the discrete memoryless channel and the Gaussian channel. For the strong interference case, the capacity region is established for the discrete memoryless channel; for the Gaussian case, we attain a line segment on the boundary of the capacity region. Moreover, the capacity region for the Gaussian channel is identified for the case when one interference link being strong, and the other being very strong. For a subclass of Gaussian channels with mixed interference, a boundary point of the capacity region is determined. Finally, for the Gaussian channel with weak interference, sum capacities are obtained under various channel coefficient and power constraint conditions.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.