Reliable Communication in Networks with Multi-access Interference

Traskov, Danail; Kramer, Gerhard

doi:10.1109/itw.2007.4313098

Cited by 37 publications

(63 citation statements)

References 12 publications

(17 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We call this the multiple access diamond channel. Achievability results for the discrete multiple access diamond channel were proposed in [5], [6]. In [6], an uncomputable n-letter upper bound is also provided which is tighter than the cut-set bound.…”

Section: Introductionmentioning

confidence: 99%

The Gaussian multiple access diamond channel

Kang

Liu

2011

2011 IEEE International Symposium on Information Theory Proceedings

View full text Add to dashboard Cite

In this paper, we study the capacity of the diamond channel. We focus on the special case where the channel between the source node and the two relay nodes are two separate links of finite capacity and the link from the two relay nodes to the destination node is a Gaussian multiple access channel. We call this model the Gaussian multiple access diamond channel. We first propose an upper bound on the capacity. This upper bound is a single-letterization of the n-letter upper bound proposed by Traskov and Kramer, which is tighter than the cut-set bound. Next, we provide a lower bound based on sending correlated codes through the multiple access channel. Since the upper and lower bounds take on similar forms, it is expected that they coincide for certain channel parameters. To show this, we further focus on the symmetric case where the separate links to the relays are of the same capacity and the power constraints of the two relays are the same. For the symmetric case, we give necessary and sufficient conditions that the upper and lower bounds meet. Thus, for a Gaussian multiple access diamond channel that satisfies these conditions, we have found its capacity.

show abstract

Section: Introductionmentioning

confidence: 99%

The Gaussian multiple access diamond channel

Kang

Liu

2011

2011 IEEE International Symposium on Information Theory Proceedings

View full text Add to dashboard Cite

show abstract

“…This network may be modeled by an M-relay diamond network where the broadcast component is modeled by rate-limited links and the multiaccess component is modeled by a memoryless Multiple Access Channel (MAC); see Figure 1. The capacity of this class of networks is not known in general, but lower and upper bounds were derived in [10][11][12] for two-relay networks. Moreover, the capacity was found for binary adder MACs [12] and for certain regimes of operation in Gaussian MACs [11,12].…”

Section: Introductionmentioning

confidence: 99%

Capacity Bounds on the Downlink of Symmetric, Multi-Relay, Single-Receiver C-RAN Networks

Bidokhti

Kramer

Shamai

2017

Entropy

Self Cite

View full text Add to dashboard Cite

Abstract:The downlink of symmetric Cloud Radio Access Networks (C-RANs) with multiple relays and a single receiver is studied. Lower and upper bounds are derived on the capacity. The lower bound is achieved by Marton's coding, which facilitates dependence among the multiple-access channel inputs. The upper bound uses Ozarow's technique to augment the system with an auxiliary random variable. The bounds are studied over scalar Gaussian C-RANs and are shown to meet and characterize the capacity for interesting regimes of operation.

show abstract

“…The problem was initially studied in [2] where lower and upper bounds were derived on the ultimate rate of communication. The bounds are improved in the recent works of [3], [4].…”

Section: Introductionmentioning

confidence: 99%

“…Using this technique, we show through an example that previous bounds (the cut set bound in [2] and the bound in [4]) are not generally tight and may be improved.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An application of a wringing lemma to the multiple access channel with cooperative encoders

Bidokhti

Kramer

2014

2014 Iran Workshop on Communication and Information Theory (IWCIT)

Self Cite

View full text Add to dashboard Cite

Abstract-The problem of communicating over a multiple access channel with cooperative encoders is studied. A new upper bound is derived on the capacity which is motivated by the regime of operation where the relays start to cooperate. The proof technique is based on a wringing lemma by Dueck and Ahlswede which was used for the multiple description problem with no excess rate. Previous upper bounds are shown to be loose in general, and may be improved.

show abstract

Reliable Communication in Networks with Multi-access Interference

Abstract: Achievable rates are derived for reliable communication in networks with multi-access interference. Capacity is established for some such networks. A network flow formulation is developed that includes rate gains and losses caused by correlating the multi-access channel inputs.

Cited by 37 publications

References 12 publications

The Gaussian multiple access diamond channel

The Gaussian multiple access diamond channel

Capacity Bounds on the Downlink of Symmetric, Multi-Relay, Single-Receiver C-RAN Networks

An application of a wringing lemma to the multiple access channel with cooperative encoders

Contact Info

Product

Resources

About