English
Related papers

Related papers: Best Relay Selection in Gaussian Half-Duplex Diamo…

200 papers

We study the potential employment of improper Gaussian signaling (IGS) in full-duplex cooperative settings with residual self-interference (RSI). IGS is recently shown to outperform traditional proper Gaussian signaling (PGS) in several…

Information Theory · Computer Science 2016-11-18 Mohamed Gaafar , Mohammad Galal Khafagy , Osama Amin , Mohamed-Slim Alouini

In many wireless communication systems, radios are subject to a duty cycle constraint, that is, a radio only actively transmits signals over a fraction of the time. For example, it is desirable to have a small duty cycle in some low power…

Information Theory · Computer Science 2012-09-24 Lei Zhang , Hui Li , Dongning Guo

The statistical analysis of the fading End to End channel gain of the amplify and forward relaying protocol, however, is well known as extremely complex, and research work to date have only studied the asymptotic behaviour of the outage…

Information Theory · Computer Science 2016-04-22 Quoc Tuan Nguyen , D. T. Nguyen , Cong Lam Sinh

Recent research developments show that the concept of bidirectional relaying significantly improves the performance in wireless networks. This applies to three-node networks, where a half-duplex relay node establishes a bidirectional…

Information Theory · Computer Science 2011-04-19 Rafael F. Wyrembelski , Holger Boche

When data traffic in a wireless network is bursty, small amounts of data sporadically become available for transmission, at times that are unknown at the receivers, and an extra amount of energy must be spent at the transmitters to overcome…

Information Theory · Computer Science 2012-08-09 Ilan Shomorony , Raúl Etkin , Farzad Parvaresh , A. Salman Avestimehr

This paper considers the distributed information bottleneck (D-IB) problem for a primitive Gaussian diamond channel with two relays and Rayleigh fading. Due to the bottleneck constraint, it is impossible for the relays to inform the…

Information Theory · Computer Science 2022-06-30 Hao Xu , Kai-Kit Wong , Giuseppe Caire , Shlomo Shamai

In this paper, we study relay networks with orthogonal components in presence of noncausal channel state information (CSI) available at the source. We propose an upper bound on the capacity of the discrete memoryless model (DM)for the case…

Information Theory · Computer Science 2013-05-08 Amir Sonee , Ghosheh Abed Hodtani

Two-way relay is potentially an effective approach to spectrum sharing and aggregation by allowing simultaneous bidirectional transmissions between source-destinations pairs. This paper studies the two-way $2\times2\times2$ relay network, a…

Information Theory · Computer Science 2017-11-03 Mehdi Ashraphijuo , Vaneet Aggarwal , Xiaodong Wang

The fundamental diversity-multiplexing tradeoff of the three-node, multi-input, multi-output (MIMO), quasi-static, Rayleigh faded, half-duplex relay channel is characterized for an arbitrary number of antennas at each node and in which…

Information Theory · Computer Science 2011-07-01 Sanjay Karmakar , Mahesh K. Varanasi

We consider a system with a single base station communicating with multiple users over orthogonal channels while being assisted by multiple relays. Several recent works have suggested that, in such a scenario, selection, i.e., a single…

Information Theory · Computer Science 2009-03-16 Sachin Kadloor , Raviraj Adve

Most practical communication links are bi-directional. In these models, since the source node also receives signals, its encoder has the option of computing its output based on the signals it received in the past. On the other hand, from a…

Information Theory · Computer Science 2009-11-24 Xiang He , Aylin Yener

In coded bi-directional cooperation, two nodes wish to exchange messages over a shared half-duplex channel with the help of a relay. In this paper, we derive performance bounds for this problem for each of three protocols. The first…

Information Theory · Computer Science 2008-06-05 Sang Joon Kim , Patrick Mitran , Vahid Tarokh

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

This paper considers a two-hop network consisting of a source, two parallel half-duplex relay nodes, and two destinations. While the destinations have an adequate power supply, the source and relay nodes rely on harvested energy for data…

Signal Processing · Electrical Eng. & Systems 2018-03-06 Sharief Abdel-Razeq , Ming Zhao , Shengli Zhou , Zhengdao Wang

The cut-set bound developed by Cover and El Gamal in 1979 has since remained the best known upper bound on the capacity of the Gaussian relay channel. We develop a new upper bound on the capacity of the Gaussian primitive relay channel…

Information Theory · Computer Science 2016-06-07 Xiugang Wu , Ayfer Ozgur

The cut-set bound developed by Cover and El Gamal in 1979 has since remained the best known upper bound on the capacity of the Gaussian relay channel. We develop a new upper bound on the capacity of the Gaussian primitive relay channel…

Information Theory · Computer Science 2015-10-15 Xiugang Wu , Ayfer Ozgur

In this paper, we consider a bidirectional relay network with half-duplex nodes and block fading where the nodes transmit with a fixed transmission rate. Thereby, user 1 and user 2 exchange information only via a relay node, i.e., a direct…

Information Theory · Computer Science 2016-11-15 Vahid Jamali , Nikola Zlatanov , Robert Schober

In this paper, we derive the capacity of the deterministic relay networks with relay messages. We consider a network which consists of five nodes, four of which can only communicate via the fifth one. However, the fifth node is not merely a…

Information Theory · Computer Science 2016-11-15 Ahmed A. Zewail , Yahya Mohasseb , Mohammed Nafie , Hesham El Gamal

In this paper, the Gaussian relay channel with linear time-invariant relay filtering is considered. Based on spectral theory for stationary processes, the maximum achievable rate for this subclass of linear Gaussian relay operation is…

Information Theory · Computer Science 2011-09-27 Youngchul Sung , Cheulsoon Kim

Consider a pair of terminals connected by two independent additive white Gaussian noise channels, and limited by individual power constraints. The first terminal would like to reliably send information to the second terminal, within a given…

Information Theory · Computer Science 2014-12-16 Assaf Ben-Yishai , Ofer Shayevitz