English
Related papers

Related papers: Structured interference-mitigation in two-hop netw…

200 papers

We study the problem of communication over an additive white Gaussian noise (AWGN) channel with an AWGN feedback channel. When the feedback channel is noiseless, the classic Schalkwijk-Kailath (S-K) scheme is known to achieve capacity in a…

Information Theory · Computer Science 2017-01-04 Assaf Ben-Yishai , Ofer Shayevitz

We consider the two-hop interference channel (IC) with constant real channel coefficients, which consists of two source-destination pairs, separated by two relays. We analyze the achievable degrees of freedom (DoF) of such network when…

Information Theory · Computer Science 2013-05-20 Ibrahim Issa , Silas L. Fong , A. Salman Avestimehr

Multi-hop relay channels use multiple relay stages, each with multiple relay nodes, to facilitate communication between a source and destination. Previously, distributed space-time coding was used to maximize diversity gain. Assuming a…

Information Theory · Computer Science 2008-05-22 Rahul Vaze , Robert W. Heath

A fundamental problem in coding theory is the design of an efficient coding scheme that achieves the capacity of the additive white Gaussian (AWGN) channel. The main objective of this short note is to point out that by concatenating a…

Information Theory · Computer Science 2016-08-24 Shashank Vatedka , Navin Kashyap

We study the joint source channel coding problem of transmitting an analog source over a Gaussian channel in two cases - (i) the presence of interference known only to the transmitter and (ii) in the presence of side information known only…

Information Theory · Computer Science 2016-09-08 Makesh Pravin Wilson , Krishna Narayanan , Giuseppe Caire

In this work, the problem of transmitting an i.i.d Gaussian source over an i.i.d Gaussian wiretap channel with an i.i.d Gaussian side information is considered. The intended receiver is assumed to have a certain minimum SNR and the…

Information Theory · Computer Science 2010-08-03 Ghadamali Bagherikaram , Konstantinos N. Plataniotis

Aligned-Images Sumset Inequalities are used in this work to study the Generalized Degrees of Freedom (GDoF) of the symmetric layered multi-hop interference channel under the robust assumption that the channel state information at the…

Information Theory · Computer Science 2021-03-16 Junge Wang , Syed Ali Jafar

This paper studies the relaying strategies and the approximate capacity of the classic three-node Gaussian relay channel, but where the noises at the relay and at the destination are correlated. It is shown that the capacity of such a relay…

Information Theory · Computer Science 2011-10-25 Lei Zhou , Wei Yu

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

A standard assumption in the design of ultra-reliable low-latency communication systems is that the duration between message arrivals is larger than the number of channel uses before the decoding deadline. Nevertheless, this assumption…

Information Theory · Computer Science 2025-01-31 Homa Nikbakht , Malcolm Egan , Jean-Marie Gorce , H. Vincent Poor

The two user Gaussian interference channel with a full-duplex relay is studied. By using genie aided approaches, two new upper bounds on the achievable sum-rate in this setup are derived. These upper bounds are shown to be tighter than…

Information Theory · Computer Science 2010-08-16 Anas Chaaban , Aydin Sezgin

We study the secure degrees of freedom (d.o.f.) of one-hop wireless networks by considering four fundamental Gaussian network structures: wiretap channel, broadcast channel with confidential messages, interference channel with confidential…

Information Theory · Computer Science 2016-11-17 Jianwei Xie , Sennur Ulukus

This paper studies second-order coding rates for memoryless channels with a state sequence known non-causally at the encoder. In the case of finite alphabets, an achievability result is obtained using constant-composition random coding, and…

Information Theory · Computer Science 2013-11-13 Jonathan Scarlett

A new coding scheme for general N-node relay networks is presented for unicast, multicast, and broadcast. The proposed distributed decode-forward scheme combines and generalizes Marton coding for single-hop broadcast channels and the…

Information Theory · Computer Science 2017-01-12 Sung Hoon Lim , Kwang Taik Kim , Young-Han Kim

This paper considers a random access system where each sender can be in two modes of operation, active or not active, and where the set of active users is available to a common receiver only. Active transmitters encode data into independent…

Information Theory · Computer Science 2016-11-18 Paolo Minero , Massimo Franceschetti , David N. C. Tse

In this paper, we study the state-dependent two-user interference channel, where the state information is non-causally known at both transmitters but unknown to either of the receivers. We propose two coding schemes for the discrete…

Information Theory · Computer Science 2010-06-29 Lili Zhang , Jinhua Jiang , Shuguang Cui

In this work, we consider achievable secrecy rates for symmetric $K$-user ($K \ge 3$) interference channels with confidential messages. We find that nested lattice codes and layered coding are useful in providing secrecy for these channels.…

Information Theory · Computer Science 2016-11-17 Xiang He , Aylin Yener

This paper studies the effectiveness of relaying for interference mitigation in an interference-limited communication scenario. We are motivated by the observation that in a cellular network, a relay node placed at the cell edge observes a…

Information Theory · Computer Science 2019-03-20 S. Arvin Ayoughi , Wei Yu

Zero-delay transmission of a Gaussian source over an additive white Gaussian noise (AWGN) channel is considered in the presence of an additive Gaussian interference signal. The mean squared error (MSE) distortion is minimized under an…

Information Theory · Computer Science 2016-04-15 Morteza Varasteh , Deniz Gündüz , Ertem Tuncel

We revisit the recent secure degrees of freedom (s.d.o.f.) results for one-hop multi-user wireless networks by considering three fundamental wireless network structures: Gaussian wiretap channel with helpers, Gaussian multiple access…

Information Theory · Computer Science 2015-07-09 Jianwei Xie , Sennur Ulukus
‹ Prev 1 4 5 6 7 8 10 Next ›