Related papers: An Achievable Rate Region for the Gaussian Interfe…
The two-user Gaussian interference channel with a shared out-of-band relay is considered. The relay observes a linear combination of the source signals and broadcasts a common message to the two destinations, through a perfect link of fixed…
The capacity of the Gaussian cognitive interference channel, a variation of the classical two-user interference channel where one of the transmitters (referred to as cognitive) has knowledge of both messages, is known in several parameter…
Characterizing the global maximum of weighted sum-rate (WSR) for the K-user Gaussian interference channel (GIC), with the interference treated as Gaussian noise, is a key problem in wireless communication. However, due to the users' mutual…
In this paper, we consider a general K-user Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC). We assume that the channel state is deterministic and known to all the nodes. While the private-message capacity region is…
We analyze the achievable rate in interference-free wireless networks with physical layer fading channels and orthogonal multiple access. As a starting point, the point-to-point channel is considered. We find the optimal physical and…
This paper considers the problem of cognitive radios with partial-message information. Here, an interference channel setting is considered where one transmitter (the "cognitive" one) knows the message of the other ("legitimate" user)…
The performance of next generation wireless systems (5G/6G and beyond) at the physical layer is primarily driven by the choice of digital modulation techniques that are bandwidth and power efficient, while maintaining high data rates.…
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 study the interaction between two interfering Gaussian 2-user multiple access channels. The capacity region is characterized under mixed strong--extremely strong interference and individually very strong interference. Furthermore, the…
This article shows that achieving capacity region of a 2-users weak Gaussian Interference Channel (GIC) is equivalent to enlarging the core in a nested set of Polymatroids (each equivalent to capacity region of a multiple-access channel)…
We study information-theoretic security for discrete memoryless interference and broadcast channels with independent confidential messages sent to two receivers. Confidential messages are transmitted to their respective receivers with…
Motivated by the broadcast view of the interference channel, the new problem of communication with disturbance constraints is formulated. The rate-disturbance region is established for the single constraint case and the optimal encoding…
We propose an achievable rate-region for the two-way multiple-relay channel using decode-and-forward block Markovian coding. We identify a conflict between the information flow in both directions. This conflict leads to an intractable…
We consider channel coding for Gaussian channels with the recently introduced mean and variance cost constraints. Through matching converse and achievability bounds, we characterize the optimal first- and second-order performance. The main…
In this paper we analyze the interference channel as a conflict situation. This viewpoint implies that certain points in the rate region are unreasonable to one of the players. Therefore these points cannot be considered achievable based on…
In this paper, inner and outer bounds on the capacity region of two-user interference channels with two confidential messages have been proposed. By adding secure multiplex coding to the error correction method in [15] which achieves the…
We establish a multiuser extrinsic information transfer (EXIT) chart area theorem for the interleave-division multiple access (IDMA) scheme, a special form of superposition coding, in multiple access channels (MACs). A low-cost multi-user…
We investigate the $K$-user many-to-one interference channel with confidential messages in which the $K$th user experiences interference from all other $K-1$ users, and is at the same time treated as an eavesdropper to all the messages of…
We derive closed-form expressions for the achievable rates of a buffer-aided full-duplex (FD) multiple-input multiple-output (MIMO) Gaussian relay channel. The FD relay still suffers from residual self-interference (RSI) after the…
This paper is concerned with general interference channels characterized by a sequence of transition (conditional) probabilities. We present a general formula for the capacity region of the interference channel with two pairs of users. The…