English
Related papers

Related papers: On Achievability of Gaussian Interference Channel …

200 papers

For two-user interference channels, the capacity is known for the case where interference is stronger than the desired signal. Moreover, it is known that if the interference is above a certain level, it does not reduce the capacity at all.…

Information Theory · Computer Science 2012-06-21 Frederic Knabe , Aydin Sezgin

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…

Information Theory · Computer Science 2009-11-04 Ramy H. Gohary , Timothy N. Davidson

The capacity region of the interference channel in which one transmitter non-causally knows the message of the other, termed the cognitive interference channel, has remained open since its inception in 2005. A number of subtly differing…

Information Theory · Computer Science 2015-03-13 Stefano Rini , Daniela Tuninetti , Natasha Devroye

The capacity region of the two-user Gaussian Interference Channel (IC) is studied. Three classes of channels are considered: weak, one-sided, and mixed Gaussian IC. For the weak Gaussian IC, a new outer bound on the capacity region is…

Information Theory · Computer Science 2008-01-09 Abolfazl S. Motahari , Amir K. Khandani

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…

Information Theory · Computer Science 2010-05-20 Changho Suh , David Tse

Interference is a major issue that limits the performance in wireless networks, and cooperation among receivers can help mitigate interference by forming distributed MIMO systems. The rate at which receivers cooperate, however, is limited…

Information Theory · Computer Science 2009-08-20 I-Hsiang Wang , David N. C. Tse

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…

Information Theory · Computer Science 2025-01-28 Sagnik Bhattacharya , Abhiram Rao Gorle , Muhammad Ali Mohsin , John M. Cioffi

A standard assumption in the design of ultra-reliable low-latency communication systems is that the duration between message arrivals is larger than the number of channel uses before the decoding deadline. Nevertheless, this assumption…

Information Theory · Computer Science 2025-01-31 Homa Nikbakht , Malcolm Egan , Jean-Marie Gorce , H. Vincent Poor

In interference alignment, users sharing a wireless channel are each able to achieve data rates of up to half of the non-interfering channel capacity, no matter the number of users. In an ergodic setting, this is achieved by pairing…

Information Theory · Computer Science 2011-02-21 Joseph C. Koo , William Wu , John Gill

In this paper, the role of secret key with finite rate is studied to enhance the secrecy performance of the system when users are operating in interference limited scenarios. To address this problem, a 2-user Gaussian Z-IC with secrecy…

Information Theory · Computer Science 2021-05-20 Somalatha U , Parthajit Mohapatra

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…

Signal Processing · Electrical Eng. & Systems 2017-12-21 Mohammadreza Darabi

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…

Information Theory · Computer Science 2012-02-03 Lei Lin , Xiao Ma , Xiujie Huang , Baoming Bai

A new problem formulation is presented for the Gaussian interference channels (GIFC) with two pairs of users, which are distinguished as primary users and secondary users, respectively. The primary users employ a pair of encoder and decoder…

Information Theory · Computer Science 2016-11-17 Xiujie Huang , Xiao Ma , Lei Lin , Baoming Bai

In this paper, we present a general formula for the capacity region of a general interference channel with two pairs of users. The formula shows that the capacity region is the union of a family of rectangles, where each rectangle is…

Information Theory · Computer Science 2013-10-08 Xiao Ma , Lei Lin , Chulong Liang , Xiujie Huang , Baoming Bai

This paper presents generalized channel coding theorems for a time-slotted distributed communication system where a transmitter-receiver pair is communicating in parallel with other transmitters. Assume that the channel code of each…

Information Theory · Computer Science 2016-11-15 Jie Luo

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…

Information Theory · Computer Science 2020-12-09 Amir K. Khandani

The energy-optimal scheme is found for communicating one bit over a memoryless Gaussian channel with an ideal feedback channel. It is assumed that the channel is allowed to be used at most N times before decoding. The optimal…

Information Theory · Computer Science 2016-05-17 Bo Bernhardsson , Ather Gattami

An interference channel is said to have strong interference if for all input distributions, the receivers can fully decode the interference. This definition of strong interference applies to discrete memoryless, scalar and vector Gaussian…

Information Theory · Computer Science 2016-11-17 Xiaohu Shang , H. Vincent Poor

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers via a Gaussian MIMO broadcast channel. A wire-tapper also receives the transmitted signal via another MIMO…

Information Theory · Computer Science 2009-05-01 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

It is known that the capacity of parallel (multi-carrier) Gaussian point-to-point, multiple access and broadcast channels can be achieved by separate encoding for each subchannel (carrier) subject to a power allocation across carriers. In…

Information Theory · Computer Science 2016-11-17 Viveck R. Cadambe , Syed A. Jafar