On the Capacity of 1-to-K Broadcast Packet Erasure Channels With Channel Output Feedback

DOI10.1109/TIT.2011.2173723MaRDI QIDQ5272117zbMATH OpenOpenAlexFDO

Authors Chih-Chun Wang

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1010.2433

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Abstract: 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 consider the setting in which the source node has instant feedback of the channel outputs of the K receivers after each transmission. Such a setting directly models network coded packet transmission in the downlink direction with integrated feedback mechanisms (such as Automatic Repeat reQuest (ARQ)). The main results of this paper are: (i) The capacity region for general 1-to-3 broadcast PECs, and (ii) The capacity region for two classes of 1-to-K broadcast PECs: the symmetric PECs, and the spatially independent PECs with one-sided fairness constraints. This paper also develops (iii) A pair of outer and inner bounds of the capacity region for arbitrary 1-to-K broadcast PECs, which can be evaluated by any linear programming solver. For most practical scenarios, the outer and inner bounds meet and thus jointly characterize the capacity.

Recommendations

• The Capacity Region of Two-Receiver Multiple-Input Broadcast Packet Erasure Channels With Channel Output Feedback
• Multiuser Broadcast Erasure Channel With Feedback—Capacity and Algorithms
• A New Capacity-Approaching Scheme for General 1-to-K Broadcast Packet Erasure Channels With ACK/NACK
• Capacity and Stable Throughput Regions for the Broadcast Erasure Channel With Feedback: An Unusual Union
• Capacity of Broadcast Packet Erasure Channels With Single-User Delayed CSI
• On the Capacity of the Discrete Memoryless Broadcast Channel With Feedback
• The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint
• Capacity Regions of Two-Receiver Broadcast Erasure Channels With Feedback and Memory
• Capacity of Burst Noise-Erasure Channels With and Without Feedback and Input Cost
• On the Capacity of Wireless 1-Hop Intersession Network Coding—A Broadcast Packet Erasure Channel Approach

Cited in

(4)

• The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint
• The Capacity Region of Two-Receiver Multiple-Input Broadcast Packet Erasure Channels With Channel Output Feedback
• Network coding for line networks with broadcast channels
• scientific article; zbMATH DE number 6765502 (Why is no real title available?)

This page was built for publication: On the Capacity of 1-to-$K$ Broadcast Packet Erasure Channels With Channel Output Feedback

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5272117)