English
Related papers

Related papers: Degradedness Under Cooperation

200 papers

In this paper, bounds to the rate-equivocation region for the general 3-receiver broadcast channel (BC) with degraded message sets, are presented for confidential messages to be kept secret from one of the receivers. This model is more…

Information Theory · Computer Science 2009-10-27 Li-Chia Choo , Kai-Kit Wong

Channel capacities quantify the optimal rates of sending information reliably over noisy channels. Usually, the study of capacities assumes that the circuits which sender and receiver use for encoding and decoding consist of perfectly…

Quantum Physics · Physics 2024-04-15 Paula Belzig , Matthias Christandl , Alexander Müller-Hermes

The class of orthogonal relay channels in which the orthogonal channels connecting the source terminal to the relay and the destination, and the relay to the destination, depend on a state sequence, is considered. It is assumed that the…

Information Theory · Computer Science 2015-12-18 Iñaki Estella Aguerri , Deniz Gündüz

This paper investigates the problem of information transmission over the simultaneous relay channel with two users (or two possible channel outcomes) where for one of them the more suitable strategy is Decode-and-Forward (DF) while for the…

Information Theory · Computer Science 2010-10-20 Arash Behboodi , Pablo Piantanida

Cooperative beamforming in relay networks is considered, in which a source transmits to its destination with the help of a set of cooperating nodes. The source first transmits locally. The cooperating nodes that receive the source signal…

Information Theory · Computer Science 2015-10-28 Jiangyuan Li , Athina P. Petropulu , H. Vincent Poor

This paper focuses on the capacity of peer-to-peer relay communications wherein the transmitter are assisted by an arbitrary number of parallel relays, i.e. there is no link and cooperation between the relays themselves. We detail the…

Information Theory · Computer Science 2014-04-08 Farshad Shams , Marco Luise

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

We consider mesh networks composed of groups of relaying nodes which operate in decode-and-forward mode, where each node from a group relays information to all the nodes in the next group. We study these networks in two setups, one where…

Information Theory · Computer Science 2012-10-17 Angel Bravo-Santos , Petar M. Djuric

This work considers a layered coding approach for efficient transmission of data over a wireless block fading channel without transmitter channel state information (CSI), which is connected to a limited capacity reliable link, known as the…

Information Theory · Computer Science 2020-05-01 Avi Steiner , Shlomo Shamai

Wireless communication faces adversities due to noise, fading, and path loss. Multiple-Input Multiple-Output (MIMO) systems are used to overcome individual fading effect by employing transmit diversity. Duo to user single-antenna,…

Signal Processing · Electrical Eng. & Systems 2019-06-13 Cebrail Çiflikli , Waeal Al-Obaidi , Musaab Al-Obaidi

In this work, we consider the problem of coding for the half-duplex non-orthogonal amplify-and-forward (NAF) cooperative channel where the transmitter to relay and the inter-relay links are highly reliable. We derive bounds on the diversity…

Information Theory · Computer Science 2016-11-15 Ghassan M. Kraidy , Nicolas Gresset , Joseph J. Boutros

We derive the outage capacity of a bursty version of the amplify-and-forward (BAF) protocol for small signal-to-noise ratios when incremental relaying is used. We show that the ratio between the outage capacities of BAF and the cut-set…

Information Theory · Computer Science 2016-11-17 Tobias Renk , Holger Jaekel , Friedrich Jondral , Deniz Gunduz , Andrea Goldsmith

The capacity regions of semideterministic multiuser channels, such as the semideterministic relay channel and the multiple access channel with partially cribbing encoders, have been characterized using the idea of partial-decode-forward.…

Information Theory · Computer Science 2016-11-17 Ritesh Kolte , Ayfer Özgür , Haim Permuter

Characterizing the capacity region of multi-source wireless relay networks is one of the fundamental issues in network information theory. The problem is, however, quite challenging due to inter-user interference when there exist multiple…

Information Theory · Computer Science 2013-10-29 Sang-Woon Jeon , Sae-Young Chung

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

Cognitive radios have been studied recently as a means to utilize spectrum in a more efficient manner. This paper focuses on the fundamental limits of operation of a MIMO cognitive radio network with a single licensed user and a single…

Information Theory · Computer Science 2009-11-13 Sriram Sridharan , Sriram Vishwanath

This paper considers the problem of selecting a subset of nodes in a two-hop wireless network to act as relays in aiding the communication between the source-destination pair. Optimal relay subset selection with the objective of maximizing…

Information Theory · Computer Science 2008-05-23 Caleb K. Lo , Sriram Vishwanath , Robert W. Heath

The technique of cooperative communications is finding its way in the next generations of many wireless communication applications. Due to the distributed nature of cooperative networks, acquiring fading channels information for coherent…

Information Theory · Computer Science 2014-08-18 M. R. Avendi

The capacity region of a broadcast channel consisting of k-receivers that lie in a less noisy sequence is an open problem, when k >= 3. We solve this problem for the case k=3. We prove that superposition coding is optimal for a class of…

Information Theory · Computer Science 2010-04-26 Chandra Nair , Zizhou Vincent Wang

Distributed learning techniques such as federated learning have enabled multiple workers to train machine learning models together to reduce the overall training time. However, current distributed training algorithms (centralized or…

Machine Learning · Computer Science 2020-02-25 Zhenheng Tang , Shaohuai Shi , Xiaowen Chu