English
Related papers

Related papers: On Gaussian Multiple Access Channels with Interfer…

200 papers

We consider the capacity region of a $K$-user multiple access channel (MAC) with energy harvesting transmitters. Each user stores and schedules the randomly arriving energy using an energy buffer. Users can also perform energy cooperation…

Information Theory · Computer Science 2017-02-10 Yunquan Dong , Zhengchuan Chen , Pingyi Fan

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.…

Information Theory · Computer Science 2016-04-26 Parisa Babaheidarian , Somayeh Salimi , Panos Papadimitratos

The capacity of the two-user Gaussian cognitive interference channel, a variation of the classical interference channel where one of the transmitters has knowledge of both messages, is known in several parameter regimes but remains unknown…

Information Theory · Computer Science 2010-07-12 Stefano Rini , Daniela Tuninetti , Natasha Devroye

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

In this paper, an $n$-user Gaussian interference channel, where the power of the transmitters are subject to some upper-bounds is studied. We obtain a closed-form expression for the rate region of such a channel based on the…

Information Theory · Computer Science 2016-11-17 Hajar Mahdavi-Doost , Masoud Ebrahimi , Amir K. Khandani

In this paper, we first study a two-user interference channel with generalized feedback. We establish an inner bound on its capacity region. The coding scheme that we employ for the inner bound is based on an appropriate combination of…

Information Theory · Computer Science 2016-11-15 Abdellatif Zaidi

This paper considers a two-user Gaussian interference channel with energy harvesting transmitters. Different than conventional battery powered wireless nodes, energy harvesting transmitters have to adapt transmission to availability of…

Information Theory · Computer Science 2015-03-19 Kaya Tutuncuoglu , Aylin Yener

We study the problem of maximizing sum rates in a Gaussian interference-limited channel that models multiuser communication in a CDMA wireless network or DSL cable binder. Using tools from nonnegative irreducible matrix theory, in…

Optimization and Control · Mathematics 2008-07-07 Shmuel Friedland , Chee Wei Tan

This paper studies the achievable rate region of the two-user single-input-single-output (SISO) Gaussian interference channel, when the improper Gaussian signaling is applied. Under the assumption that the interference is treated as…

Information Theory · Computer Science 2012-05-10 Yong Zeng , Cenk M. Yetis , Erry Gunawan , Yong Liang Guan , Rui Zhang

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

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 3-user Gaussian Interference Channel (GIC) with mixed strong-very strong interference was established in \cite{ChS}. The mixed strong-very strong interference conditions considered in \cite{ChS} correspond to the…

Information Theory · Computer Science 2011-02-16 G. Abhinav , B. Sundar Rajan

We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wire-tapper who receives a degraded version of the…

Information Theory · Computer Science 2007-07-13 Ender Tekin , Aylin Yener

We define a class of Z-interference channels for which we obtain a new upper bound on the capacity region. The bound exploits a technique first introduced by Korner and Marton. A channel in this class has the property that, for the…

Information Theory · Computer Science 2008-08-07 Nan Liu , Andrea Goldsmith

The capacity of the multiple-access channel with any distribution of messages among the transmitting nodes was determined by Han in 1979 and the expression of the capacity region contains a number of rate bounds and that grows exponentially…

Information Theory · Computer Science 2012-02-07 Stefano Rini

This paper considers a two-hop interference network, where two users transmit independent messages to their respective receivers with the help of two relay nodes. The transmitters do not have direct links to the receivers; instead, two…

Information Theory · Computer Science 2009-10-09 Yi Cao , Biao Chen

A generalized multiple access channel (GMAC) with one confidential message set is studied, where two users (users 1 and 2) attempt to transmit common information to a destination, and user 1 also has confidential information intended for…

Information Theory · Computer Science 2007-08-22 Yingbin Liang , H. Vincent Poor

The capacity region of multi-pair bidirectional relay networks, in which a relay node facilitates the communication between multiple pairs of users, is studied. This problem is first examined in the context of the linear shift deterministic…

Information Theory · Computer Science 2016-11-17 Aydin Sezgin , A. Salman Avestimehr , M. Amin Khajehnejad , Babak Hassibi

Certain deterministic interference channels have been shown to accurately model Gaussian interference channels in the asymptotic low-noise regime. Motivated by this correspondence, we investigate a K user-pair, cyclically symmetric,…

Information Theory · Computer Science 2016-11-17 Bernd Bandemer , Gonzalo Vazquez-Vilar , Abbas El Gamal

Despite the simplicity of the scheme of treating interference as noise (TIN), it was shown to be sum-capacity optimal in the Gaussian 2-user interference channel in \cite{ShangKramerChen,MotahariKhandani,AnnapureddyVeeravalli}. In this…

Information Theory · Computer Science 2011-05-27 Anas Chaaban , Aydin Sezgin
‹ Prev 1 4 5 6 7 8 10 Next ›