English
Related papers

Related papers: An Achievable Rate Region for Three-Pair Interfere…

200 papers

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

We consider the MIMO (multiple-input multiple-output) Gaussian interference channel with i.i.d. fading across antennas and channel uses and with the delayed local channel state information at the transmitters (CSIT). For the two-user case,…

Information Theory · Computer Science 2015-03-19 Akbar Ghasemi , Abolfazl Seyed Motahari , Amir Keyvan Khandani

This paper derives an achievable rate-distortion (R-D) region for the state-dependent discrete memoryless multiple access channel (SD-DMMAC), where the generalized feedback and causal side information are present at encoders, and the…

Information Theory · Computer Science 2024-09-27 Xinyang Li , Vlad C. Andrei , Ullrich J. Mönich , Holger Boche

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, inner and outer bounds on the capacity region of two-user interference channels with two confidential messages have been proposed. By adding secure multiplex coding to the error correction method in [15] which achieves the…

Information Theory · Computer Science 2015-03-19 Xiaolin Li , Ryutaroh Matsumoto

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

The capacity region of a broadcast channel consisting of k-receivers that lie in a less noisy sequence is an open problem, when k >= 3. We solve this problem for the case k=3. We prove that superposition coding is optimal for a class of…

Information Theory · Computer Science 2010-04-26 Chandra Nair , Zizhou Vincent Wang

Three-receiver broadcast channel (BC) is of interest due to its information theoretical differences with two receiver one. In this paper, we derive achievable rate regions for two classes of 3-receiver BC with side information available at…

Information Theory · Computer Science 2012-05-21 Saeed Hajizadeh , Ghosheh Abed Hodtani

Characterizing the global maximum of weighted sum-rate (WSR) for the K-user Gaussian interference channel (GIC), with the interference treated as Gaussian noise, is a key problem in wireless communication. However, due to the users' mutual…

Information Theory · Computer Science 2016-11-17 Liang Liu , Rui Zhang , Kee-Chaing Chua

It is known that fiber nonlinearities induce crosstalk in a wavelength division multiplexed (WDM) system, which limits the capacity of such systems as the transmitted signal power is increased. A network user in a WDM system is an entity…

Information Theory · Computer Science 2022-06-07 Viswanathan Ramachandran , Gabriele Liga , Astrid Barreiro , Alex Alvarado

This paper investigates the additive white Gaussian noise two-way relay channel, where two users exchange messages through a relay. Asymmetrical channels are considered where the users can transmit data at different rates and at different…

Information Theory · Computer Science 2011-10-26 Lawrence Ong , Christopher M. Kellett , Sarah J. Johnson

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

The cognitive interference channel (C-IFC) consists of a classical two-user interference channel in which the message of one user (the "primary" user) is non-causally available at the transmitter of the other user (the "cognitive" user). We…

Information Theory · Computer Science 2016-11-18 Stefano Rini , Daniela Tuninetti , Natasha Devroye

An Interference Channel with Generalized Feedback (IFC-GF) is a model for a wireless network where several source-destination pairs compete for the same channel resources, and where the sources have the ability to sense the current channel…

Information Theory · Computer Science 2010-06-10 Echo Yang , Daniela Tuninetti

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, a class of relay networks is considered. We assume that, at a node, outgoing channels to its neighbors are orthogonal, while incoming signals from neighbors can interfere with each other. We are interested in the multicast…

Information Theory · Computer Science 2016-11-17 Wooseok Nam , Sae-Young Chung , Yong H. Lee

Treating the interference as noise in the n-user interference channel, the paper describes a novel approach to the rates region, composed by the time-sharing convex hull of 2^n-1 corner points achieved through On/Off binary power control.…

Information Theory · Computer Science 2010-08-24 Mohamad Charafeddine , Zhu Han , Arogyaswami Paulraj , John Cioffi

The capacity region of the cooperative two-user Multiple Access Channel (MAC) in Gaussian noise is determined to within a constant gap for both the Full-Duplex (FD) and Half-Duplex (HD) case. The main contributions are: (a) for both FD and…

Information Theory · Computer Science 2016-11-18 Daniela Tuninetti

We study opportunistic interference management when there is bursty interference in parallel 2-user linear deterministic interference channels. A degraded message set communication problem is formulated to exploit the burstiness of…

Information Theory · Computer Science 2013-05-15 Shaunak Mishra , I-Hsiang Wang , Suhas Diggavi

In this paper, we study the state-dependent two-user interference channel, where the state information is non-causally known at both transmitters but unknown to either of the receivers. We first propose two coding schemes for the discrete…

Information Theory · Computer Science 2015-03-19 Lili Zhang , Jinhua Jiang , Shuguang Cui