English
Related papers

Related papers: The Filtered Gaussian Primitive Diamond Channel

200 papers

In this paper, we present a new cooperative communication scheme consisting of two users in half-duplex mode communicating with one destination over a discrete memoryless channel. The users encode messages in independent blocks and divide…

Information Theory · Computer Science 2011-06-03 Ahmad Abu Al Haija , Mai Vu

This study investigates the problem of communication for a network composed of two half-duplex parallel relays with additive white Gaussian noise. Two protocols, i.e., \emph{Simultaneous} and \emph{Successive} relaying, associated with two…

Information Theory · Computer Science 2016-11-17 Seyed Saeed Changiz Rezaei , Shahab Oveis Gharan , Amir K. Khandani

In this paper, the filter-and-forward (FF) relay design for orthogonal frequency-division multiplexing (OFDM) transmission systems is considered to improve the system performance over simple amplify-and-forward (AF) relaying. Unlike…

Information Theory · Computer Science 2015-03-20 Donggun Kim , Junyeong Seo , Youngchul Sung

This work concerns minimizing the achievable distortion of a Gaussian source over a two-hop block fading channel under mean square-error criterion. It is assumed that there is not a direct link between transmission ends and the…

Information Theory · Computer Science 2016-05-31 Sayed Ali Khodam Hoseini , Soroush Akhlaghi , Mina Baghani

We analyze the achievable rate of the superposition of block Markov encoding (decode-and-forward) and side information encoding (compress-and-forward) for the three-node Gaussian relay channel. It is generally believed that the…

Information Theory · Computer Science 2010-10-18 Neevan Ramalingam , Zhengdao Wang

The L-user additive white Gaussian noise multiway relay channel is investigated, where L users exchange information at the same rate through a single relay. A new achievable rate region, based on the functional-decode-forward coding…

Information Theory · Computer Science 2012-09-10 Lawrence Ong , Christopher M. Kellett , Sarah J. Johnson

In this paper, transmission over time-selective, flat fading relay channels is studied. It is assumed that channel fading coefficients are not known a priori. Transmission takes place in two phases: network training phase and data…

Information Theory · Computer Science 2008-12-09 Sami Akin , Mustafa Cenk Gursoy

This paper considers a general Gaussian relay network where a source transmits a message to a destination with the help of N half-duplex relays. It proves that the information theoretic cut-set upper bound to the capacity can be achieved to…

Information Theory · Computer Science 2016-11-15 Martina Cardone , Daniela Tuninetti , Raymond Knopp , Umer Salim

We consider the Gaussian N-relay diamond network, where a source wants to communicate to a destination node through a layer of N-relay nodes. We investigate the following question: what fraction of the capacity can we maintain by using only…

Information Theory · Computer Science 2012-11-16 Caner Nazaroglu , Ayfer Ozgur , Christina Fragouli

We consider a diamond-shaped dual-hop communication system consisting a source, two parallel half-duplex relays and a destination. In a single antenna configuration, it has been previously shown that a two-phase node-scheduling algorithm,…

Information Theory · Computer Science 2008-05-20 Hossein Bagheri , Abolfazl S. Motahari , Amir K. Khandani

Communication networks are often designed and analyzed assuming tight synchronization among nodes. However, in applications that require communication in the energy-efficient regime of low signal-to-noise ratios, establishing tight…

Information Theory · Computer Science 2016-11-18 Ritesh Kolte , Urs Niesen , Piyush Gupta

The Compute-and-Forward relaying strategy achieves high computation rates by decoding linear combinations of transmitted messages at intermediate relays. However, if the involved relays independently choose which combinations of the…

Information Theory · Computer Science 2015-04-21 Amaro Barreal , Joonas Pääkkönen , David Karpuk , Camilla Hollanti , Olav Tirkkonen

Recent work for single-relay channels shows that quantize-forward (QF) with long-message encoding achieves the same reliable rates as compress-forward (CF) with short-message encoding. It is shown that short-message QF with backward or…

Information Theory · Computer Science 2011-05-06 Gerhard Kramer , Jie Hou

We consider the Gaussian interference channel with an intermediate relay as a main building block for cooperative interference networks. On the achievability side, we consider compress-and-forward based strategies. Specifically, a…

Information Theory · Computer Science 2015-03-18 Ye Tian , Aylin Yener

We present the optimal relay-subset selection and transmission-time for a decode-and-forward, half-duplex cooperative network of arbitrary size. The resource allocation is obtained by maximizing over the rates obtained for each possible…

Information Theory · Computer Science 2008-12-22 Elzbieta Beres , Raviraj Adve

This work addresses the cooperation facilitator (CF) model, in which network nodes coordinate through a rate limited communication device. For independent multiple-access channel (MAC) encoders, the CF model is known to show significant…

Information Theory · Computer Science 2022-02-07 Oliver Kosut , Michelle Effros , Michael Langberg

A relay channel is one in which a Source and Destination use an intermediate Relay station in order to improve communication rates. We propose the study of relay channels with classical inputs and quantum outputs and prove that a "partial…

Quantum Physics · Physics 2012-09-04 Ivan Savov , Mark M. Wilde , Mai Vu

This paper studies a full-duplex filter-and-forward (FD-FF) relay system in frequency-selective channels. Conventionally, the loop-back signal at the FD relay is treated as harmful self-interference and needs to be significantly suppressed…

Information Theory · Computer Science 2016-07-05 Jie Xu , Lingjie Duan , Rui Zhang

In this paper, for a fading decode-and-forward full-duplex relay channel, we analytically derive optimum power allocations. Individual power constraints for the source and the relay are assumed and the related optimization problem is…

Information Theory · Computer Science 2012-02-07 Arash Gholami Davoodi , Mohammad Javad Emadi , Mohammad Reza Aref

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