English
Related papers

Related papers: An Achievability Result for the General Relay Chan…

200 papers

In this work we focus on the general relay channel. We investigate the application of estimate-and-forward (EAF) to different scenarios. Specifically, we consider assignments of the auxiliary random variables that always satisfy the…

Information Theory · Computer Science 2007-07-13 R. Dabora , S. D. Servetto

Consider the \emph{simultaneous relay channel} (SRC) which consists of a set of relay channels where the source wishes to transmit common and private information to each of the destinations. This problem is recognized as being equivalent to…

Information Theory · Computer Science 2015-03-19 Arash Behboodi , Pablo Piantanida

Previous work on cooperative communications has concentrated primarily on the diversity benefits of such techniques. This paper, instead, considers the multiplexing benefits of cooperative communications. First, a new interpretation on the…

Information Theory · Computer Science 2009-03-16 Yijia , Fan , Chao Wang , H. Vincent Poor , John S. Thompson

Achievable rate regions for cooperative relay broadcast channels with rate-limited feedback are proposed. Specifically, we consider two-receiver memoryless broadcast channels where each receiver sends feedback signals to the transmitter…

Information Theory · Computer Science 2016-05-09 Youlong Wu

The capacity regions are investigated for two relay broadcast channels (RBCs), where relay links are incorporated into standard two-user broadcast channels to support user cooperation. In the first channel, the Partially Cooperative Relay…

Information Theory · Computer Science 2007-07-13 Yingbin Liang , Venugopal V. Veeravalli

We consider the problem of communicating over a channel for which no mathematical model is specified, and the achievable rates are determined as a function of the channel input and output sequences known a-posteriori, without assuming any…

Information Theory · Computer Science 2012-03-08 Yuval Lomnitz , Meir Feder

We consider a relay network with two relays and two feedback links from the relays to the sender. To obtain the achievability results, we use the compress-and-forward and the decode-and-forward strategies to superimpose facility and…

Information Theory · Computer Science 2011-11-11 Mohammad Ali Tebbi , Mahtab Mirmohseni , Mahmoud Ahmadian Attari , Mohammad Reza Aref

Spectral and energy efficiency in 3-way relay channels are studied in this paper. First, achievable sum rate expressions for 3-way relay channels are derived for different relaying protocols. Moreover, an outer bound for the capacity of the…

Information Theory · Computer Science 2015-04-14 Bho Matthiesen , Alessio Zappone , Eduard A. Jorswieck

Explicit codes are constructed that achieve the diversity-multiplexing gain tradeoff of the cooperative-relay channel under the dynamic decode-and-forward protocol for any network size and for all numbers of transmit and receive antennas at…

Information Theory · Computer Science 2007-07-13 Petros Elia , P. Vijay Kumar

We consider the problem of communicating over a channel for which no mathematical model is specified. We present achievable rates as a function of the channel input and output sequences known a-posteriori for discrete and continuous…

Information Theory · Computer Science 2009-08-20 Yuval Lomnitz , Meir Feder

Motivated by fading channels and erasure channels, the problem of reliable communication over deterministic relay networks is studied, in which relay nodes receive a function of the incoming signals and a random network state. An achievable…

Information Theory · Computer Science 2016-11-17 Sung Hoon Lim , Young-Han Kim , Sae-Young Chung

This paper provides a review of recent advances in multi-user cooperative data transmission. The focus is on the inherent trade-off between achievable throughput and reliability of cooperative transmission. Research has shown that under a…

Information Theory · Computer Science 2013-07-29 Weisi Guo , Siyi Wang , Xiaoli Chu

This paper presents generalized channel coding theorems for a time-slotted distributed communication system where a transmitter-receiver pair is communicating in parallel with other transmitters. Assume that the channel code of each…

Information Theory · Computer Science 2016-11-15 Jie Luo

The capacity of a class of multi-way relay channels, where L users communicate via a relay (at possibly different rates), is derived for the case where the channel outputs are modular sums of the channel inputs and the receiver noise. The…

Information Theory · Computer Science 2011-11-16 Lawrence Ong , Sarah J. Johnson , Christopher M. Kellett

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

This paper proposes a new cooperative protocol which involves cooperation between primary and secondary users. We consider a cognitive setting with one primary user and multiple secondary users. The time resource is partitioned into…

Networking and Internet Architecture · Computer Science 2014-07-03 Ahmed El Shafie , Tamer Khattab

This paper describes an approach for half-duplex cooperative transmission in a classical three-node relay channel. Assuming availability of channel state information at nodes, the approach makes use of this information to optimize distinct…

Information Theory · Computer Science 2011-11-09 Tan F. Wong , Tat M. Lok , John M. Shea

Cooperation between terminals has been proposed to improve the reliability and throughput of wireless communication. While recent work has shown that relay cooperation provides increased diversity, increased multiplexing gain over that…

Information Theory · Computer Science 2009-09-10 Vinayak Nagpal , Sameer Pawar , David Tse , Borivoje Nikolic

We consider the problem of communicating over a channel for which no mathematical model is specified. We present achievable rates as a function of the channel input and output known a-posteriori for discrete and continuous channels, as well…

Information Theory · Computer Science 2012-02-03 Yuval Lomnitz , Meir Feder

We investigate the relay selection problem for a decode and forward collaborative network. Users are able to collaborate; decode messages of each other, re-encode and forward along with their own messages. We study the performance obtained…

Information Theory · Computer Science 2009-09-29 Saeed Akhavan Astaneh , Saeed Gazor
‹ Prev 1 2 3 10 Next ›