Related papers: On the Sum Rate of a 2 x 2 Interference Network
In this paper we study a Gaussian relay-interference network, in which relay (helper) nodes are to facilitate competing information flows over a wireless network. We focus on a two-stage relay-interference network where there are weak…
A sender wishes to broadcast a message of length $n$ over an alphabet to $r$ users, where each user $i$, $1 \leq i \leq r$ should be able to receive one of $m_i$ possible messages. The broadcast channel has noise for each of the users…
This paper considers the problem of the multiple-input multiple-output (MIMO) Gaussian broadcast channel with two receivers (receivers 1 and 2) and two messages: a common message intended for both receivers and a confidential message…
In this paper, we consider the arbitrary MIMO two-way relay channels, where there are $K$ source nodes, each equipped with $M_i$ antennas, for $i=1,2,\cdots,K$, and one relay node, equipped with $N$ antennas. Each source node can exchange…
This paper derives an outer bound on the capacity region of a general memoryless interference channel with an arbitrary number of users. The derivation follows from a generalization of the techniques developed by Kramer and by Etkin et al…
This paper considers a random access system where each sender can be in two modes of operation, active or not active, and where the set of active users is available to a common receiver only. Active transmitters encode data into independent…
In this paper we investigate the achievable rate of a system that includes a nomadic transmitter with several antennas, which is received by multiple agents, exhibiting independent channel gains and additive circular-symmetric complex…
A hybrid communication network with a common analog signal and an independent digital data stream as input to each node in a multiple access network is considered. The receiver/base-station has to estimate the analog signal with a given…
The $K\times 2$ and $2\times K$, Multiple-Input Multiple-Output (MIMO) X channel with constant channel coefficients available at all transmitters and receivers is considered. A new alignment scheme, named \emph{layered interference…
This paper considers a Gaussian broadcast channel with two unmatched degraded components, three particular messages, and a common message that is intended for all three receivers. It is shown that for this channel superposition coding and…
The interference channel achievable rate region is presented when the interference is treated as noise. The formulation starts with the 2-user channel, and then extends the results to the n-user case. The rate region is found to be the…
We consider the Gaussian interference channel with an intermediate relay as a main building block for cooperative interference networks. On the achievability side, we consider compress-and-forward based strategies. Specifically, a…
We present an achievable rate for general Gaussian relay networks. We show that the achievable rate is within a constant number of bits from the information-theoretic cut-set upper bound on the capacity of these networks. This constant…
We investigate a multi-user multiple-input multiple-output interference network in the presence of multiple reconfigurable intelligent surfaces (RISs). The entire system is described by using a circuit-based model for the transmitters,…
This paper derives a novel sum-rate outer bound for the general memoryless interference channel with three users. The derivation is a generalization of the techniques developed by Kramer and by Etkin et al for the Gaussian two-user channel.…
We characterize the capacity region to within 2 bits/s/Hz and the symmetric capacity to within 1 bit/s/Hz for the two-user Gaussian interference channel (IC) with feedback. We develop achievable schemes and derive a new outer bound to…
In this paper, it is shown that for any given single-hop communication network with two receivers, splitting messages into more than two sub-messages in a random coding scheme is redundant. To this end, the Broadcast Channel with Cognitive…
In this paper, we present an achievable security scheme for an interference channel with arbitrary number of users. In this model, each receiver should be able to decode its intended message while it cannot decode any meaningful information…
This paper concerns the transmission of two independent Gaussian sources over a two-user decentralized interference channel, assuming that the transmitters are unaware of the instantaneous CSIs. The availability of the channel state…
This paper studies a symmetric K user Gaussian interference channel with K transmitters and K receivers. A "very strong" interference regime is derived for this channel setup. A "very strong" interference regime is one where the capacity…