An achievable rate region for a 3-node cooperative multiple access channel (CMAC) is presented in this paper. A CMAC contains multiple users cooperatively transmitting information to a single destination node. It includes the traditional multiple access channel that assumes no communication between source nodes, and multiple input single output (MISO) system that contains ideal links between so...

Interference is assumed to be one of the main barriers to improving the throughput of communication systems. Consequently, interference management plays an integral role in wireless communications. Although the importance of interference has promoted numerous studies on the interference channel, the capacity region of this channel is still unknown. The focus of this thesis is on Gaussian interf...

In this work, we derive achievable rate regions for the three-user interference channels with asymmetric transmitter cooperation and various decoding capabilities at the receivers. The three-user channel facilitates different ways of message sharing between the transmitters. We introduce two natural ways of extending the concept of unidirectional message sharing from two users to three users (i...

Ahwc-The problem of transmission of separate messages to each of two receivers over a general binary-input broadcast channel is investigated. A new approach to a class of information-t problems is developed and applied to obtain boonds on the cardinalitiea of aoxiliary random variables. These bounds permit the calculation of two different regions of achievable rate pairs which are derived from ...

Abstract An achievable rate region for the Gaussian interference channel is derived using Sato’s modified frequency division multiplexing idea [1] and a special case of Han and Kobayashi’s rate region (denoted by G′ in [2]). We show that the new inner bound includes G′, Sason’s rate region D [3], as well as the achievable region via TDM/FDM [4], as its subsets. The advantage of this improved in...

Let p( yl, y2 1 X) denote a discrete memoryless channel with a single source X and two independent receivers YI and Y2. W e exhibit an achievable region of rates (R11,R12,R22) at which independent information can be sent, respectively, to receiver 1, to both receivers 1 and 2, and to receiver 2. The achievability of the region is shown by using a version of the asymptotic equipartit ion propert...

We study the problem of private function retrieval (PFR) in a distributed storage system. In PFR the user wishes to retrieve a linear combination of M messages stored in noncolluding (N,K) MDS coded databases while revealing no information about the coefficients of the intended linear combination to any of the individual databases. We present an achievable scheme for MDS coded PFR with a rate t...

This two-part paper aims to quantify the cost of device activity detection in an uplink massive connectivity scenario with a large number of devices but device activities are sporadic. Part I of this paper shows that in an asymptotic massive multiple-input multiple-output (MIMO) regime, device activity detection can always be made perfect. Part II of this paper subsequently shows that despite t...

With the fast development of communication networks, cooperative communication has been more widely used in many different fields, such as satellite networks, broadcast networks, internet and so on. Therefore relay channels have been playing a pivotal role since their definitions were proposed by Van-der Meulen. However, the general achievable rate region of a relay channel is still unknown whi...

The recent increase in number of wireless devices has been driven by the growing markets of smart homes and the Internet of Things (IoT). As a result, expanding and/or efficient utilization of the radio frequency (RF) spectrum is critical to accommodate such an increase in wireless bandwidth. Alternatively, recent free-space optical (FSO) communication technologies have demonstrated the feasibi...