English
Related papers

Related papers: Degradedness Under Cooperation

200 papers

Interference limits performance in wireless networks, and cooperation among receivers or transmitters can help mitigate interference by forming distributed MIMO systems. Earlier work shows how limited receiver cooperation helps mitigate…

Information Theory · Computer Science 2010-05-03 I-Hsiang Wang , David N. C. Tse

Compute and Forward (CF) is a coding scheme which enables receivers to decode linear combinations of simultaneously transmitted messages while exploiting the linear properties of lattice codes and the additive nature of a shared medium. The…

Information Theory · Computer Science 2020-05-12 Ori Shmuel , Asaf Cohen , Omer Gurewitz

In this paper, we propose a new cooperation model for discrete memoryless multiple access channels. Unlike in prior cooperation models (e.g., conferencing encoders), where the transmitters cooperate directly, in this model the transmitters…

Information Theory · Computer Science 2014-04-29 Parham Noorzad , Michelle Effros , Michael Langberg , Tracey Ho

This paper describes an approach for half-duplex cooperative transmission in a classical three-node relay channel. Assuming availability of channel state information at nodes, the approach makes use of this information to optimize distinct…

Information Theory · Computer Science 2011-11-09 Tan F. Wong , Tat M. Lok , John M. Shea

In this paper, we study the performance, in terms of the asymptotic error probability, of a user which communicates with a destination with the aid of a full-duplex in-band relay. We consider that the network is interference-limited, and…

Information Theory · Computer Science 2014-05-16 Andres Altieri , Leonardo Rey Vega , Pablo Piantanida , Cecilia G. Galarza

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 considers an amplify-and-forward relay network with fading states. Amplify-and-forward scheme (along with its variations) is the core mechanism for enabling cooperative communication in wireless networks, and hence understanding…

Information Theory · Computer Science 2009-08-06 Jubin Jose , Lei Ying , Sriram Vishwanath

In this paper, we contribute to the theoretical understanding, the design, and the performance evaluation of multi-source multi-relay network-coded cooperative diversity protocols. These protocols are useful to counteract the spectral…

Information Theory · Computer Science 2016-11-17 Marco Di Renzo , Michela Iezzi , Fabio Graziosi

In this work we focus on the general relay channel. We investigate the application of estimate-and-forward (EAF) to different scenarios. Specifically, we consider assignments of the auxiliary random variables that always satisfy the…

Information Theory · Computer Science 2007-07-13 R. Dabora , S. D. Servetto

We consider a broadcast channel with 3 receivers and 2 messages (M0, M1) where two of the three receivers need to decode messages (M0, M1) while the remaining one just needs to decode the message M0. We study the best known inner and outer…

Information Theory · Computer Science 2009-01-06 Chandra Nair , Vincent Wang Zizhou

In this paper, we investigate the performance of selection cooperation in the presence of imperfect channel estimation. In particular, we consider a cooperative scenario with multiple relays and amplify-and-forward protocol over frequency…

Information Theory · Computer Science 2011-01-05 Mehdi Seyfi , Sami Muhaidat , Jie Liang

The interference channel with degraded message sets (IC-DMS) refers to a communication model in which two senders attempt to communicate with their respective receivers simultaneously through a common medium, and one of the senders has…

Information Theory · Computer Science 2007-07-13 Jinhua Jiang , Xin Yan

The upper bound on the capacity of a 3-node discrete memoryless relay channel is considered, where a source X wants to send information to destination Y with the help of a relay Z. Y and Z are independent given X, and the link from Z to Y…

Information Theory · Computer Science 2012-10-26 Feng Xue

In this work we focus our attention on distributed optimization problems in the context where the communication time between the server and the workers is non-negligible. We obtain novel methods supporting bidirectional compression (both…

Optimization and Control · Mathematics 2023-05-23 Kaja Gruntkowska , Alexander Tyurin , Peter Richtárik

Handling interference is one of the main challenges in the design of wireless networks. One of the key approaches to interference management is node cooperation, which can be classified into two main types: relaying and feedback. In this…

Information Theory · Computer Science 2015-03-19 Daniel Zahavi , Ron Dabora

In this work, we propose a novel partial compress-and-forward (PCF) scheme for improving the maximum achievable transmission rate of a diamond relay network with two noisy relays. PCF combines conventional compress-and-forward (CF) and…

Information Theory · Computer Science 2024-01-12 Weihang Ding , Mohammad Shikh-Bahaei

We study and analyze coverage region in MIMO communication systems for a multiple-relay network with decode-and-forward (DF) strategy at the relays. Assuming that there is a line-of-sight (LOS) propagation environment for source-relay…

Information Theory · Computer Science 2014-06-30 Behrooz Razeghi , Alireza Alizadeh , Sima Naseri , Ghosheh Abed Hodtani , Seyed Alireza Seyedin

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

In this paper, we examine the performance of the decode-and-forward (DF) relaying protocols with finite blocklength (FB). We provide the overall outage probability of three distinct DF relaying protocols, where the channels are assumed to…

Information Theory · Computer Science 2017-06-22 Parisa Nouri , Hirley Alves , Matti Latva-aho

In this two part paper we consider a wireless network in which a source terminal communicates with a destination and a relay terminal is occasionally present in close proximity to the source without source's knowledge, suggesting oblivious…

Information Theory · Computer Science 2010-07-27 Evgeniy Braginskiy , Avi Steiner , Shlomo Shamai
‹ Prev 1 3 4 5 6 7 10 Next ›