Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSemi-Robust Communications over a Broadcast Channel
156
0
0.0
(
0
)
Added by
Tibor Keresztfalvi
Publication date
2017
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We establish the deterministic-code capacity region of a network with one transmitter and two receivers: an ordinary receiver and a robust receiver. The channel to the ordinary receiver is a given (known) discrete memoryless channel (DMC), whereas the channel to the robust receiver is an arbitrarily varying channel (AVC). Both receivers are required to decode the common message, whereas only the ordinary receiver is required to decode the private message.
rate research
Read More
Two mobile users communicate with a central decoder via two base stations. Communication between the mobile users and the base stations takes place over a Gaussian interference channel with constant channel gains or quasi-static fading. Instead, the base stations are connected to the central decoder through orthogonal finite-capacity links, whose connectivity is subject to random fluctuations. There is only receive-side channel state information, and hence the mobile users are unaware of the channel state and of the backhaul connectivity state, while the base stations know the fading coefficients but are uncertain about the backhaul links state. The base stations are oblivious to the mobile users codebooks and employ compress-and-forward to relay information to the central decoder. Upper and lower bounds are derived on average achievable throughput with respect to the prior distribution of the fading coefficients and of the backhaul links states. The lower bounds are obtained by proposing strategies that combine the broadcast coding approach and layered distributed compression techniques. The upper bound is obtained by assuming that all the nodes know the channel state. Numerical results confirm the advantages of the proposed approach with respect to conventional non-robust strategies in both scenarios with and without fading.
The identification (ID) capacity region of the two-receiver broadcast channel (BC) is shown to be the set of rate-pairs for which, for some distribution on the channel input, each receivers ID rate does not exceed the mutual information between the channel input and the channel output that it observes. Moreover, the capacity regions interior is achieved by codes with deterministic encoders. The results are obtained under the average-error criterion, which requires that each receiver reliably identify its message whenever the message intended for the other receiver is drawn at random. They hold also for channels whose transmission capacity region is to-date unknown. Key to the proof is a new ID code construction for the single-user channel. Extensions to the BC with one-sided feedback and the three-receiver BC are also discussed: inner bounds on their ID capacity regions are obtained, and those are shown to be in some cases tight.
The relay broadcast channel (RBC) is considered, in which a transmitter communicates with two receivers with the assistance of a relay. Based on different degradation orders among the relay and the receivers outputs, three types of physically degraded RBCs (PDRBCs) are introduced. Inner bounds and outer bounds are derived on the capacity region of the presented three types. The bounds are tight for two types of PDRBCs: 1) one receivers output is a degraded form of the other receivers output, and the relays output is a degraded form of the weaker receivers output; 2) one receivers output is a degraded form of the relays output, and the other receivers output is a degraded form of the relays output. For the Gaussian PDRBC, the bounds match, i.e., establish its capacity region.
In this paper, we study the problem of channel simulation via interactive communication, known as the coordination capacity, in a two-terminal network. We assume that two terminals observe i.i.d. copies of two random variables and would like to generate i.i.d. copies of two other random variables jointly distributed with the observed random variables. The terminals are provided with two-way communication links, and shared common randomness, all at limited rates. Two special cases of this problem are the interactive function computation studied by Ma and Ishwar, and the tradeoff curve between one-way communication and shared randomness studied by Cuff. The latter work had inspired Gohari and Anantharam to study the general problem of channel simulation via interactive communication stated above. However only inner and outer bounds for the special case of no shared randomness were obtained in their work. In this paper we settle this problem by providing an exact computable characterization of the multi-round problem. To show this we employ the technique of output statistics of random binning that has been recently developed by the authors.
In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the problem of secret communication over the Gaussian broadcast channel, where a multi-antenna transmitter sends independent confidential messages to two users with perfect secrecy. That is, each user would like to obtain its own message reliably and confidentially. First, a computable Sato-type outer bound on the secrecy capacity region is provided for a multi-antenna broadcast channel with confidential messages. Next, a dirty-paper secure coding scheme and its simplified version are described. For each case, the corresponding achievable rate region is derived under the perfect secrecy requirement. Finally, two numerical examples demonstrate that the Sato-type outer bound is consistent with the boundary of the simplified dirty-paper coding secrecy rate region.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
