English
Related papers

Related papers: Achievable Rates and Upper bounds for the Interfer…

200 papers

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

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

We study information-theoretic security for discrete memoryless interference and broadcast channels with independent confidential messages sent to two receivers. Confidential messages are transmitted to their respective receivers with…

Information Theory · Computer Science 2016-11-15 Ruoheng Liu , Ivana Maric , Predrag Spasojevic , Roy D. Yates

Consider the broadcast relay channel (BRC) which consists of a source sending information over a two user broadcast channel in presence of two relay nodes that help the transmission to the destinations. Clearly, this network with five nodes…

Information Theory · Computer Science 2010-05-05 Arash Behboodi , Pablo Piantanida

In this research report, an achievability region and a converse region for the two-user Gaussian interference channel with noisy channel-output feedback (G-IC-NOF) are presented. The achievability region is obtained using a random coding…

Information Theory · Computer Science 2016-11-16 Victor Quintero , Samir M. Perlaza , Iñaki Esnaola , Jean-Marie Gorce

We investigate the effects of user cooperation on the secrecy of broadcast channels by considering a cooperative relay broadcast channel. We show that user cooperation can increase the achievable secrecy region. We propose an achievable…

Information Theory · Computer Science 2008-11-11 E. Ekrem , S. Ulukus

In coded bi-directional cooperation, two nodes wish to exchange messages over a shared half-duplex channel with the help of a relay. In this paper, we derive performance bounds for this problem for each of three protocols. The first…

Information Theory · Computer Science 2008-06-05 Sang Joon Kim , Patrick Mitran , Vahid Tarokh

Motivated by the broadcast view of the interference channel, the new problem of communication with disturbance constraints is formulated. The rate-disturbance region is established for the single constraint case and the optimal encoding…

Information Theory · Computer Science 2011-11-09 Bernd Bandemer , Abbas El Gamal

We develop a new upper bound on the capacity of the relay channel that is tighter than previously known upper bounds. This upper bound is proved using traditional weak converse techniques involving mutual information inequalities and…

Information Theory · Computer Science 2022-04-01 Abbas El Gamal , Amin Gohari , Chandra Nair

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

Relays in cellular systems are interference limited. The highest end-to-end sum rates are achieved when the relays are jointly optimized with the transmit strategy. Unfortunately, interference couples the links together making joint…

Information Theory · Computer Science 2015-03-20 Kien T. Truong , Robert W. Heath

The paper studies a class of three user Gaussian interference channels. A new layered lattice coding scheme is introduced as a transmission strategy. The use of lattice codes allows for an "alignment" of the interference observed at each…

Information Theory · Computer Science 2008-09-26 Sriram Sridharan , Amin Jafarian , Sriram Vishwanath , Syed A. Jafar , Shlomo Shamai

The use of existing network devices as relays has a potential to improve the overall network performance. In this work, we consider a two-hop wireless relay setting, where the channels between the source and relay nodes to the destination…

Networking and Internet Architecture · Computer Science 2017-04-11 Mehdi Salehi Heydar Abad , Ozgur Ercetin , Eylem Ekici

We study the problem of joint information and energy transfer in a binary two-hop channel with an energy harvesting relay. We consider a finite battery size at the relay and energy loss in transmitting energy. In other words, to be able to…

Information Theory · Computer Science 2021-09-29 Ali H. Abdollahi Bafghi , Mahtab Mirmohseni , Mohammad Reza Aref

In this paper, protocols for the half-duplex relay channel are introduced and performance limits are analyzed. Relay nodes underly an orthogonality constraint, which prohibits simultaneous receiving and transmitting on the same…

Information Theory · Computer Science 2010-02-02 Peter Rost , Gerhard Fettweis

An information measure based on fractional partitions of a set is used to derive a general dependence balance inequality for communication. This inequality is used to obtain new upper bounds on reliable and secret rates for multiterminal…

Information Theory · Computer Science 2026-04-14 Amin Gohari , Gerhard Kramer

Achievable rate regions for cooperative relay broadcast channels with rate-limited feedback are proposed. Specifically, we consider two-receiver memoryless broadcast channels where each receiver sends feedback signals to the transmitter…

Information Theory · Computer Science 2016-05-09 Youlong Wu

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 novel class of achievable rate regions is obtained for the K-receiver broadcast channel with two groupcast messages. The associated achievability schemes are parameterized by an expansion of the message set which then determines how…

Information Theory · Computer Science 2020-01-28 Mohamed Salman , Mahesh K. Varanasi

We consider the two-hop interference channel (IC), which consists of two source-destination pairs communicating with each other via two relays. We analyze the degrees of freedom (DoF) of this network when the relays are restricted to…

Information Theory · Computer Science 2016-11-18 Ibrahim Issa , Silas L. Fong , A. Salman Avestimehr