Related papers: Scaling Laws for Gaussian Random Many-Access Chann…
Consider the problem of a Multiple-Input Multiple-Output (MIMO) Multiple-Access Channel (MAC) at the limit of large number of users. Clearly, in practical scenarios, only a small subset of the users can be scheduled to utilize the channel…
We optimize the hierarchical cooperation protocol of Ozgur, Leveque and Tse, which is supposed to yield almost linear scaling of the capacity of a dense wireless network with the number of users $n$. Exploiting recent results on the…
In many wireless communication systems, radios are subject to a duty cycle constraint, that is, a radio only actively transmits signals over a fraction of the time. For example, it is desirable to have a small duty cycle in some low power…
The capacity region of the $K$-user Gaussian interference channel (GIC) is a long-standing open problem and even capacity outer bounds are little known in general. A significant progress on degrees-of-freedom (DoF) analysis, a first-order…
The capacity of a deterministic multiple-input multiple-output (MIMO) channel under the peak and average power constraints is investigated. For the identity channel matrix, the approach of Shamai et al. is generalized to the higher…
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…
Transmitting data reliably over noisy communication channels is one of the most important applications of information theory, and well understood when the channel is accurately modelled by classical physics. However, when quantum effects…
Activation of quantum capacity is a surprising phenomenon according to which the quantum capacity of a certain channel may increase by combining it with another channel with zero quantum capacity. Superactivation describes an even more…
We consider the N-relay Gaussian diamond network where a source node communicates to a destination node via N parallel relays through a cascade of a Gaussian broadcast (BC) and a multiple access (MAC) channel. Introduced in 2000 by Schein…
This paper considers an unlicensed multiple-access channel (MAC) that coexists with a licensed point-to-point user, following the underlay cognitive radio paradigm. We assume that every transceiver except the secondary base station has one…
This article shows that the capacity region of a two users weak Gaussian interference channel can be achieved using single letter Gaussian code-books. The approach relies on traversing the boundary in incremental steps. Starting from a…
It is well known that, in general, feedback may enlarge the capacity region of Gaussian broadcast channels. This has been demonstrated even when the feedback is noisy (or partial-but-perfect) and only from one of the receivers. The only…
In a K-user Gaussian interference channel, it has been shown that if for each user the desired signal strength is no less than the sum of the strengths of the strongest interference from this user and the strongest interference to this user…
An additive white Gaussian noise energy-harvesting channel with an infinite-sized battery is considered. The energy arrival process is modeled as a sequence of independent and identically distributed random variables. The channel capacity…
This paper considers the achievability and converse bounds on the maximal channel coding rate at a given blocklength and error probability over AWGN channels. The problem stems from covert communication with Gaussian codewords. By…
We consider symmetric two-user Gaussian interference channel with common messages. We derive an upper bound on the sum capacity, and show that the upper bound is tight in the low interference regime, where the optimal transmission scheme is…
Consider a pair of terminals connected by two independent additive white Gaussian noise channels, and limited by individual power constraints. The first terminal would like to reliably send information to the second terminal, within a given…
This paper addresses the problem of computing the achievable rates for two (and three) users sharing a same frequency band without coordination and thus interfering with each other. It is thus primarily related to the field of cognitive…
Consider the problem of a multi-user multiple access channel. While several multi-user coding techniques exist, in practical scenarios, not all users can be scheduled simultaneously. Thus, a key problem is which users to schedule in a given…
We study a two-user cognitive channel, where the primary flow is sporadic, cannot be re-designed and operating below its link capacity. To study the impact of primary traffic uncertainty, we propose a block activity model that captures the…