English
Related papers

Related papers: Achievable Rates for Gaussian Degraded Relay Chann…

200 papers

We study the best exponential decay in the blocklength of the probability of error that can be achieved in the transmission of a single bit over the Gaussian channel with an active noisy Gaussian feedback link. We impose an \emph{expected}…

Information Theory · Computer Science 2009-09-24 Young-Han Kim , Amos Lapidoth , Tsachy Weissman

We consider systems in which the transmitter conveys messages to the receiver through a capacity-limited relay station. The channel between the transmitter and the relay-station is assumed to be a frequency selective additive Gaussian noise…

Information Theory · Computer Science 2018-01-08 Adi Homri , Michael Peleg , Shlomo Shamai

We analyze the achievable rate of the superposition of block Markov encoding (decode-and-forward) and side information encoding (compress-and-forward) for the three-node Gaussian relay channel. It is generally believed that the…

Information Theory · Computer Science 2010-10-18 Neevan Ramalingam , Zhengdao Wang

Lossy transmission over a relay channel in which the relay has access to correlated side information is considered. First, a joint source-channel decode-and-forward scheme is proposed for general discrete memoryless sources and channels.…

Information Theory · Computer Science 2016-11-17 Deniz Gunduz , Elza Erkip , Andrea J. Goldsmith , H. Vincent Poor

The two-user Gaussian interference channel with a shared out-of-band relay is considered. The relay observes a linear combination of the source signals and broadcasts a common message to the two destinations, through a perfect link of fixed…

Information Theory · Computer Science 2016-11-18 Peyman Razaghi , Song Nam Hong. Lei Zhou , Wei Yu , Giuseppe Caire

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

Bounds on the reliability function for the discrete memoryless relay channel are derived using the method of types. Two achievable error exponents are derived based on partial decode-forward and compress-forward which are well-known…

Information Theory · Computer Science 2016-11-17 Vincent Y. F. Tan

Consider a Gaussian relay network where a source node communicates to a destination node with the help of several layers of relays. Recent work has shown that compress-and-forward based strategies can achieve the capacity of this network…

Information Theory · Computer Science 2015-07-16 Ritesh Kolte , Ayfer Özgür , Abbas El Gamal

The multicast capacity of the Gaussian two-hop relay network with one source, $N$ relays, and $L$ destinations is studied. It is shown that a careful modification of the partial decode--forward coding scheme, whereby the relays cooperate…

Information Theory · Computer Science 2015-08-04 Jing Li , Young-Han Kim

This work concerns minimizing the achievable distortion of a Gaussian source over a two-hop block fading channel under mean square-error criterion. It is assumed that there is not a direct link between transmission ends and the…

Information Theory · Computer Science 2016-05-31 Sayed Ali Khodam Hoseini , Soroush Akhlaghi , Mina Baghani

This paper studies Gaussian Two-Way Relay Channel where two communication nodes exchange messages with each other via a relay. It is assumed that all nodes operate in half duplex mode without any direct link between the communication nodes.…

Information Theory · Computer Science 2016-11-17 Sinda Smirani , Mohamed Kamoun , Mireille Sarkiss , Abdellatif Zaidi , Pierre Duhamel

In this paper, we consider full-duplex and half-duplex Gaussian relay channels where the noises at the relay and destination are arbitrarily correlated. We first derive the capacity upper bound and the achievable rates with three existing…

Information Theory · Computer Science 2016-11-17 Lili Zhang , Jinhua Jiang , Andrea J. Goldsmith , Shuguang Cui

We present an achievable rate for general Gaussian relay networks. We show that the achievable rate is within a constant number of bits from the information-theoretic cut-set upper bound on the capacity of these networks. This constant…

Information Theory · Computer Science 2016-11-17 Amir Salman Avestimehr , Suhas N. Diggavi , David N C. Tse

We analyze coding for energy efficiency in relay channels at a fixed source rate. We first propose a half-duplex decode-forward coding scheme for the Gaussian relay channel. We then derive three optimal sets of power allocation, which…

Information Theory · Computer Science 2016-11-18 Fanny Parzysz , Mai Vu , François Gagnon

This paper considers the achievability and converse bounds on the maximal channel coding rate at a given blocklength and error probability over AWGN channels. The problem stems from covert communication with Gaussian codewords. By…

Information Theory · Computer Science 2021-01-01 Xinchun Yu , Shuangqin Wei , Yuan Luo

In this paper, we derive UWB version of (i) general best achievable rate for the relay channel with decode-andforward strategy and (ii) max-flow min-cut upper bound, such that the UWB relay channel can be studied considering the obtained…

Information Theory · Computer Science 2011-09-15 Maryam Faramarzi Yazd , Ghosheh Abed Hodtani

We consider a half-duplex diamond relay channel, which consists of one source-destination pair and two relay nodes connected with two-way rate-limited out-of-band conferencing links. Three basic schemes and their achievable rates are…

Information Theory · Computer Science 2015-03-17 Chuan Huang , Jinhua Jiang , Shuguang Cui

This paper studies incremental relay strategies for a two-user Gaussian relay-interference channel with an in-band-reception and out-of-band-transmission relay, where the link between the relay and the two receivers is modelled as a…

Information Theory · Computer Science 2012-12-13 Lei Zhou , Wei Yu

We investigate the achievable error probability in communication over an AWGN discrete time memoryless channel with noiseless delay-less rate-limited feedback. For the case where the feedback rate R_FB is lower than the data rate R…

Information Theory · Computer Science 2012-04-24 Reza Mirghaderi , Andrea Goldsmith , Tsachy Weissman

A discrete memoryless half-duplex relay channel is constructed from a broadcast channel from the source to the relay and destination and a multiple access channel from the source and relay to the destination. When the relay listens, the…

Information Theory · Computer Science 2007-08-17 Saravanan Vijayakumaran , Tan F. Wong , Tat M. Lok
‹ Prev 1 2 3 10 Next ›