Results 1  10
of
20
3Receiver Broadcast Channels with Common and Confidential Messages
, 2009
"... AbstractAchievable secrecy rate regions for the general 3receiver broadcast channel with one common and one confidential message sets are established. We consider two setups: (i) when the confidential message is to be sent to two of the receivers and the third receiver is an eavesdropper; and (ii) ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
(Show Context)
AbstractAchievable secrecy rate regions for the general 3receiver broadcast channel with one common and one confidential message sets are established. We consider two setups: (i) when the confidential message is to be sent to two of the receivers and the third receiver is an eavesdropper; and (ii) when the confidential message is to be sent to one of the receivers and the other two receivers are eavesdroppers. We show that our secrecy rate regions are optimurn for some special cases. I.
Capacity of a class of broadcast relay channels
 in Proc. IEEE Inter. Symp. Inf. Theory (ISIT
, 2010
"... ar ..."
(Show Context)
Cooperation and Cognition in . . .
"... The fundamental limits of communication over a wireless network of nodes has recently become an area of intense research. Even in the simplest case, the information theoretic capacity region of multiterminal networks remains an open problem. The analysis of networks is made even richer through the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The fundamental limits of communication over a wireless network of nodes has recently become an area of intense research. Even in the simplest case, the information theoretic capacity region of multiterminal networks remains an open problem. The analysis of networks is made even richer through the recent introduction of cognitive radios, which could allow for cooperation between network nodes. In this paper we present a decomposition of arbitrary wireless networks with cognitive and noncognitive nodes, which reduces the network to a set of clusters which behave in competitive, cognitive and cooperative fashions. We survey results on the more classical competitive and cooperative behaviors, and explore two examples of the recently introduced cognitive behavior in more depth. These two examples highlight different aspects of the asymmetric cooperation implied by cognitive behavior, and demonstrate the potential of asymmetric cooperation in wireless networks.
Upper bounds and duality relations of the linear deterministic sum capacity for cellular systems
 in Proc. IEEE International Conference on Communications (ICC
, 2014
"... Abstract—The MACBC duality of information theory and wireless communications is an intriguing concept for efficient algorithm design. However, no concept is known so far for the important cellular channel. To make progress on this front, we consider in this paper the linear deterministic cellular c ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract—The MACBC duality of information theory and wireless communications is an intriguing concept for efficient algorithm design. However, no concept is known so far for the important cellular channel. To make progress on this front, we consider in this paper the linear deterministic cellular channel. In particular, we prove duality of a network with two interfering MACs in each cell and a network with two interfering BCs in each cell. The operational region is confined to the weak interference regime. First, achievable schemes as well as upper bounds will be provided. These bounds are the same for both channels. We will show, that for specific cases the upper bound corresponds to the achievable scheme and hence establishing a duality relationship between them. I.
The InterFerence Channel with Generalized Feedback (IFCGF)
"... This work introduces cooperative communication strategies for ..."
(Show Context)
Achievable Rate Region of Gaussian Broadcast Channel with Finite Input Alphabet and Quantized Output
"... Abstract—In this paper, we study the achievable rate region of twouser Gaussian broadcast channel (GBC) when the messages to be transmitted to both the users take values from finite signal sets and the received signal is quantized at both the users. We refer to this channel as quantized broadcast c ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—In this paper, we study the achievable rate region of twouser Gaussian broadcast channel (GBC) when the messages to be transmitted to both the users take values from finite signal sets and the received signal is quantized at both the users. We refer to this channel as quantized broadcast channel (QBC). We first observe that the capacity region defined for a GBC does not carry over as such to QBC. Also, we show that the optimal decoding scheme for GBC (i.e., high SNR user doing successive decoding and low SNR user decoding its message alone) is not optimal for QBC. We then propose an achievable rate region for QBC based on two different schemes. We present achievable rate region results for the case of uniform quantization at the receivers. We find that rotation of one of the user’s input alphabet with respect to the other user’s alphabet marginally enlarges the achievable rate region of QBC when almost equal powers are allotted to both the users.
1281 J. Moser, E. Phillips, and S. Varadhan, Ergodic Theory: A Seminar. [42]
"... (271 B. McMillan, “The basic theorems of information theory, ” Ann. _ 1411 _ ..."
Abstract
 Add to MetaCart
(271 B. McMillan, “The basic theorems of information theory, ” Ann. _ 1411 _