English
Related papers

Related papers: Multiple Multicasts with the Help of a Relay

200 papers

In this paper, we obtain a general achievable rate region and some certain capacity theorems for multiple-access relay channel (MARC), using decode and forward (DAF) strategy at the relay, superposition coding at the transmitters. Our…

Information Theory · Computer Science 2015-03-19 Mohammad Osmani-Bojd , Assadallah Sahebalam , Ghosheh Abed Hodtani

In this paper, we consider a system in which multiple users communicate with a destination with the help of multiple half-duplex relays. Based on the compute-and-forward scheme, each relay, instead of decoding the users' messages, decodes…

Information Theory · Computer Science 2014-10-20 Mohieddine El Soussi , Abdellatif Zaidi , Luc Vandendorpe

The problem of bistatic integrated sensing and communications over memoryless relay channels is considered, where destination concurrently decodes the message sent by the source and estimates unknown parameters from received signals with…

Information Theory · Computer Science 2026-03-05 Yao Liu , Min Li , Lawrence Ong , Aylin Yener

A novel class of achievable rate regions is obtained for the K-receiver broadcast channel with two groupcast messages. The associated achievability schemes are parameterized by an expansion of the message set which then determines how…

Information Theory · Computer Science 2020-01-28 Mohamed Salman , Mahesh K. Varanasi

We derive expressions for the achievable rate region of a collaborative coding scheme in a two-transmitter, two-receiver Pairwise Collaborative Network (PCN) where one transmitter and receiver pair, namely relay pair, assists the other…

Information Theory · Computer Science 2008-07-08 Saeed A. Astaneh , Saeed Gazor , Hamid Behroozi

The K-user discrete memoryless (DM) broadcast channel (BC) with two nested multicast messages is studied in which one common message is to be multicast to all receivers and the second private message to a subset of receivers. The receivers…

Information Theory · Computer Science 2018-12-31 Mohamed Salman , Mahesh K. Varanasi

In this paper, we consider two-way orthogonal frequency division multiplexing (OFDM) relay channels, where the direct link between the two terminal nodes is too weak to be used for data transmission. The widely known per-subcarrier…

Information Theory · Computer Science 2013-03-26 Fei He , Yin Sun , Limin Xiao , Xiang Chen , Chong-Yung Chi , Shidong Zhou

In this paper we study the multiple access channel (MAC) with combined cooperation and partial cribbing and characterize its capacity region. Cooperation means that the two encoders send a message to one another via a rate-limited link…

Information Theory · Computer Science 2014-04-04 Tal Kopetz , Haim Permuter , Shlomo Shamai

This letter considers a compute-and-forward two-way relaying channel with simultaneous wireless information and power transfer. Specifically, two single-antenna users exchange information via a multi-antenna relay station based on nested…

Information Theory · Computer Science 2016-11-01 Zhigang Wen , Shuai Wang , Chunxiao Fan , Weidong Xiang

This paper proposes a new cooperative protocol which involves cooperation between primary and secondary users. We consider a cognitive setting with one primary user and multiple secondary users. The time resource is partitioned into…

Networking and Internet Architecture · Computer Science 2014-07-03 Ahmed El Shafie , Tamer Khattab

A multi-antenna broadcast channel scenario is considered where a base station delivers contents to cache-enabled user terminals. A joint design of coded caching (CC) and multigroup multicast beamforming is proposed to benefit from spatial…

Information Theory · Computer Science 2020-01-03 Antti Tölli , Seyed Pooya Shariatpanahi , Jarkko Kaleva , Babak Khalaj

This paper investigates the capacity of a wireless two way relay channel in which two end nodes exchange information via a relay node. The capacity is defined in the information-theoretic sense as the maximum information exchange rate…

Information Theory · Computer Science 2008-04-22 Zhang Shengli , Soung Chang Liew

Communication over a fully quantum relay channel is considered. We establish three bounds based on different coding strategies, i.e., partial decode-forward, measure-forward, and assist-forward. Using the partial-decode forward strategy,…

Quantum Physics · Physics 2025-05-22 Uzi Pereg

The capacity of a network in which a multiple access channel (MAC) generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case.…

Information Theory · Computer Science 2012-09-06 Fangfang Zhu , Xiaohu Shang , Biao Chen , H. Vincent Poor

In this work, we investigate a slotted-time relay assisted cooperative random access wireless network with multipacket (MPR) reception capabilities. MPR refers to the capability of a wireless node to successfully receive packets from more…

Information Theory · Computer Science 2019-07-17 Ioannis Dimitriou , Nikolaos Pappas

We derive the optimal resource allocation of a practical half-duplex scheme for the Gaussian multiple access channel with transmitter cooperation (MAC-TC). Based on rate splitting and superposition coding, two users transmit information to…

Information Theory · Computer Science 2015-03-20 Ahmad Abu Al Haija , Mai Vu

In this paper, the multiple access channel (MAC) with channel state is analyzed in a scenario where a) the channel state is known non-causally to the transmitters and b) there is perfect causal feedback from the receiver to the…

Information Theory · Computer Science 2007-07-13 Wei Wu , Sriram Vishwanath , Ari Arapostathis

We consider a multipair decode-and-forward relay channel, where multiple sources transmit simultaneously their signals to multiple destinations with the help of a full-duplex relay station. We assume that the relay station is equipped with…

Information Theory · Computer Science 2014-05-07 Hien Quoc Ngo , Himal A. Suraweera , Michail Matthaiou , Erik G. Larsson

Physical-layer network coding improves the throughput of the two-way relay channel by allowing multiple source terminals to transmit simultaneously to the relay. However, it is generally not feasible to align the phases of the multiple…

Information Theory · Computer Science 2013-02-27 Terry Ferrett , Matthew C. Valenti , Don Torrieri

We consider the basic bidirectional relaying problem, in which two users in a wireless network wish to exchange messages through an intermediate relay node. In the compute-and-forward strategy, the relay computes a function of the two…

Information Theory · Computer Science 2016-11-15 Shashank Vatedka , Navin Kashyap , Andrew Thangaraj