English
Related papers

Related papers: Using Distributed Rotations for a Low-Complexity D…

200 papers

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

A limited feedback based dynamic resource allocation algorithm is proposed for a relay cooperative network with Orthogonal Frequency Division Multiplexing (OFDM) modulation. A communication model where one source node communicates with one…

Signal Processing · Electrical Eng. & Systems 2020-03-13 Yong Liu , Wen Chen

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

In this letter, we propose a joint resource allocation algorithm for an OFDM-based multi-user system assisted by an improved Decode-and-Forward (DF) relay. We aim at maximizing the sum rate of the system by jointly optimizing subcarrier…

Signal Processing · Electrical Eng. & Systems 2020-03-13 Yong Liu , Wen Chen

In this paper, we study a routing problem on the Gaussian multiple relay channel, in which nodes employ a decode-and-forward coding strategy. We are interested in routes for the information flow through the relays that achieve the highest…

Information Theory · Computer Science 2010-04-15 Lawrence Ong , Mehul Motani

In this paper, relay selection is considered to enhance security of a cooperative system with multiple threshold-selection decode-and-forward (DF) relays. Threshold-selection DF relays are the relays in which a predefined signal-to-noise…

Signal Processing · Electrical Eng. & Systems 2018-03-05 C. Kundu , T. M. N. Ngatched , O. A. Dobre

In this paper, a superposition-coded concurrent decode-and-forward (DF) relaying protocol is presented. A specific scenario, where the inter-relay channel is sufficiently strong, is considered. Assuming perfect source-relay transmissions,…

Information Theory · Computer Science 2009-09-29 Chao Wang , Yijia Fan , Ioannis Krikidis , John S. Thompson , H. Vincent Poor

Opportunistic analysis has traditionally relied on independence assumptions that break down in many interesting and useful network topologies. This paper develops techniques that expand opportunistic analysis to a broader class of networks,…

Information Theory · Computer Science 2015-03-19 Mohamed Abouelseoud , Aria Nosratinia

Differential distributed space-time coding (D-DSTC) has been considered to improve both diversity and data-rate in cooperative communications in the absence of channel information. However, conventionally, it is assumed that relays are…

Information Theory · Computer Science 2016-11-17 M. R. Avendi , Sina Poorkasmaei , Hamid Jafarkhani

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

In this paper, a symbol-level selective transmission for virtual full-duplex (FD) relaying networks is proposed, which aims to mitigate error propagation effects and improve system spectral efficiency. The idea is to allow two half-duplex…

Information Theory · Computer Science 2017-11-03 Jiancao Hou , Sandeep Narayanan , Na Yi , Yi Ma , Mohammad Shikh-Bahaei

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

We analyze fading relay networks, where a single-antenna source-destination terminal pair communicates through a set of half-duplex single-antenna relays using a two-hop protocol with linear processing at the relay level. A family of…

Information Theory · Computer Science 2016-08-14 Cemal Akçaba , Patrick Kuppinger , Helmut Bölcskei

We study a simple question: when are dynamic relaying strategies essential in optimizing the diversity-multiplexing tradeoff (DMT) in half-duplex wireless relay networks? This is motivated by apparently two contrasting results even for a…

Information Theory · Computer Science 2016-11-18 Ritesh Kolte , Ayfer Özgür , Suhas Diggavi

In this paper, we examine the performance of the decode-and-forward (DF) relaying protocols with finite blocklength (FB). We provide the overall outage probability of three distinct DF relaying protocols, where the channels are assumed to…

Information Theory · Computer Science 2017-06-22 Parisa Nouri , Hirley Alves , Matti Latva-aho

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

In this paper, an incremental selective decode-and-forward (ISDF) relay strategy is proposed for power line communication (PLC) systems to improve the spectral efficiency. Traditional decode-and-forward (DF) relaying employs two time slots…

Signal Processing · Electrical Eng. & Systems 2018-03-05 A. Dubey , C. Kundu , T. M. N. Ngatched , O. A. Dobre , R. K. Mallik

In this paper, a distributed turbo-like coding scheme for wireless networks with relays is proposed. We consider a scenario where multiple sources communicate with a single destination with the help of a relay. The proposed scheme can be…

Information Theory · Computer Science 2009-10-13 Roua Youssef , Alexandre Graell i Amat

In this work, we investigate a multi-source multi-cast network with the aid of an arbitrary number of relays, where it is assumed that no direct link is available at each S-D pair. The aim is to find the fundamental limit on the maximal…

Information Theory · Computer Science 2014-06-05 Z. Chen , P. Fan , K. B. Letaief

This paper analyses the data rate achieved by various relay selection schemes in a single-user multi-hop relay network with decode-and-forward (DF) relaying. While the single-user relay selection problem is well studied in the literature,…

Information Theory · Computer Science 2023-08-17 Shalanika Dayarathna , Rajitha Senanayake , Jamie Evans