Related papers: An Achievable Rate Region for Three-Pair Interfere…
This paper investigates the achievability of the interference channel coding. It is clarified that the rate-splitting technique is unnecessary to achieve Han-Kobayashi and Jian-Xin-Garg inner regions. Codes are constructed by using sparse…
In this paper, we first consider a channel that is contaminated by two independent Gaussian noises $S ~ N(0,Q)$ and $Z_0 ~ N(0,N_0)$. The capacity of this channel is computed when independent noisy versions of $S$ are known to the…
A new achievable rate region is given for the Gaussian cognitive many-to-one interference channel. The proposed novel coding scheme is based on the compute-and-forward approach with lattice codes. Using the idea of decoding sums of…
The N+1 user, 1 x N single input multiple output (SIMO) Gaussian interference channel where each transmitter has a single antenna and each receiver has N antennas is studied. The symmetric capacity within O(1) is characterized for the…
In this paper, we develop achievability schemes for symmetric $K$-user interference channels with a rate-limited feedback from each receiver to the corresponding transmitter. We study this problem under two different channel models: the…
It has been shown that improper Gaussian signaling (IGS) can improve the performance of wireless interference-limited systems when perfect channel state information (CSI) is available. In this paper, we investigate the robustness of IGS…
The InterFerence Channel with a Cognitive Relay (IFC-CR) consists of the classical interference channel with two independent source-destination pairs whose communication is aided by an additional node, referred to as the cognitive relay,…
In this paper, we consider the Ice-Wine problem: Two transmitters send their messages over the Gaussian Multiple-Access Channel (MAC) and a receiver aims to recover a linear combination of codewords. The best known achievable rate-region…
Recent investigations have shown sum capacity results within a constant bit-gap for several channel models, e.g. the two-user Gaussian interference channel (G-IC), k-user G-IC or the Gaussian X-channel. This has motivated investigations of…
A simple four node network in which cooperation improves the information-theoretic secrecy is studied. The channel consists of two senders, a receiver, and an eavesdropper. One or both senders transmit confidential messages to the receiver,…
This paper studies the capacity region of a $K$-user cyclic Gaussian interference channel, where the $k$th user interferes with only the $(k-1)$th user (mod $K$) in the network. Inspired by the work of Etkin, Tse and Wang, who derived a…
The capacity region of a multiple-input-multiple-output interference channel (MIMO IC) where the channel matrices are square and invertible is studied. The capacity region for strong interference is established where the definition of…
We consider a two-user Gaussian multiple access channel with two independent additive white Gaussian interferences. Each interference is known to exactly one transmitter non-causally. Transmitters are allowed to cooperate through…
We investigate the capacity region of multi-user interference channels (IC), where each user encodes multiple sub-user components. By unifying chain-rule decomposition with the Entropy Power Inequality (EPI), we reason that single-user…
An achievable rate region is obtained for a primary multiple access network coexisting with a secondary link of one transmitter and a corresponding receiver. The rate region depicts the sum primary rate versus the secondary rate and is…
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)…
In this paper, we investigate the additive Gaussian noise channel with noisy feedback. We consider the setup of linear coding of the feedback information and Gaussian signaling of the message (i.e. Cover-Pombra Scheme). Then, we derive the…
Computing capacity of Gaussian Interference Channel (GIC) is complex since knowledge of input distributions is needed to find the mutual information terms in closed forms, which should be optimized over input distributions and associated…
The interference channel with common information (IC-CI) consists of two transmit-receive pairs that communicate over a common noisy medium. Each transmitter has an individual message for its paired receiver, and additionally, both…
In this paper, two-user Gaussian interference channel(GIC) is revisited with the objective of developing implementable (explicit) channel codes. Specifically, low density parity check (LDPC) codes are adopted for use over these channels,…