相关论文: Generalized Degrees of Freedom of the Symmetric Ga…
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 determine the exact sum secure degrees of freedom (d.o.f.) of the K-user Gaussian interference channel. We consider three different secrecy constraints: 1) K-user interference channel with one external eavesdropper (IC-EE), 2) K-user…
It is shown that in the K-user interference channel, 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 (all values…
It has been conjectured by Host-Madsen and Nosratinia that complex Gaussian interference channels with constant channel coefficients have only one degree-of-freedom regardless of the number of users. While several examples are known of…
In this paper, we characterize the degrees of freedom (DoF) for $K $-user $M \times 1 $ multiple-input single-output interference channels with reconfigurable antennas which have multiple preset modes at the receivers, assuming linear…
This paper fully determines the degree-of-freedom (DoF) region of two-user interference channels with arbitrary number of transmit and receive antennas and isotropic fading, where the channel state information is available to the receivers…
The aim of this paper is to study the achievable rates for a $K$ user Gaussian interference channels for any SNR using a combination of lattice and algebraic codes. Lattice codes are first used to transform the Gaussian interference channel…
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…
An achievable rate region, based on lattice interference alignment, is derived for a class of time-invariant Gaussian interference channels with more than two users. The result is established via a new coding theorem for the two-user…
The degrees of freedom (DoF) number of the fully connected K-user Gaussian interference channel is known to be K/2. In [1], the DoF for the same channel model was studied while allowing each message to be available at its own transmitter as…
This paper studies the low-SNR regime performance of a scalar complex K -user interference channel with Gaussian noise. The finite bandwidth case is considered, where the low-SNR regime is approached by letting the input power go to zero…
We consider a secure communication scenario through the two-user Gaussian interference channel: each transmitter (user) has a confidential message to send reliably to its intended receiver while keeping it secret from the other receiver.…
This paper studies the frequency/time selective $K$-user Gaussian interference channel with secrecy constraints. Two distinct models, namely the interference channel with confidential messages and the one with an external eavesdropper, are…
The interference relay channel (IRC) under strong interference is considered. A high-signal-to-noise ratio (SNR) generalized degrees of freedom (GDoF) characterization of the capacity is obtained. To this end, a new GDoF upper bound is…
This paper considers a $K$-cell multiple access channel with inter-symbol interference. The primary finding of this paper is that, without instantaneous channel state information at the transmitters (CSIT), the sum degrees-of-freedom (DoF)…
The generalized degrees of freedom (GDoF) of the symmetric two-user Gaussian interference relay channel (IRC) is studied. While it is known that the relay does not increase the DoF of the IC, this is not known for the more general GDoF. For…
The generalized degrees of freedom (GDoF) of the two user symmetric multiple input multiple output (MIMO) interference channel (IC) are characterized as a function of the channel strength levels and the level of channel state information at…
We consider a constant $K$-user Gaussian interference channel with $M$ antennas at each transmitter and $N$ antennas at each receiver, denoted as a $(K,M,N)$ channel. Relying on a result on simultaneous Diophantine approximation, a real…
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…
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…