On Two-User Gaussian Multiple Access Channels With Finite Input Constellations

Capacity region of K-user discrete memoryless interference channels with a mixed strong-very strong interference

“…The CC capacity for the Gaussian-MAC (G-MAC) was analyzed in [13], for the 2-user GIC with strong interference in [14] and [15]. With finite constellations, strict suboptimality of Frequency Division Multiple Access (FDMA) scheme was shown for the G-MAC in [13] and for the 2-user GIC with strong interference in [15]. Now that the constellation constrained capacity is known for the class of -user GIC considered here, a similar analysis with finite constellations is an interesting direction to pursue.…”

“…In the context of a Gaussian channel, when capacity region is achieved using impractical Gaussian input alphabets, the significance of establishing capacity results for the corresponding Discrete Memoryless Channel is that, it can be used to analyze the maximum achievable rate region when practical finite input constellations are used in the Gaussian channel. Such analysis had been done earlier for the Gaussian-MAC (G-MAC) in [13], and for the 2-user GIC with strong interference in [14] and [15].…”

Design of adaptive constellations and error protection coding for wireless network coding in 5-node butterfly networks

“…12). Unfortunately, since one of the users (S b AB ) is only virtual, we cannot simply claim that the region of achievable rates in this virtual channel can be derived directly from the conventional cut-set bound analysis (see e.g., [18,32]), but rather a careful information-theoretic analysis would be required to identify the exact rate region. However, such analysis is far beyond the scope of this paper, and hence, for simplicity reasons, we only conjecture that the eligible source rates (r b , r s ) are limited by the conventional CC multiple-access capacity region [18,32], which can be defined by the following set of mutual informations I( ; ): …”

“…For more details on the evaluation of CC capacity for finite input constellations see e.g. [13,32]. 12 The higher order strategies like (N b = 4, N s = 0)…”

Cooperative multiple-access scheme with antenna selection and incremental relaying

“…In [16], a space-time block code scheme for a multiple-access network is presented which provides a good tradeoff between decoding complexity and information loss. In [17], a network coding is proposed for a multiple-access relay network based on the information bottleneck method [18], which is considered in this work.…”