English
Related papers

Related papers: Gaussian Half-Duplex Relay Networks: improved cons…

200 papers

Although extensively investigated, the capacity of the two-hop half-duplex (HD) relay channel is not fully understood. In particular, a capacity expression which can be easily evaluated is not available and an explicit coding scheme which…

Information Theory · Computer Science 2015-11-18 Nikola Zlatanov , Vahid Jamali , Derrick Wing Kwan Ng , Robert

In this paper, we study the capacity of the diamond channel. We focus on the special case where the channel between the source node and the two relay nodes are two separate links with finite capacities and the link from the two relay nodes…

Information Theory · Computer Science 2015-01-23 Wei Kang , Nan Liu , Weiwei Chong

Although extensively investigated, the capacity of the two-hop half-duplex (HD) relay channel is not fully understood. In particular, a capacity expression which can be evaluated straightforwardly is not available and an explicit coding…

Information Theory · Computer Science 2015-10-13 Nikola Zlatanov , Vahid Jamali , Robert Schober

We consider a communication system where two transmitters wish to exchange information through a half-duplex relay in the middle. The channels between the transmitters and the relay have asymmetric channel gains. More specifically, the…

Information Theory · Computer Science 2009-08-18 Makesh Pravin Wilson , Krishna Narayanan

In this paper, we propose a general model to study the full-duplex non-coherent decode-and-forward Gaussian relay channel with energy harvesting (EH) nodes, called NC-EH-$\mathcal{RC}$, in three cases: $i)$ no energy transfer (ET), $ii)$…

Networking and Internet Architecture · Computer Science 2021-04-07 Mahmood Mohassel Feghhi , Mahtab Mirmohseni , Aliazam Abbasfar

Standard upper and lower bounds on the capacity of relay channels are cut-set (CS), decode-forward (DF), and quantize-forward (QF) rates. For real additive white Gaussian noise (AWGN) multicast relay channels with one source node and one…

Information Theory · Computer Science 2019-01-28 Mohit Thakur , Gerhard Kramer

In this paper, the diamond relay channel is considered, which consists of one source-destination pair and two relay nodes connected with rate-limited out-of-band conferencing links. In particular, we focus on the half-duplex alternative…

Information Theory · Computer Science 2012-05-08 Chuan Huang , Shuguang Cui

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 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

In this paper, we study relay selection and power allocation in two-way relaying networks consisting of a source, a destination and multiply half-duplex decode-and-forward (DF) relays. A transmission model with three time subslots is…

Information Theory · Computer Science 2022-12-16 Gang Wang

In this paper, we consider a parallel relay network where two relays cooperatively help a source transmit to a destination. We assume the source and the destination nodes are equipped with multiple antennas. Three basic schemes and their…

Information Theory · Computer Science 2017-01-27 Muryong Kim , Sae-Young Chung

In this correspondence, we consider a half-duplex large relay network, which consists of one source-destination pair and $N$ relay nodes, each of which is connected with a subset of the other relays via signal-to-noise ratio (SNR)-limited…

Information Theory · Computer Science 2016-11-18 Chuan Huang , Jinhua Jiang , Shuguang Cui

Motivated by the design of low-complexity low-power coding solutions for the Gaussian relay channel, this work presents an upper bound on the minimum energy-per-bit achievable on the Gaussian relay channel using rank-1 linear relaying. Our…

Information Theory · Computer Science 2024-01-30 Oliver Kosut , Michelle Effros , Michael Langberg

In this paper, we analyze the 2-relay multiple-input multiple-output (MIMO) Gaussian diamond channel. We show that a multihopping decode-and-forward with multiple access (MDF-MAC) protocol achieves rates within a constant gap from capacity…

Information Theory · Computer Science 2016-02-09 Antony V. Mampilly , Srikrishna Bhashyam

We derive the capacity of the state-dependent half-duplex relay channel without source-destination link. The output of the state-dependent half-duplex relay channel depends on the randomly varying channel states of the source-relay and…

Information Theory · Computer Science 2014-02-25 Nikola Zlatanov , Robert Schober

Maximizing the minimum rate for a full-duplex multiple-input multiple-output (MIMO) wireless network encompassing two sources and a two-way (TW) relay operating in a two hop manner is investigated. To improve the overall performance, using…

Signal Processing · Electrical Eng. & Systems 2020-04-06 Erfan Khordad , Ata Khalili , Soroush Akhlaghi

In this paper, we study the interference relay-without-delay channel which is an interference channel with a relay helping the communication. We assume the relay's transmit symbol depends not only on its past received symbols but also on…

Information Theory · Computer Science 2011-08-16 Hyunseok Chang , Sae-Young Chung

This paper considers the distributed information bottleneck (D-IB) problem for a primitive Gaussian diamond channel with two relays and MIMO Rayleigh fading. The channel state is an independent and identically distributed (i.i.d.) process…

Information Theory · Computer Science 2023-05-09 Yi Song , Hao Xu , Kai-Kit Wong , Giuseppe Caire , Shlomo Shamai

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

Energy Harvesting (EH) is a novel technique to prolong the lifetime of the wireless networks such as wireless sensor networks or Ad-Hoc networks, by providing an unlimited source of energy for their nodes. In this sense, it has emerged as a…

Information Theory · Computer Science 2021-04-07 Mahmood Mohassel Feghhi , Aliazam Abbasfar , Mahtab Mirmohseni
‹ Prev 1 4 5 6 7 8 10 Next ›