English
Related papers

Related papers: Best Relay Selection in Gaussian Half-Duplex Diamo…

200 papers

In order to satisfy the delay requirements of telecommunication systems, in this paper, we present a cooperative network with the short packet transmission in the Rayleigh fading channel. The desired relay can be implemented as a two-way…

Information Theory · Computer Science 2022-02-08 Mohammad Lari , Zahra Keshavarz Gandomani

This paper considers the problem of selecting a subset of nodes in a two-hop wireless network to act as relays in aiding the communication between the source-destination pair. Optimal relay subset selection with the objective of maximizing…

Information Theory · Computer Science 2008-05-23 Caleb K. Lo , Sriram Vishwanath , Robert W. Heath

Two types of noise-free relay cascades are investigated. Networks where a source communicates with a distant receiver via a cascade of half-duplex constrained relays, and networks where not only the source but also a single relay node…

Information Theory · Computer Science 2016-11-15 Tobias Lutz , Christoph Hausl , Ralf Kötter

A class of diamond networks are studied where the broadcast component is modelled by two independent bit-pipes. New upper and low bounds are derived on the capacity which improve previous bounds. The upper bound is in the form of a max-min…

Information Theory · Computer Science 2014-01-24 Shirin Saeedi Bidokhti , Gerhard Kramer

A full-duplex wireless network with three users that want to establish full message-exchange via a relay is considered. Thus, the network known as the Y-channel has a total of 6 messages, 2 outgoing and 2 incoming at each user. The users…

Information Theory · Computer Science 2013-10-08 Anas Chaaban , Aydin Sezgin

We derive the capacity of the state-dependent half-duplex relay channel without source-destination link. The output of the state-dependent half-duplex relay channel depends on the randomly varying channel states of the source-relay and…

Information Theory · Computer Science 2014-02-25 Nikola Zlatanov , Robert Schober

In a wireless network with a single source and a single destination and an arbitrary number of relay nodes, what is the maximum rate of information flow achievable? We make progress on this long standing problem through a two-step approach.…

Information Theory · Computer Science 2016-11-18 Salman Avestimehr , Suhas Diggavi , David Tse

This paper studies the transceiver design of the Gaussian two-pair two-way relay channel (TWRC), where two pairs of users exchange information through a common relay in a pairwise manner. Our main contribution is to show that the capacity…

Information Theory · Computer Science 2018-06-01 Xiaojun Yuan , Haiyang Xin , Soung-Chang Liew , Yong Li

Although extensively investigated, the capacity of the two-hop half-duplex (HD) relay channel is not fully understood. In particular, a capacity expression which can be evaluated straightforwardly is not available and an explicit coding…

Information Theory · Computer Science 2015-10-13 Nikola Zlatanov , Vahid Jamali , Robert Schober

We consider the discrete memoryless symmetric primitive relay channel, where, a source $X$ wants to send information to a destination $Y$ with the help of a relay $Z$ and the relay can communicate to the destination via an error-free…

Information Theory · Computer Science 2016-03-31 Xiugang Wu , Ayfer Ozgur , Liang-Liang Xie

This paper studies the throughput maximization problem for a three-node relay channel with non-ideal circuit power. In particular, the relay operates in a half-duplex manner, and the decode-and-forward (DF) relaying scheme is adopted.…

Information Theory · Computer Science 2017-06-20 Hengjing Liang , Chuan Huang , Zhi Chen , Shaoqian Li

Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We introduce an alternative perspective, where the objective is maximizing coverage for a given…

Information Theory · Computer Science 2017-08-04 Vaneet Aggarwal , Amir Bennatan , A. Robert Calderbank

This paper investigates the capacity of a wireless two way relay channel in which two end nodes exchange information via a relay node. The capacity is defined in the information-theoretic sense as the maximum information exchange rate…

Information Theory · Computer Science 2008-04-22 Zhang Shengli , Soung Chang Liew

In this paper, we study the interference relay-without-delay channel which is an interference channel with a relay helping the communication. We assume the relay's transmit symbol depends not only on its past received symbols but also on…

Information Theory · Computer Science 2011-08-16 Hyunseok Chang , Sae-Young Chung

Although extensively investigated, the capacity of the two-hop half-duplex (HD) relay channel is not fully understood. In particular, a capacity expression which can be easily evaluated is not available and an explicit coding scheme which…

Information Theory · Computer Science 2015-11-18 Nikola Zlatanov , Vahid Jamali , Derrick Wing Kwan Ng , Robert

A class of diamond networks is studied where the broadcast component is orthogonal and modeled by two independent bit-pipes. New upper and lower bounds on the capacity are derived. The proof technique for the upper bound generalizes…

Information Theory · Computer Science 2015-10-06 Shirin Saeedi Bidokhti , Gerhard Kramer

We consider a three-terminal state-dependent relay channel with the channel state noncausally available at only the relay. Such a model may be useful for designing cooperative wireless networks with some terminals equipped with cognition…

Information Theory · Computer Science 2009-11-25 Abdellatif Zaidi , Shiva Prasad Kotagiri , J. Nicholas Laneman , Luc Vandendorpe

Capacity bounds are studied for the multiple-antenna complex Gaussian relay channel with t1 transmitting antennas at the sender, r2 receiving and t2 transmitting antennas at the relay, and r3 receiving antennas at the receiver. It is shown…

Information Theory · Computer Science 2016-11-18 Xianglan Jin , Young-Han Kim

Unicast communication over a network of $M$-parallel relays in the presence of an eavesdropper is considered. The relay nodes, operating under individual power constraints, amplify and forward the signals received at their inputs. The…

Information Theory · Computer Science 2015-04-21 Siddhartha Sarma , Samar Agnihotri , Joy Kuri

Relay networks having $n$ source-to-destination pairs and $m$ half-duplex relays, all operating in the same frequency band in the presence of block fading, are analyzed. This setup has attracted significant attention and several relaying…

Information Theory · Computer Science 2016-11-15 Shengshan Cui , Alexander M. Haimovich , Oren Somekh , H. Vincent Poor