English
Related papers

Related papers: On Capacity Regions of Two-Receiver Broadcast Pack…

200 papers

The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finite-state Markov chain representing a channel state. The channel state is unknown at the transmitter, but observations of…

Information Theory · Computer Science 2015-06-25 Michael Heindlmaier , Shirin Saeedi Bidokhti

The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finite-state Markov chain representing a channel state. Two scenarios are considered: (i) when the transmitter has causal…

Information Theory · Computer Science 2018-02-21 Michael Heindlmaier , Shirin Saeedi Bidokhti

We derive a new outer bound on the capacity region of broadcast traffic in multiple input broadcast packet erasure channels with feedback, and extend this outer bound to packet erasure relay networks with feedback. We show the tightness of…

Information Theory · Computer Science 2019-05-17 Quan Geng , Hieu T. Do , Rui Wu , Mindi Yuan , Yun Li , Wei Ding

Achievable data rates in wireless systems rely heavily on the available channel state information (CSI) throughout the network. However, feedback links, which provide this information, are scarce, unreliable, and subject to security…

Information Theory · Computer Science 2021-02-08 Alireza Vahid , Shih-Chun Lin , I-Hsiang Wang

Jolfaei et al. used feedback to create transmit signals that are simultaneously useful for multiple users in a broadcast channel. Later, Georgiadis and Tassiulas studied erasure broadcast channels with feedback, and presented the capacity…

Information Theory · Computer Science 2020-05-19 Alireza Vahid , Shih-Chun Lin , I-Hsiang Wang

In this paper, the capacity region of the Layered Packet Erasure Broadcast Channel (LPE-BC) with Channel Output Feedback (COF) available at the transmitter is investigated. The LPE-BC is a high-SNR approximation of the fading Gaussian BC…

Information Theory · Computer Science 2019-01-08 Siyao Li , Daniela Tuninetti , Natasha Devroye

This paper investigates the capacity regions of two-receiver broadcast channels where each receiver (i) has both common and private-message requests, and (ii) knows part of the private message requested by the other receiver as side…

Information Theory · Computer Science 2016-11-18 Behzad Asadi , Lawrence Ong , Sarah J. Johnson

We study the effects of introducing a feedback channel in the two-receiver erasure source-broadcast problem in which a binary equiprobable source is to be sent over an erasure broadcast channel to two receivers subject to erasure distortion…

Information Theory · Computer Science 2021-05-04 Louis Tan , Kaveh Mahdaviani , Ashish Khisti

This paper focuses on the Layered Packet Erasure Broadcast Channel (LPE-BC) with Channel Output Feedback (COF) available at the transmitter. The LPE-BC is a high-SNR approximation of the fading Gaussian BC recently proposed by Tse and…

Information Theory · Computer Science 2021-09-10 Siyao Li , Daniela Tuninetti , Natasha Devroye , Hulya Seferoglu

We study the capacity region of two-user erasure interference channels with local delayed channel state information at the transmitters. In our model, transmitters have local mismatched outdated knowledge of the channel gains. We propose a…

Information Theory · Computer Science 2016-07-26 Alireza Vahid , Robert Calderbank

An outer bound to the capacity region of the two-receiver discrete memoryless broadcast channel is given. The outer bound is tight for all cases where the capacity region is known. When specialized to the case of no common information, this…

Information Theory · Computer Science 2007-07-13 Chandra Nair , Abbas El Gamal

This paper focuses on the 1-to-K broadcast packet erasure channel (PEC), which is a generalization of the broadcast binary erasure channel from the binary symbol to that of arbitrary finite fields GF(q) with sufficiently large q. We…

Information Theory · Computer Science 2016-11-15 Chih-Chun Wang

We consider the N-user broadcast erasure channel with public feedback and side information. Before the beginning of transmission, each receiver knows a function of the messages of some of the other receivers. This situation arises naturally…

Information Theory · Computer Science 2014-06-16 A. Papadopoulos , L. Georgiadis

This paper establishes the capacity region of a class of broadcast channels with random state in which each channel component is selected from two possible functions and each receiver knows its state sequence. This channel model does not…

Information Theory · Computer Science 2014-01-28 Hyeji Kim , Abbas El Gamal

As a class of state-dependent channels, Markov channels have been long studied in information theory for characterizing the feedback capacity and error exponent. This paper studies a more general variant of such channels where the state…

Information Theory · Computer Science 2022-02-22 Mohsen Heidari , Achilleas Anastasopoulos , S. Sandeep Pradhan

In this work, we examine cognitive radio networks, where secondary users may act as relays for messages sent by the primary user, hence offering performance improvement of primary transmissions, while at the same time obtaining more…

Information Theory · Computer Science 2019-08-29 Athanasios Papadopoulos , Nestor D. Chatzidiamantis , Leonidas Georgiadis

We study the best known general inner bound[MAR '79] and outer bound[N-EG'07] for the capacity region of the two user discrete memory less channel. We prove that a seemingly stronger outer bound is identical to a weaker form of the outer…

Information Theory · Computer Science 2008-04-25 Chandra Nair , Vincent Wang Zizhou

This paper focuses on the 1-to-K broadcast packet erasure channel (PEC), which is a generalization of the broadcast binary erasure channel from the binary symbol to that of arbitrary finite fields GF(q) with sufficiently large q. We…

Information Theory · Computer Science 2010-10-13 Chih-Chun Wang

A class of cognitive interference channel with state is investigated, in which two transmitters (transmitters 1 and 2) communicate with two receivers (receivers 1 and 2) over an interference channel. The two transmitters jointly transmit a…

Information Theory · Computer Science 2012-07-10 Ruchen Duan Yingbin Liang

We consider the $N$-user broadcast erasure channel with $N$ unicast sessions (one for each user) where receiver feedback is regularly sent to the transmitter in the form of ACK/NACK messages. We first provide a generic outer bound to the…

Information Theory · Computer Science 2016-11-17 Marios Gatzianas , Leonidas Georgiadis , Leandros Tassiulas
‹ Prev 1 2 3 10 Next ›