English
Related papers

Related papers: Capacity of Strong and Very Strong Gaussian Interf…

200 papers

In this paper, we consider the Gaussian diamond-wiretap channel that consists of an orthogonal broadcast channel from a source to two relays and a Gaussian fast-fading multiple access-wiretap channel from the two relays to a legitimate…

Information Theory · Computer Science 2015-12-22 Si-Hyeon Lee , Wanyao Zhao , Ashish Khisti

The capacity of the multiple-access channel with any distribution of messages among the transmitting nodes was determined by Han in 1979 and the expression of the capacity region contains a number of rate bounds and that grows exponentially…

Information Theory · Computer Science 2012-02-07 Stefano Rini

In multi user Gaussian relay networks, it is desirable to transmit private information to each user as well as common information to all of them. However, the capacity region of such networks with both kinds of information is not easy to…

Information Theory · Computer Science 2018-01-16 Mohamed S. Ibrahim , Mohammed Nafie , Yahya Mohasseb

Interference is a fundamental feature of the wireless channel. To better understand the role of cooperation in interference management, the two-user Gaussian interference channel where the destination nodes can cooperate by virtue of being…

Information Theory · Computer Science 2011-01-28 Vinod M. Prabhakaran , Pramod Viswanath

By relying on a wireless backhaul link, relay stations enhance the performance of cellular networks at low infrastructure cost, but at the same time, they can aggravate the interference issue. In this paper, we analyze for several relay…

Information Theory · Computer Science 2015-03-24 Fanny Parzysz , Mai Vu , François Gagnon

We analyze the performance of an interference-limited, decode-and-forward, cooperative relaying system that comprises a source, a destination, and $N$ relays, placed arbitrarily on the plane and suffering from interference by a set of…

Information Theory · Computer Science 2016-03-25 Alessandro Crismani , Udo Schilcher , Günther Brandner , Stavros Toumpis , Christian Bettstetter

The statistical analysis of the fading End to End channel gain of the amplify and forward relaying protocol, however, is well known as extremely complex, and research work to date have only studied the asymptotic behaviour of the outage…

Information Theory · Computer Science 2016-04-22 Quoc Tuan Nguyen , D. T. Nguyen , Cong Lam Sinh

In this paper, we introduce the Causal Cognitive Interference Channel With Delay (CC-IFC-WD) in which the cognitive user transmission can depend on $L$ future received symbols as well as the past ones. Taking the effect of the link delays…

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

In this correspondence the cumulants of the mutual information of the flat Rayleigh fading amplify-and-forward MIMO relay channel without direct link between source and destination are derived in the large array limit. The analysis is based…

Information Theory · Computer Science 2007-07-13 Joerg Wagner , Boris Rankov , Armin Wittneben

In this correspondence, we consider a half-duplex large relay network, which consists of one source-destination pair and $N$ relay nodes, each of which is connected with a subset of the other relays via signal-to-noise ratio (SNR)-limited…

Information Theory · Computer Science 2016-11-18 Chuan Huang , Jinhua Jiang , Shuguang Cui

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

A state-dependent relay channel is studied in which strictly causal channel state information is available at the relay and no state information is available at the source and destination. Source and relay are connected via two…

Information Theory · Computer Science 2015-03-18 Min Li , Osvaldo Simeone , Aylin Yener

This paper investigates the problem of information transmission over the simultaneous relay channel with two users (or two possible channel outcomes) where for one of them the more suitable strategy is Decode-and-Forward (DF) while for the…

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

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 paper studies the capacity of a class of discrete memoryless interference channels where interference is defined analogous to that of Gaussian interference channel with one-sided weak interference. The sum-rate capacity of this class…

Information Theory · Computer Science 2013-03-11 Fangfang Zhu , Biao Chen

Standard upper and lower bounds on the capacity of relay channels are cut-set (CS), decode-forward (DF), and quantize-forward (QF) rates. For real additive white Gaussian noise (AWGN) multicast relay channels with one source node and one…

Information Theory · Computer Science 2019-01-28 Mohit Thakur , Gerhard Kramer

In this letter, we consider the scenario of decode-and-forward relay network with reconfigurable intelligent surface (RIS)-assisted source and relays in the presence of interference. We derive approximate closed-form expression for the…

Information Theory · Computer Science 2021-01-08 Anas M. Salhab , Liang Yang

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

The sum-rate capacity of the parallel Gaussian interference channel is shown to be achieved by independent transmission across sub-channels and treating interference as noise in each sub-channel if the channel coefficients and power…

Information Theory · Computer Science 2009-03-04 Xiaohu Shang , Biao Chen , Gerhard Kramer , H. Vincent Poor

We investigate the transmission of a secret message from Alice to Bob in the presence of an eavesdropper (Eve) and many of decode-and-forward relay nodes. Each link comprises a set of parallel channels, modeling for example an orthogonal…

Information Theory · Computer Science 2018-07-18 Linda Senigagliesi , Marco Baldi , Stefano Tomasin