English
Related papers

Related papers: Interference as Noise: Friend or Foe?

200 papers

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…

Information Theory · Computer Science 2014-01-14 Chunhua Geng , Hua Sun , Syed A. Jafar

The two-user Gaussian interference channel (G-IC) is revisited, with a particular focus on practically amenable discrete input signalling and treating interference as noise (TIN) receivers. The corresponding deterministic interference…

Information Theory · Computer Science 2021-03-18 Min Qiu , Yu-Chih Huang , Jinhong Yuan

In a K-user Gaussian interference channel, it has been shown by Geng et al. 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…

Information Theory · Computer Science 2014-12-09 Chunhua Geng , Syed A. Jafar

For single-antenna Gaussian interference channels, we re-formulate the problem of determining the Generalized Degrees of Freedom (GDoF) region achievable by treating interference as Gaussian noise (TIN) derived in [3] from a combinatorial…

Information Theory · Computer Science 2015-09-17 Xinping Yi , Giuseppe Caire

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…

Information Theory · Computer Science 2013-05-21 Chunhua Geng , Navid Naderializadeh , A. Salman Avestimehr , Syed A. Jafar

In this paper, we look at the problem of treating interference as noise (TIN) in the Gaussian interfering multiple access channel (IMAC). The considered network comprises $K$ mutually interfering multiple access channels (MACs), each…

Information Theory · Computer Science 2018-05-15 Hamdi Joudeh , Bruno Clerckx

It has been shown recently by Geng et al. that in a $K$ user Gaussian interference network, 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…

Information Theory · Computer Science 2014-01-14 Hua Sun , Syed A. Jafar

The paper establishes the capacity region of the Gaussian interference channel with many transmitter-receiver pairs constrained to use point-to-point codes. The capacity region is shown to be strictly larger in general than the achievable…

Information Theory · Computer Science 2011-02-15 Francois Baccelli , Abbas El Gamal , David Tse

In this paper, we explore the information-theoretic optimality of treating interference as noise (TIN) in cellular networks. We focus on uplink scenarios modeled by the Gaussian interfering multiple access channel (IMAC), comprising $K$…

Information Theory · Computer Science 2019-04-25 Hamdi Joudeh , Bruno Clerckx

We study the covert communication over K-user discrete memoryless interference channels (DM-ICs) with a warden. It is assumed that the warden's channel output distribution induced by K "off" input symbols, which are sent when no…

Information Theory · Computer Science 2020-03-11 Kang-Hee Cho , Si-Hyeon Lee

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

In the two-user Gaussian interference channel with Gaussian inputs and treating interference as noise (TIN), improper complex signals can be beneficial if time-sharing is not allowed or if only the data rates are averaged over several…

Information Theory · Computer Science 2020-12-30 Christoph Hellings , Ferhad Askerbeyli , Wolfgang Utschick

We study the capacity of discrete memoryless many-to-one interference channels, i.e., K user interference channels where only one receiver faces interference. For a class of many-to-one interference channels, we identify a noisy…

Information Theory · Computer Science 2009-12-17 Viveck R. Cadambe , Syed A. Jafar

A general time-varying feedback coding scheme is proposed for $M$-user fully connected symmetric Gaussian interference channels. Based on the analysis of the general coding scheme, we prove a theorem which gives a criterion for designing…

Information Theory · Computer Science 2019-10-01 Lan V. Truong , Hirosuke Yamamoto

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

We address single-user data transmission over a channel where the received signal incurs interference from a finite number of users (interfering users) that use single codebooks for transmitting their own messages. The receiver, however, is…

Information Theory · Computer Science 2007-11-21 Abolfazl S. Motahari , Amir K. Khandani

The generalized degrees of freedom (GDoF) region of the MIMO Gaussian interference channel (IC) is obtained for the general case of an arbitrary number of antennas at each node and where the signal-to-noise ratios (SNR) and…

Information Theory · Computer Science 2011-03-15 Sanjay Karmakar , Mahesh K. Varanasi

This work considers the corner points of the capacity region of a two-user Gaussian interference channel (GIC). In a two-user GIC, the rate pairs where one user transmits its data at the single-user capacity (without interference), and the…

Information Theory · Computer Science 2015-04-09 Igal Sason

A two-user Gaussian Z-Interference Channel (GZIC) is considered, in which encoders are connected through noiseless links with finite capacities. In this setting, prior to each transmission block the encoders communicate with each other over…

Information Theory · Computer Science 2010-05-28 Hossein Bagheri , Abolfazl S. Motahari , Amir K. Khandani

The best outer bound on the capacity region of the two-user Gaussian Interference Channel (GIC) is known to be the intersection of regions of various bounds including genie-aided outer bounds, in which a genie provides noisy input signals…

Information Theory · Computer Science 2017-04-20 Junyoung Nam
‹ Prev 1 2 3 10 Next ›