English
Related papers

Related papers: An Achievable Rate Region for the Gaussian Interfe…

200 papers

The capacity of a network in which a multiple access channel (MAC) generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case.…

Information Theory · Computer Science 2012-09-06 Fangfang Zhu , Xiaohu Shang , Biao Chen , H. Vincent Poor

We revisit the Gaussian broadcast channel (GBC) and explore the rate region achieved by purely discrete inputs with treating interference as noise (TIN) decoding. Specifically, we introduce a simple scheme based on superposition coding with…

Information Theory · Computer Science 2026-04-07 Yujie Shao , Min Qiu

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, which derived a…

Information Theory · Computer Science 2012-05-22 Lei Zhou , Wei Yu

In this paper, the Interference Network with General Message Sets (IN-GMS) is introduced in which several transmitters send messages to several receivers: Each subset of transmitters transmit an individual message to each subset of…

Information Theory · Computer Science 2013-02-17 Reza K. Farsani , Farokh Marvasti

This paper provides comprehensive coding and outer bound for the half-duplex multiple access channel with generalized feedback (MAC-GF). Two users communicate with one destination over a discrete memoryless channel using time division. Each…

Information Theory · Computer Science 2011-08-02 Ahmad Abu Al Haija , Mai Vu

The best known inner bound for the 2-user discrete memoryless interference channel is the Han-Kobayashi rate region. The coding schemes that achieve this region are based on rate-splitting and superposition coding. In this paper, we develop…

Information Theory · Computer Science 2015-02-17 Ritesh Kolte , Ayfer Özgür , Haim Permuter

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

A single-letter achievable rate region is proposed for the two-receiver discrete memoryless broadcast channel with generalized feedback. The coding strategy involves block-Markov superposition coding, using Marton's coding scheme for the…

Information Theory · Computer Science 2014-02-10 Ramji Venkataramanan , S. Sandeep Pradhan

We undertake a Shannon theoretic study of the problem of communicating bit streams over a 3-user quantum interference channel (QIC) and focus on characterizing inner bounds. Adopting the powerful technique of tilting, smoothing, and…

Information Theory · Computer Science 2026-01-29 Fatma Gouiaa , Arun Padakandla

We study a two-user state-dependent generalized multiple-access channel (GMAC) with correlated states. It is assumed that each encoder has \emph{noncausal} access to channel state information (CSI). We develop an achievable rate region by…

Information Theory · Computer Science 2014-09-09 Mohammad Javad Emadi , Majid Nasiri Khormuji , Mikael Skoglund , Mohammad Reza Aref

Achievable rate regions and outer bounds are derived for three-user interference channels where the transmitters cooperate in a unidirectional manner via a noncausal message-sharing mechanism. The three-user channel facilitates different…

Information Theory · Computer Science 2016-11-17 K. G. Nagananda , Parthajit Mohapatra , Chandra R. Murthy , Shalinee Kishore

In this paper, we consider the discrete memoryless interference channel with common information, in which two senders need deliver not only private messages but also certain common messages to their corresponding receivers. We derive an…

Information Theory · Computer Science 2007-07-13 Jinhua Jiang , Yan Xin , Hari Krishna Garg

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

Information Theory · Computer Science 2022-08-26 Jun Muramatsu

We establish a multi-user 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…

Information Theory · Computer Science 2019-07-24 Xiaojie Wang , Chulong Liang , Li Ping , Stephan ten Brink

This paper studies the achievable rate region of the K-user Gaussian multiple-input single-output interference channel (MISO-IC) with the interference treated as noise, when improper or circularly asymmetric complex Gaussian signaling is…

Information Theory · Computer Science 2013-10-10 Yong Zeng , Rui Zhang , Erry Gunawan , Yong Liang Guan

We characterize the symmetric capacity to within 1.7075 bits/s/Hz for the two-user Gaussian interference channel with feedback. The result makes use of a deterministic model to provide insights into the Gaussian channel. We derive a new…

Information Theory · Computer Science 2009-01-26 Changho Suh , David Tse

This paper considers the two-user Gaussian interference channel in the presence of adversarial jammers. We first provide a general model including an arbitrary number of jammers, and show that its capacity region is equivalent to that of a…

Information Theory · Computer Science 2017-12-13 Fatemeh Hosseinigoki , Oliver Kosut

This paper studies a wireless network consisting of multiple transmitter-receiver pairs where interference is treated as noise. Previously, the throughput region of such networks was characterized for either one time slot or an infinite…

Information Theory · Computer Science 2016-11-08 Yirui Cong , Xiangyun Zhou , Rodney A. Kennedy

Recently, Etkin, Tse, and Wang found the capacity region of the two-user Gaussian interference channel to within one bit/s/Hz. A natural goal is to apply this approach to the Gaussian interference channel with an arbitrary number of users.…

Information Theory · Computer Science 2016-11-17 Guy Bresler , Abhay Parekh , David Tse
‹ Prev 1 3 4 5 6 7 10 Next ›