English
Related papers

Related papers: DMT of Multi-hop Cooperative Networks - Part II: H…

200 papers

We consider single-source single-sink (ss-ss) multi-hop networks, with slow-fading links and single-antenna half-duplex relays. We identify two families of networks that are multi-hop generalizations of the well-studied two-hop network:…

Information Theory · Computer Science 2008-02-14 K. Sreeram , S. Birenjith , P. Vijay Kumar

In this two-part paper, the DMT of cooperative multi-hop networks is examined. The focus is on single-source single-sink (ss-ss) multi-hop relay networks having slow-fading links and relays that potentially possess multiple antennas. The…

Information Theory · Computer Science 2008-08-05 K. Sreeram , S. Birenjith , P. Vijay Kumar

We consider a general multiple antenna network with multiple sources, multiple destinations and multiple relays in terms of the diversity-multiplexing tradeoff (DMT). We examine several subcases of this most general problem taking into…

Information Theory · Computer Science 2007-07-22 Melda Yuksel , Elza Erkip

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 "virtual" full-duplex relaying by means of half-duplex relays. In this configuration, each relay stage in a multi-hop relaying network is formed by at least two relays, used alternatively in transmit and receive modes, such that…

Information Theory · Computer Science 2013-11-26 Song-Nam Hong , Giuseppe Caire

This paper studies the setup of a multiple-relay network in which $K$ half-duplex multiple-antenna relays assist in the transmission between a/several multiple-antenna transmitter(s) and a multiple-antenna receiver. Each two nodes are…

Information Theory · Computer Science 2008-06-08 Shahab Oveis Gharan , Alireza Bayesteh , Amir K. Khandani

In this paper we present several strategies for multiple relay networks which are constrained by a half-duplex operation, i. e., each node either transmits or receives on a particular resource. Using the discrete memoryless multiple relay…

Information Theory · Computer Science 2007-12-24 P. Rost , G. Fettweis

We consider slow fading relay channels with a single multi-antenna source-destination terminal pair. The source signal arrives at the destination via N hops through N-1 layers of relays. We analyze the diversity of such channels with fixed…

Information Theory · Computer Science 2007-08-03 Sheng Yang , Jean-Claude Belfiore

Previous work on relay networks has concentrated primarily on the diversity benefits of such techniques. This paper explores the possibility of also obtaining multiplexing gain in a relay network, while retaining diversity gain.…

Information Theory · Computer Science 2007-09-29 Yijia , Fan , H. Vincent Poor , John S. Thompson

A multi-hop relay channel with multiple antenna terminals in a quasi-static slow fading environment is considered. For both full-duplex and half-duplex relays the fundamental diversity-multiplexing tradeoff (DMT) is analyzed. It is shown…

Information Theory · Computer Science 2016-11-18 Deniz Gunduz , Andrea Goldsmith , H. Vincent Poor

Wireless networks with multiple nodes that relay information from a source to a destination are expected to be deployed in many applications. Therefore, understanding their design and performance under practical constraints is important. In…

Information Theory · Computer Science 2010-01-22 Bama Muthuramalingam , Srikrishna Bhashyam , Andrew Thangaraj

Routing is a widespread approach to transfer information from a source node to a destination node in many deployed wireless ad-hoc networks. Today's implemented routing algorithms seek to efficiently find the path/route with the largest…

Information Theory · Computer Science 2018-10-16 Yahya H. Ezzeldin , Martina Cardone , Christina Fragouli , Daniela Tuninetti

In this work, we investigate the diversity-multiplexing tradeoff (DMT) of the multiple-antenna (MIMO) static half-duplex relay channel. A general expression is derived for the DMT upper bound, which can be achieved by a compress-and-forward…

Information Theory · Computer Science 2009-11-09 Olivier Leveque , Christophe Vignat , Melda Yuksel

A multi-hop two-way relay channel is considered in which all the terminals are equipped with multiple antennas. Assuming independent quasi-static Rayleigh fading channels and channel state information available at the receivers, we…

Information Theory · Computer Science 2008-12-19 Deniz Gunduz , Andrea Goldsmith , H. Vincent Poor

In this paper, a cooperative transmission design for a general multi-node half-duplex wireless relay network is presented. It is assumed that the nodes operate in half-duplex mode and that channel information is available at the nodes. The…

Information Theory · Computer Science 2009-11-17 Debdeep Chatterjee , Tan F. Wong , Tat M. Lok

We study in this paper a two-hop relaying network consisting of one source, one destination, and three amplify-and-forward (AF) relays operating in a half-duplex mode. In order to compensate for the inherent loss of capacity pre-log factor…

Information Theory · Computer Science 2012-07-17 Ki-Hong Park , Mohamed-Slim Alouini

Diversity-multiplexing trade-off has been studied extensively to quantify the benefits of different relaying strategies in terms of error and rate performance. However, even in the case of a single half-duplex relay, which seems fully…

Information Theory · Computer Science 2013-05-16 Ritesh Kolte , Ayfer Özgür

In this paper, we propose novel cooperative transmission protocols for delay limited coherent fading channels consisting of N (half-duplex and single-antenna) partners and one cell site. In our work, we differentiate between the relay,…

Information Theory · Computer Science 2007-07-16 Kambiz Azarian , Hesham El Gamal , Philip Schniter

Computing the cut-set bound in half-duplex relay networks is a challenging optimization problem, since it requires finding the cut-set optimal half-duplex schedule. This subproblem in general involves an exponential number of variables,…

Information Theory · Computer Science 2013-05-14 Raúl Etkin , Farzad Parvaresh , Ilan Shomorony , A. Salman Avestimehr

This paper considers an interference network composed of K half-duplex single-antenna pairs of users who wish to establish bi-directional communication with the aid of a multi-input-multi-output (MIMO) half-duplex relay node. This channel…

Information Theory · Computer Science 2009-01-20 Hassan Ghozlan , Yahya Mohasseb , Hesham El Gamal , Gerhard Kramer
‹ Prev 1 2 3 10 Next ›