The capacity region of a channel with s senders and r receivers

Ulrey, Michael L.

doi:10.1016/s0019-9958(75)90371-x

Cited by 19 publications

(11 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Each receiver decodes all transmitted messages. The capacity region of the discrete GMAC without common message was previously obtained in [16]. Here, we extend the result of [4] to the case of transmitters and receivers and characterize the capacity region of the discrete GMAC with a common message using the superposition coding technique.…”

Section: Introductionmentioning

confidence: 61%

See 1 more Smart Citation

The Capacity Region of p -Transmitter/ q -Receiver Multiple-Access Channels With Common Information

Haghi

Khosravi-Farsani

Aref

et al. 2011

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

This paper investigates the capacity problem for some multiple-access scenarios with cooperative transmitters. First, a general Multiple-Access Channel (MAC) with common information, i.e., a scenario where transmitters send private messages and also a common message to receivers and each receiver decodes all of the messages, is considered. The capacity region of the discrete memoryless channel is characterized. Then, the general Gaussian fading MAC with common information wherein partial Channel State Information (CSI) is available at the transmitters (CSIT) and perfect CSI is available at the receivers (CSIR) is investigated. A coding theorem is proved for this model that yields an exact characterization of the throughput capacity region. Finally, a twotransmitter/one-receiver Gaussian fading MAC with conferencing encoders with partial CSIT and perfect CSIR is studied and its capacity region is determined. For the Gaussian fading models with CSIR only (transmitters have no access to CSIT), some numerical examples and simulation results are provided for Rayleigh fading.

show abstract

Section: Introductionmentioning

confidence: 61%

“…and 0, the result of Proposition 1 reduces to the capacity region of a GMAC without common message derived in [16]. Now, we consider the Gaussian fading GMAC (4) with common message.…”

Section: ) By Settingmentioning

confidence: 82%

The Capacity Region of p -Transmitter/ q -Receiver Multiple-Access Channels With Common Information

Haghi

Khosravi-Farsani

Aref

et al. 2011

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…Note that different types of decomposition might be used ( [3]). For the memoryless case, without the ISI we consider here, the capacity region for multiple-access channels with arbitrarily correlated sources is given in [8] and the worst case capacity for senders and receivers is given in [72]. For issues concerning multiple-antenna systems in fading channels, see [67], [62], and [42].…”

Section: B Maximum Mutual Information In the Case Of A Perfectly Knomentioning

confidence: 99%

The effect upon channel capacity in wireless communications of perfect and imperfect knowledge of the channel

Médard

2000

IEEE Trans. Inform. Theory

819

628

View full text Add to dashboard Cite

Abstract-We present a model for time-varying communication single-access and multiple-access channels without feedback. We consider the difference between mutual information when the receiver knows the channel perfectly and mutual information when the receiver only has an estimate of the channel. We relate the variance of the channel measurement error at the receiver to upper and lower bounds for this difference in mutual information. We illustrate the use of our bounds on a channel modeled by a Gauss-Markov process, measured by a pilot tone. We relate the rate of time variation of the channel to the loss in mutual information due to imperfect knowledge of the measured channel.

show abstract

“…Hence, it is reasonable to assume that Rx S is operating at a higher SNR than Rx S ′ . A general multiple access channel (GMAC) [13] with K transmitters and L receivers consists of a memoryless channel p(ỹ 1 , . .…”

Section: A Capacity Regionmentioning

confidence: 99%

“…While the outer codes provide error resilience, the inner index code, henceforth referred to as index modulation, allows the receivers to exploit side information. We derive the capacity region of coded index modulation by viewing the resulting channel as a multiple-access channel with many receivers [13], and relate it to the side information gain of the index modulation (Section III). We illustrate the simultaneous achievability of both coding gain and side information gain by simulating the performance of a 64-QAM index modulation coded using a 16-state convolutional code through bit-interleaved coded-modulation [14], [15] (Section IV).…”

Section: Introductionmentioning

confidence: 99%

Capacity of coded index modulation

Natarajan

Hong

Viterbo

2015

2015 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

We consider the special case of index coding over the Gaussian broadcast channel where each receiver has prior knowledge of a subset of messages at the transmitter and demands all the messages from the source. We propose a concatenated coding scheme for this problem, using an index code for the Gaussian channel as an inner code/modulation to exploit side information at the receivers, and an outer code to attain coding gain against the channel noise. We derive the capacity region of this scheme by viewing the resulting channel as a multiple-access channel with many receivers, and relate it to the side information gain -which is a measure of the advantage of a code in utilizing receiver side information -of the inner index code/modulation. We demonstrate the utility of the proposed architecture by simulating the performance of an index code/modulation concatenated with an off-the-shelf convolutional code through bit-interleaved coded-modulation.

show abstract

The capacity region of a channel with s senders and r receivers

Cited by 19 publications

References 7 publications

The Capacity Region of p -Transmitter/ q -Receiver Multiple-Access Channels With Common Information

The Capacity Region of p -Transmitter/ q -Receiver Multiple-Access Channels With Common Information

The effect upon channel capacity in wireless communications of perfect and imperfect knowledge of the channel

Capacity of coded index modulation

Contact Info

Product

Resources

About