English
Related papers

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

200 papers

In this paper, we consider the Gaussian diamond-wiretap channel that consists of an orthogonal broadcast channel from a source to two relays and a Gaussian fast-fading multiple access-wiretap channel from the two relays to a legitimate…

Information Theory · Computer Science 2015-12-22 Si-Hyeon Lee , Wanyao Zhao , Ashish Khisti

Quantize-Map-and-Forward (QMF) relaying has been shown to achieve the optimal diversity-multiplexing trade-off (DMT) for arbitrary slow fading full-duplex networks as well as for the single-relay half-duplex network. A key reason for this…

Information Theory · Computer Science 2016-11-18 Ayan Sengupta , I-Hsiang Wang , Christina Fragouli

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 study of feedback has been mostly limited to single-hop communication settings. In this paper, we consider Gaussian networks where sources and destinations can communicate with the help of intermediate relays over multiple hops. We…

Information Theory · Computer Science 2014-07-16 Bobbie Chern , Farzan Farnia , Ayfer Özgür

A diamond network is considered in which the central processor is connected, via backhaul noiseless links, to multiple conferencing base stations, which communicate with a single user over a multiple access channel. We propose coding…

Information Theory · Computer Science 2022-05-05 Michael Dikshtein , Shirin Saeedi Bidokhti , Shlomo Shamai

This paper studies the relaying strategies and the approximate capacity of the classic three-node Gaussian relay channel, but where the noises at the relay and at the destination are correlated. It is shown that the capacity of such a relay…

Information Theory · Computer Science 2011-10-25 Lei Zhou , Wei Yu

We introduce a generalized two-way relay channel where two sources exchange information (not necessarily of the same rate) with help from a relay, and each source additionally sends private information to the relay. We consider the Gaussian…

Information Theory · Computer Science 2016-11-15 Chin Keong Ho , Kiran T. Gowda , Sumei Sun

We develop a new upper bound on the capacity of the relay channel that is tighter than previously known upper bounds. This upper bound is proved using traditional weak converse techniques involving mutual information inequalities and…

Information Theory · Computer Science 2022-04-01 Abbas El Gamal , Amin Gohari , Chandra Nair

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

The deterministic capacity of a relay network is the capacity of a network when relays are restricted to transmitting \emph{reliable} information, that is, (asymptotically) deterministic function of the source message. In this paper it is…

Information Theory · Computer Science 2016-11-18 Anders Host-Madsen

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

We consider a three-terminal state-dependent relay channel with the channel state available non-causally at only the source. Such a model may be of interest for node cooperation in the framework of cognition, i.e., collaborative signal…

Information Theory · Computer Science 2016-11-15 Abdellatif Zaidi , Shlomo Shamai , Pablo Piantanida , Luc Vandendorpe

This paper focuses on the capacity of point-to-point relay communications wherein the transmitter is assisted by an intermediate relay. We detail the mathematical model of cutset and amplify and forward (AF) relaying strategy. We present…

Information Theory · Computer Science 2013-01-15 Farshad Shams , Marco Luise

A bound on the maximum information transmission rate through a cascade of Gaussian links is presented. The network model consists of a source node attempting to send a message drawn from a finite alphabet to a sink, through a cascade of…

Information Theory · Computer Science 2013-01-29 Ramanan Subramanian , Badri Vellambi , Ingmar Land

We consider a three-terminal state-dependent relay channel with the channel state available non-causally at only the source. Such a model may be of interest for node cooperation in the framework of cognition, i.e., collaborative signal…

Information Theory · Computer Science 2016-11-17 Abdellatif Zaidi , Shlomo Shamai , Pablo Piantanida , Luc Vandendorpe

The secrecy capacity of relay channels with orthogonal components is studied in the presence of an additional passive eavesdropper node. The relay and destination receive signals from the source on two orthogonal channels such that the…

Information Theory · Computer Science 2009-06-09 Vaneet Aggarwal , Lalitha Sankar , A. Robert Calderbank , H. Vincent Poor

The two user Gaussian interference channel with a full-duplex relay is studied. By using genie aided approaches, two new upper bounds on the achievable sum-rate in this setup are derived. These upper bounds are shown to be tighter than…

Information Theory · Computer Science 2010-08-16 Anas Chaaban , Aydin Sezgin

In this letter, the problem of optimal resource power allocation and relay selection for two way relaying cognitive radio networks using half duplex Decode and Forward (DF) and Amplify and Forward (AF) systems are investigated. The primary…

Information Theory · Computer Science 2013-05-21 Ahmad Alsharoa , Faouzi Bader , Mohamed-Slim Alouini

Computing the cut-set bound in half-duplex relay networks is a challenging optimization problem, since it requires finding the cut-set optimal half-duplex schedule. This subproblem in general involves an exponential number of variables,…

Information Theory · Computer Science 2013-05-14 Raúl Etkin , Farzad Parvaresh , Ilan Shomorony , A. Salman Avestimehr

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
‹ Prev 1 3 4 5 6 7 10 Next ›