English
Related papers

Related papers: Outer Bounds for the Interference Channel with a C…

200 papers

In this paper we study the relay-interference wireless network, in which relay (helper) nodes are to facilitate competing information flows over a wireless network. We examine this in the context of a deterministic wireless interaction…

Information Theory · Computer Science 2008-12-10 Soheil Mohajer , Suhas N. Diggavi , Christina Fragouli , David N. C. Tse

The deterministic capacity of a relay network is the capacity of a network when relays are restricted to transmitting \emph{reliable} information, that is, (asymptotically) deterministic function of the source message. In this paper it is…

Information Theory · Computer Science 2016-11-18 Anders Host-Madsen

We consider an additive Gaussian channel with additive Gaussian noise feedback. We derive an upper bound on the n-block capacity (defined by Cover [1]). It is shown that this upper bound can be obtained by solving a convex optimization…

Information Theory · Computer Science 2015-03-19 Chong Li , Nicola Elia

We develop several lower bounds on the capacity of binary input symmetric output channels with synchronization errors which also suffer from other types of impairments such as substitutions, erasures, additive white Gaussian noise (AWGN)…

Information Theory · Computer Science 2012-03-30 Mojtaba Rahmati , Tolga M. Duman

In multi-user information theory it is often assumed that every node in the network possesses all codebooks used in the network. This assumption may be impractical in distributed ad-hoc, cognitive or heterogeneous networks. This work…

Information Theory · Computer Science 2014-10-03 Alex Dytso , Daniela Tuninetti , Natasha Devroye

In some applications, the variance of additive measurement noise depends on the signal that we aim to measure. For instance, additive Gaussian signal-dependent noise (AGSDN) channel models are used in molecular and optical communication.…

Information Theory · Computer Science 2017-06-05 Hamid Ghourchian , Gholamali Aminian , Amin Gohari , Mahtab Mirmohseni , Masoumeh Nasiri-Kenari

In this paper, we study the uplink of a cellular system using the linear deterministic approximation model, where there are two users transmitting to a receiver, mutually interfering with a third transmitter communicating with a second…

Information Theory · Computer Science 2011-04-04 J. Buehler , G. Wunder

We study a four terminal parallel relay-eavesdropper channel which consists of multiple independent relay-eavesdropper channels as subchannels. For the discrete memoryless case, we establish inner and outer bounds on the rate-equivocation…

Information Theory · Computer Science 2010-11-10 Zohaib Hassan Awan , Abdellatif Zaidi , Luc Vandendorpe

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 investigate the half-duplex cooperative communication scheme of a two user Gaussian interference channel. We develop achievable region and outer bound for the case when the system allow either transmitter or receiver…

Information Theory · Computer Science 2009-01-20 Yong Peng , Dinesh Rajan

This paper studies a symmetric K user Gaussian interference channel with K transmitters and K receivers. A "very strong" interference regime is derived for this channel setup. A "very strong" interference regime is one where the capacity…

Information Theory · Computer Science 2008-08-19 Sriram Sridharan , Amin Jafarian , Sriram Vishwanath , Syed A. Jafar

The cognitive interference channel with confidential messages is studied. Similarly to the classical two-user interference channel, the cognitive interference channel consists of two transmitters whose signals interfere at the two…

Information Theory · Computer Science 2007-10-11 Yingbin Liang , Anelia Somekh-Baruch , H. Vincent Poor , Shlomo Shamai , Sergio Verdu

Channel symmetry properties that imply the tightness of Shannon's random coding inner bound have recently been used to determine the capacity region of discrete-memoryless two-way channels (DM-TWCs). For channels without such symmetry…

Information Theory · Computer Science 2020-09-28 Jian-Jia Weng , Fady Alajaji , Tamás Linder

Provable lower bounds are presented for the information rate I(X; X+S+N) where X is the symbol drawn from a fixed, finite-size alphabet, S a discrete-valued random variable (RV) and N a Gaussian RV. The information rate I(X; X+S+N) serves…

Information Theory · Computer Science 2011-10-04 Seongwook Jeong , Jaekyun Moon

The fact that the results for 2-receiver broadcast channels (BCs) are not generalized to the 3-receiver ones is of information theoretical importance. In this paper we study two classes of discrete memoryless BCs with non-causal side…

Information Theory · Computer Science 2014-08-19 Sajjad Bahrami , Ghosheh Abed Hodtani

In this paper, taking into account the effect of link delays, we investigate the capacity region of the Cognitive Interference Channel (C-IFC), where cognition can be obtained from either causal or non-causal generalized feedback. For this…

Information Theory · Computer Science 2012-02-02 Mahtab Mirmohseni , Bahareh Akhbari , Mohammad Reza Aref

The capacity regions are investigated for two relay broadcast channels (RBCs), where relay links are incorporated into standard two-user broadcast channels to support user cooperation. In the first channel, the Partially Cooperative Relay…

Information Theory · Computer Science 2007-07-13 Yingbin Liang , Venugopal V. Veeravalli

In a multi-user wireless network equipped with multiple relay nodes, some relays are more intelligent than other relay nodes. The intelligent relays are able to gather channel state information, perform linear processing and forward signals…

Information Theory · Computer Science 2015-06-04 Zuleita Ho , Eduard Jorswieck

We establish an achievable rate region for discrete memoryless interference relay channels that consist of two source-destination pairs and one or more relays. We develop an achievable scheme combining Han-Kobayashi and noisy network coding…

Information Theory · Computer Science 2013-03-06 Byungjun Kang , Si-Hyeon Lee , Sae-Young Chung , Changho Suh

In this paper, we study a communication system consisting of three end-nodes, e.g. a single transceiver base station (BS), one transmitting and one receiving user equipments (UEs), and a common two-way relay node (RN) wherein the…

Information Theory · Computer Science 2011-02-16 Erhan Yilmaz , Raymond Knopp , David Gesbert
‹ Prev 1 8 9 10 Next ›