English
Related papers

Related papers: D-MG Tradeoff and Optimal Codes for a Class of AF …

200 papers

The diversity multiplexing tradeoff of a general two-hop asynchronous cooperative network is examined for various relaying protocols such as non-orthogonal selection decode-and-forward (NSDF), orthogonal selection decode-and-forward (OSDF),…

Information Theory · Computer Science 2011-02-21 Mehdi Torbatian , Mohamed Oussama Damen

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

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

The Dynamic Decode-and-Forward (DDF) protocol and the Hybrid DDF and Amplified-and-Forward (HDAF) protocol for the multiple-access relay channel (MARC) with quasi static fading are evaluated using the Zheng-Tse diversity-multiplexing…

Information Theory · Computer Science 2011-03-22 Chung-Pi Lee , Hsuan-Jung Su

In this work, we extend the non-orthogonal amplify-and-forward (NAF) cooperative diversity scheme to the MIMO channel. A family of space-time block codes for a half-duplex MIMO NAF fading cooperative channel with N relays is constructed.…

Information Theory · Computer Science 2007-07-16 Sheng Yang , Jean-Claude Belfiore

The performance of the automatic repeat request-dynamic decode and forward (ARQ-DDF) cooperation protocol is analyzed in two distinct scenarios. The first scenario is the multiple access relay (MAR) channel where a single relay is dedicated…

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

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

In this paper, we propose to implement the dynamic decode-and-forward (DDF) protocol with distributed rotations. In addition to being the first minimum-delay implementation of the DDF protocol proposed for any number of relays, this…

Information Theory · Computer Science 2011-02-22 Charlotte Hucher , Parastoo Sadeghi

We study the diversity-multiplexing tradeoff (DMT) for the slow fading interference channel with a relay (ICR). We derive four inner bounds on the DMT region: the first is based on the compress-and-forward (CF) relaying scheme, the second…

Information Theory · Computer Science 2014-12-16 Daniel Zahavi , Lili Zhang , Ivana Maric , Ron Dabora , Andrea J. Goldsmith , Shuguang Cui

The assumption of nodes in a cooperative communication relay network operating in synchronous fashion is often unrealistic. In the present paper, we consider two different models of asynchronous operation in cooperative-diversity networks…

Information Theory · Computer Science 2008-07-02 R. N. Krishnakumar , N. Naveen , P. Vijay Kumar

This paper develops a diversity-multiplexing tradeoff (DMT) over a bidirectional random relay set in a wireless network where the distribution of all nodes is a stationary Poisson point process. This is a nontrivial extension of the DMT…

Information Theory · Computer Science 2009-09-25 Chun-Hung Liu , Jeffery G. Andrews

The diversity-multiplexing tradeoff (DMT) provides a fundamental performance metric for different multiple-input multiple-output (MIMO) schemes in wireless communications. In this paper, we explore the block fading optical wireless…

Information Theory · Computer Science 2021-12-10 Sufang Yang , Longguang Li , Haoyue Tang , Jintao Wang

The diversity-multiplexing tradeoff of the dynamic decode-and-forward protocol is characterized for the half-duplex three-terminal (m,k,n)-relay channel where the source, relay and the destination terminals have m, k and n antennas,…

Information Theory · Computer Science 2010-08-10 Sanjay Karmakar , Mahesh K. Varanasi

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

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

In this work, we explore the introduction of distributed space-time codes in decode-and-forward (DF) protocols. A first protocol named the Asymmetric DF is presented. It is based on two phases of different lengths, defined so that signals…

Information Theory · Computer Science 2008-11-05 Charlotte Hucher , Ghaya Rekaya-Ben Othman , Ahmed Saadani

This is the second part of a two-part series of papers. In this paper, for the generalized non-orthogonal amplify and forward (GNAF) protocol presented in Part-I, a construction of a new family of distributed space-time codes based on…

Information Theory · Computer Science 2007-07-16 G. Susinder Rajan , B. Sundar Rajan

We study the Dynamic Decode and Forward (DDF) protocol for a single half-duplex relay, single-antenna channel with quasi-static fading. The DDF protocol is well-known and has been analyzed in terms of the Diversity-Multiplexing Tradeoff…

Information Theory · Computer Science 2008-01-18 K. Raj Kumar , Giuseppe Caire

Synchronization of relay nodes is an important and critical issue in exploiting cooperative diversity in wireless networks. In this paper, two asynchronous cooperative diversity schemes are proposed, namely, distributed delay diversity and…

Information Theory · Computer Science 2007-08-10 Shuangqing Wei

In a slow fading channel, how to find a cooperative diversity scheme that achieves the transmit diversity bound is still an open problem. In fact, all previously proposed amplify-and-forward (AF) and decode-and-forward (DF) schemes do not…

Information Theory · Computer Science 2007-07-16 Sheng Yang , Jean-Claude Belfiore
‹ Prev 1 2 3 10 Next ›