English
Related papers

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

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

In this paper, we present nontrivial upper and lower bounds on the secrecy capacity of the degraded Gaussian diamond-wiretap channel and identify several ranges of channel parameters where these bounds coincide with useful intuitions.…

Information Theory · Computer Science 2015-04-23 Si-Hyeon Lee , Ashish Khisti

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

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 paper we investigate the optimal latency of communications. Focusing on fixed rate communication without any feedback channel, this paper encompasses low-latency strategies with which one hop and multi-hop communication issues are…

Information Theory · Computer Science 2017-01-05 Minh Au , Francois Gagnon

In this paper, we consider the design of a new secrecy transmission scheme for a four-node relay-eavesdropper channel. The key idea of the proposed scheme is to combine noisy network coding with the interference assisted strategy for…

Information Theory · Computer Science 2012-08-27 Peng Xu , Zhiguo Ding , and Xuchu Dai , Kin Leung

We consider a secure communication scenario through the two-user Gaussian interference channel: each transmitter (user) has a confidential message to send reliably to its intended receiver while keeping it secret from the other receiver.…

Information Theory · Computer Science 2016-04-26 Parisa Babaheidarian , Somayeh Salimi , Panos Papadimitratos

We investigate Gaussian widely linear precoding known as improper Gaussian signaling for the cellular uplink with inter-cell interference, known as interference multiple access channel (IMAC). This transmission scheme provides extra degrees…

Information Theory · Computer Science 2018-05-31 Ali Kariminezhad , Stefan Roth , Aydin Sezgin , Anas Chaaban

This paper considers the cognitive interference channel (CIC) with two transmitters and two receivers, in which the cognitive transmitter non-causally knows the message and codeword of the primary transmitter. We first introduce a discrete…

Information Theory · Computer Science 2011-02-08 Mojtaba Vaezi , Mai Vu

We consider symmetric two-user Gaussian interference channel with common messages. We derive an upper bound on the sum capacity, and show that the upper bound is tight in the low interference regime, where the optimal transmission scheme is…

Information Theory · Computer Science 2014-01-22 Quan Geng , Tie Liu

We investigate the effects of an additional relay node on the secrecy of broadcast channels by considering the model of relay broadcast channels with confidential messages. We show that this additional relay node can increase the achievable…

Information Theory · Computer Science 2015-12-09 Bin Dai , Linman Yu , Zheng Ma

In this paper, we revisit the problem of finding the average capacity of the Gaussian feedback channel. First, we consider the problem of finding the average capacity of the analog Gaussian noise channel where the noise has an arbitrary…

Information Theory · Computer Science 2019-01-24 Ather Gattami

We consider the wireless Rayleigh fading relay channel with finite complex input constellations. Assuming global knowledge of the channel state information and perfect synchronization, upper and lower bounds on the achievable rate, for the…

Information Theory · Computer Science 2011-02-22 Vijayvaradharaj T Muralidharan , B. Sundar Rajan

In this paper, we study the performance, in terms of the asymptotic error probability, of a user which communicates with a destination with the aid of a full-duplex in-band relay. We consider that the network is interference-limited, and…

Information Theory · Computer Science 2014-05-16 Andres Altieri , Leonardo Rey Vega , Pablo Piantanida , Cecilia G. Galarza

The relay channel with unreliable helper is introduced and studied. The model is that of a classical relay channel where the input from the relay to the channel has an extra primitive link whose presence is not assured a priori. The extra…

Information Theory · Computer Science 2024-01-18 Yossef Steinberg

This paper studies an untrusted relay channel, in which the destination sends artificial noise simultaneously with the source sending a message to the relay, in order to protect the source's confidential message. The traditional…

Information Theory · Computer Science 2015-04-01 Shengli Zhang , Lisheng Fan , Mugen Peng , H. Vincent Poor

To understand the network response to large-scale physical attacks, we investigate the asymptotic capacity of a half-duplex fading relay network with random node failures when the number of relays $N$ is infinitely large. In this paper, a…

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

The relay channel, consisting of a source-destination pair and a relay, is a fundamental component of cooperative communications. While the capacity of a general relay channel remains unknown, various relaying strategies, including…

Information Theory · Computer Science 2024-04-24 Ezgi Ozyilkan , Fabrizio Carpi , Siddharth Garg , Elza Erkip

We study parallel symmetric 2-user interference channels when the interference is bursty and feedback is available from the respective receivers. Presence of interference in each subcarrier is modeled as a memoryless Bernoulli random state.…

Information Theory · Computer Science 2014-04-25 Shaunak Mishra , I-Hsiang Wang , Suhas Diggavi

In this paper, we show that the capacity of the three-node Gaussian relay channel can be achieved to within 1 and 2 bit/sec/Hz using compress-and-forward and amplify-and-forward relaying, respectively.

Information Theory · Computer Science 2010-11-24 Woohyuk Chang , Sae-Young Chung , Yong H. Lee