English
Related papers

Related papers: A New Achievable Rate for the Gaussian Parallel Re…

200 papers

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

This paper studies Gaussian Two-Way Relay Channel where two communication nodes exchange messages with each other via a relay. It is assumed that all nodes operate in half duplex mode without any direct link between the communication nodes.…

Information Theory · Computer Science 2016-11-17 Sinda Smirani , Mohamed Kamoun , Mireille Sarkiss , Abdellatif Zaidi , Pierre Duhamel

In this paper, we consider a two-hop one-way relay network for multigroup multicast transmission between long-distance users, in which the relay is equipped with multiple antennas, while the transmitters and receivers are all with a single…

Information Theory · Computer Science 2016-03-18 Sissi Xiaoxiao Wu , Qiang Li , Anthony Man-Cho So , Wing-Kin Ma

We analyze the performance of a system composed of two interfering point-to-point links where the transmitters can exploit a common relay to improve their individual transmission rate. When the relay uses the amplify-and-forward protocol we…

Information Theory · Computer Science 2009-04-20 Brice Djeumou , Elena Veronica Belmega , Samson Lasaulce

We consider a Gaussian multiple-access channel (MAC) with an amplify-and-forward (AF) relay, where all nodes except the receiver have multiple antennas and the direct links between transmitters and receivers are neglected. Thus, spatial…

Information Theory · Computer Science 2015-03-20 Frederic Knabe , Omar Mohamed , Carolin Huppert

In this paper, we study the Gaussian relay channels in the low signal-to-noise ratio (SNR) regime with the time-sharing compress-and-forward (CF) scheme, where at each time slot all the nodes keep silent at the first fraction of time and…

Information Theory · Computer Science 2010-03-04 Lili Zhang , Jinhua Jiang , Shuguang Cui

In this paper, we study the performance of an amplify-and-forward (AF) based analog network coding (ANC) relay scheme in a multi-hop wireless network under individual power constraints. In the first part, a unicast scenario is considered.…

Information Theory · Computer Science 2012-03-23 Binyue Liu , Ning Cai

In this paper, we propose a new coding scheme for the general relay channel. This coding scheme is in the form of a block Markov code. The transmitter uses a superposition Markov code. The relay compresses the received signal and maps the…

Information Theory · Computer Science 2007-10-05 Wei Kang , Sennur Ulukus

In fading channels, power allocation over channel state may bring a rate increment compared to the fixed constant power mode. Such a rate increment is referred to power allocation gain. It is expected that the power allocation gain varies…

Information Theory · Computer Science 2014-12-25 Zhengchuan Chen , Pingyi Fan , Dapeng Wu , Liquan Shen

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

The Gaussian parallel relay network, in which two parallel relays assist a source to convey information to a destination, was introduced by Schein and Gallager. An upper bound on the capacity can be obtained by considering broadcast cut…

Information Theory · Computer Science 2016-04-13 Satyajit Thakor , Syed Abbas

This paper focuses on the signal design in a Gaussian amplify-and-forward (AF) relay system with superposition coding (SC) being applied at the relay, which allows the source and relay to transmit their own information within two time…

Signal Processing · Electrical Eng. & Systems 2019-12-18 Bohai Li , He Chen , Zheng Dong , Yonghui Li , Branka Vucetic

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

This paper considers the partial decode-and-forward (PDF) strategy for the Gaussian multiple-input multiple-output (MIMO) relay channel. Unlike for the decode-and-forward (DF) strategy or point-to-point (P2P) transmission, for which…

Information Theory · Computer Science 2014-10-01 Lennart Gerdes , Christoph Hellings , Lorenz Weiland , Wolfgang Utschick

This paper considers the performance of differential amplify-and-forward (D-AF) relaying over time-varying Rayleigh fading channels. Using the auto-regressive time-series model to characterize the time-varying nature of the wireless…

Information Theory · Computer Science 2014-03-24 M. R. Avendi , Ha H. Nguyen

This paper elaborates on the achievable schemes of interference alignment in constant channels via finite amplify-and-forward (AF) relays. Consider $K$ sources communicating with $K$ destinations without direct links besides the relay…

Information Theory · Computer Science 2012-11-20 Haichuan Zhou , Tharm Ratnarajah

In this paper, we propose different practical distributed schemes to solve the rank failure problem in the compute and forward (CMF)-based multi-user multi-relay networks without central coordinator, in which the relays have no prior…

Information Theory · Computer Science 2015-04-07 Seyed Mohammad Azimi-Abarghouyi , Mohsen Hejazi , Masoumeh Nasiri-Kenari

Scalar Quantize & Forward (QF) schemes are studied for the Two-Way Relay Channel. Different QF approaches are compared in terms of rates as well as relay and decoder complexity. A coding scheme not requiring Slepian-Wolf coding at the relay…

Information Theory · Computer Science 2013-01-29 Michael Heindlmaier , Onurcan Iscan , Christopher Rosanka

This paper provides comprehensive coding and outer bound for the half-duplex multiple access channel with generalized feedback (MAC-GF). Two users communicate with one destination over a discrete memoryless channel using time division. Each…

Information Theory · Computer Science 2011-08-02 Ahmad Abu Al Haija , Mai Vu

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