Gaussian doubly dirty compound multiple‐access channel with partial side information at the transmitters

Monemizadeh, Mostafa; Bahmani, Elham; Hodtani, Ghosheh Abed; Seyedin, Seyed Alireza

doi:10.1049/iet-com.2013.0932

Cited by 9 publications

(6 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A two-user generalized MAC with correlated states and non-causally known CSIT is studied in [ 107 ]. In [ 108 ], a two-user Gaussian double-dirty compound MAC with partial CSIT is studied. The capacity regions of a MAC with full and distributed CSIT are analyzed in [ 109 ].…”

Section: The Multiple Access Channelmentioning

confidence: 99%

The Broadcast Approach in Communication Networks

Tajer

Steiner

Shamai

2021

Entropy

View full text Add to dashboard Cite

In this paper we review the theoretical and practical principles of the broadcast approach to communication over state-dependent channels and networks in which the transmitters have access to only the probabilistic description of the time-varying states while remaining oblivious to their instantaneous realizations. When the temporal variations are frequent enough, an effective long-term strategy is adapting the transmission strategies to the system’s ergodic behavior. However, when the variations are infrequent, their temporal average can deviate significantly from the channel’s ergodic mode, rendering a lack of instantaneous performance guarantees. To circumvent a lack of short-term guarantees, the broadcast approach provides principles for designing transmission schemes that benefit from both short- and long-term performance guarantees. This paper provides an overview of how to apply the broadcast approach to various channels and network models under various operational constraints.

show abstract

Section: The Multiple Access Channelmentioning

confidence: 99%

The Broadcast Approach in Communication Networks

Tajer

Steiner

Shamai

2021

Entropy

View full text Add to dashboard Cite

show abstract

“…is bounded by the average of the corresponding bounds in (26), (28), (30), and 32 (39) Note that the min{•, •} terms in (38) and (39) are needed to guarantee the decodability of each codebook in two different channel states, e.g., rate of codebook U 1 11 must be achievable in each of channel states (α 1 , α 1 ) and (α 1 , α 2 ), even though it is primarily adapted to state (α 1 , α 1 ). Codebooks U 1 12 , U 1 22 , U 2 11 , U 2 12 , and U 2 22 are required to satisfy similar conditions.…”

Section: Appendix a Proof Of Theoremmentioning

confidence: 99%

“…A two-user generalized MAC with correlated states and non-causally known CSIT is studied in [27]. In [28] a two-user Gaussian double-dirty compound MAC with partial CSIT is studied. The capacity regions of a MAC with full and distributed CSIT are analyzed in [29].…”

Section: Introductionmentioning

confidence: 99%

Broadcast Approach to Multiple Access With Local CSIT

Zohdy

Tajer

Shamai

2019

IEEE Trans. Commun.

View full text Add to dashboard Cite

A two-user multiple access channel is considered, in which the channels undergo slow block fading and the state of each channel is known only to its corresponding transmitter. This paper proposes a novel broadcast strategy for multiple access communication in this channel. In the broadcast approach, in principle, a transmitter with CSI uncertainty sends multiple independent superimposed information layers where the rate of each layer is adapted to a specific channel realization. In the existing broadcast approaches to multiuser communication, the transmitters often directly adopt a single-user strategy and each transmitter adapts its transmission to one unknown channel. The novel aspect of the proposed strategy is that it adapts the designed codebooks to the state of the entire network. This is motivated by the fact that the contribution of each user to the network-wide measures (e.g., capacity region) depends not only on the user's direct channel to the receiver, but also on the qualities of other channels. Average achievable rate region and outer bounds on the capacity region are characterized. Furthermore, the expected capacity region is investigated, where most part of the capacity region boundary is characterized. Finally, an asymptotic capacity region is also characterized.

show abstract

“…In [20], [21], the authors derived the capacity inner bound for the multiple-access channel with SI partially and non-causally known at the sources, and showed the optimality of lattice coding. The authors in [20][21][22][23] and [24] have studied the MAC with SI using lattice strategy, and fading MAC, respectively.…”

Section: Introductionmentioning

confidence: 99%

A general achievable rate region and two certain capacity regions for Slepian–Wolf multiple‐access relay channel with non‐causal side information at one encoder

2020

View full text Add to dashboard Cite

Two‐user multiple‐access relay channel (MARC) with side information (SI) non‐causally known at one encoder is studied, where transmitters send a common message with rate R0, and private messages with rates R1 and R2; and derive a general achievable rate region by appropriately using superposition block Markov encoding, binning scheme, Gel'fand–Pinsker (GP) coding and partial decode‐forward (PDF) strategy at the relay. Also, it is shown that this capacity inner bound can be tight for two special classes of degraded and reversely degraded multiple‐access relay channels with one informed encoder. In order for the theoretical findings to be potentially applicable in communications performance metrics evaluations, the obtained general achievable rate region, while having all of the previous works on the point to point, relay and multiple access channels with and without SI as its special cases, is extended to the corresponding Gaussian version, the dirty paper coding of which has been a challenging and widely studied problem, and the result of which includes a variety of previously studied important Gaussian results. Finally, mathematical results are evaluated numerically.

show abstract

Gaussian doubly dirty compound multiple‐access channel with partial side information at the transmitters

Cited by 9 publications

References 21 publications

The Broadcast Approach in Communication Networks

The Broadcast Approach in Communication Networks

Broadcast Approach to Multiple Access With Local CSIT

A general achievable rate region and two certain capacity regions for Slepian–Wolf multiple‐access relay channel with non‐causal side information at one encoder

Contact Info

Product

Resources

About