pith. sign in

arxiv: 0804.4866 · v1 · pith:QMBLEMPAnew · submitted 2008-04-30 · 💻 cs.IT · math.IT

Sum-Capacity of Ergodic Fading Interference and Compound Multiaccess Channels

classification 💻 cs.IT math.IT
keywords channelsfadingsum-capacityc-macclassescommunicatecompoundergodic
0
0 comments X
read the original abstract

The problem of resource allocation is studied for two-sender two-receiver fading Gaussian interference channels (IFCs) and compound multiaccess channels (C-MACs). The senders in an IFC communicate with their own receiver (unicast) while those in a C-MAC communicate with both receivers (multicast). The instantaneous fading state between every transmit-receive pair in this network is assumed to be known at all transmitters and receivers. Under an average power constraint at each source, the sum-capacity of the C-MAC and the power policy that achieves this capacity is developed. The conditions defining the classes of strong and very strong ergodic IFCs are presented and the multicast sum-capacity is shown to be tight for both classes.

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.