English
Related papers

Related papers: Capacity Bounds for a Class of Interference Relay …

200 papers

The capacity of a class of deterministic relay channels with the transmitter input X, the receiver output Y, the relay output Y_1 = f(X, Y), and a separate communication link from the relay to the receiver with capacity R_0, is shown to be…

Information Theory · Computer Science 2016-11-18 Thomas M. Cover , Young-Han Kim

We consider a three-terminal state-dependent relay channel with the channel state available non-causally at only the source. Such a model may be of interest for node cooperation in the framework of cognition, i.e., collaborative signal…

Information Theory · Computer Science 2016-11-17 Abdellatif Zaidi , Shlomo Shamai , Pablo Piantanida , Luc Vandendorpe

The interference channel with common information (IC-CI) consists of two transmit-receive pairs that communicate over a common noisy medium. Each transmitter has an individual message for its paired receiver, and additionally, both…

Information Theory · Computer Science 2012-03-01 Chinmay S. Vaze , Mahesh K. Varanasi

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

This paper investigates the capacity of a wireless two way relay channel in which two end nodes exchange information via a relay node. The capacity is defined in the information-theoretic sense as the maximum information exchange rate…

Information Theory · Computer Science 2008-04-22 Zhang Shengli , Soung Chang Liew

We characterize the capacity region to within 2 bits/s/Hz and the symmetric capacity to within 1 bit/s/Hz for the two-user Gaussian interference channel (IC) with feedback. We develop achievable schemes and derive a new outer bound to…

Information Theory · Computer Science 2010-05-20 Changho Suh , David Tse

For two-user interference channels, the capacity is known for the case where interference is stronger than the desired signal. Moreover, it is known that if the interference is above a certain level, it does not reduce the capacity at all.…

Information Theory · Computer Science 2012-06-21 Frederic Knabe , Aydin Sezgin

The capacity regions of vector, or multiple-input multiple-output, Gaussian interference channels are established for very strong interference and aligned strong interference. Furthermore, the sum-rate capacities are established for Z…

Information Theory · Computer Science 2016-11-17 Xiaohu Shang , Biao Chen , Gerhard Kramer , H. Vincent Poor

The capacity of a class of multi-way relay channels, where L users communicate via a relay (at possibly different rates), is derived for the case where the channel outputs are modular sums of the channel inputs and the receiver noise. The…

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

A partially cooperative relay broadcast channel (RBC) is a three-node network with one source node and two destination nodes (destinations 1 and 2) where destination 1 can act as a relay to assist destination 2. Inner and outer bounds on…

Information Theory · Computer Science 2007-07-13 Yingbin Liang , Gerhard Kramer

Interference limits performance in wireless networks, and cooperation among receivers or transmitters can help mitigate interference by forming distributed MIMO systems. Earlier work shows how limited receiver cooperation helps mitigate…

Information Theory · Computer Science 2010-05-03 I-Hsiang Wang , David N. C. Tse

This third part of the paper is related to the study of information flow in networks with strong interference. First, the two-receiver networks are considered. A unified outer bound for the capacity region of these networks is established.…

Information Theory · Computer Science 2013-02-18 Reza K. Farsani

In this paper, the role of secret key with finite rate is studied to enhance the secrecy performance of the system when users are operating in interference limited scenarios. To address this problem, a 2-user Gaussian Z-IC with secrecy…

Information Theory · Computer Science 2021-05-20 Somalatha U , Parthajit Mohapatra

The capacity region of the interference channel in which one transmitter non-causally knows the message of the other, termed the cognitive interference channel, has remained open since its inception in 2005. A number of subtly differing…

Information Theory · Computer Science 2015-03-13 Stefano Rini , Daniela Tuninetti , Natasha Devroye

Consider a Gaussian relay network where a number of sources communicate to a destination with the help of several layers of relays. Recent work has shown that a compress-and-forward based strategy at the relays can achieve the capacity of…

Information Theory · Computer Science 2013-04-30 Ritesh Kolte , Ayfer Özgür

This paper is motivated by a sensor network on a correlated field where nearby sensors share information, and can thus assist rather than interfere with one another. A special class of two-user Gaussian interference channels (IFCs) is…

Information Theory · Computer Science 2007-07-13 Wei Wu , Sriram Vishwanath , Ari Arapostathis

In this paper, we study relay networks with orthogonal components in presence of noncausal channel state information (CSI) available at the source. We propose an upper bound on the capacity of the discrete memoryless model (DM)for the case…

Information Theory · Computer Science 2013-05-08 Amir Sonee , Ghosheh Abed Hodtani

This paper is motivated by a sensor network on a correlated field where nearby sensors share information, and can thus assist rather than interfere with one another. We consider a special class of two-user Gaussian interference channels…

Information Theory · Computer Science 2007-07-13 Wei Wu , Sriram Vishwanath , Ari Arapostathis

We consider the 3-user Gaussian interference channel and provide an outer bound on its capacity region. Under some conditions, which we call the mixed strong-very strong interference conditions, this outer bound is achievable. These…

Information Theory · Computer Science 2010-10-26 Anas Chaaban , Aydin Sezgin

We establish lower and upper bounds for the identification capacity of discrete-time Gaussian channels subject to inter-symbol interference (ISI), a canonical model in wireless communication. Our analysis accounts for deterministic encoders…

Information Theory · Computer Science 2026-05-04 Mohammad Javad Salariseddigh , Christian Deppe
‹ Prev 1 3 4 5 6 7 10 Next ›