اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn the Capacity Region of the Layered Packet Erasure Broadcast Channel with Feedback
83
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 recently proposed by Tse and Yates, who characterized the capacity region for any number of users and any number of layers when there is no COF. This paper derives capacity inner and outer bounds for the LPE-BC with COF for the case of two users and any number of layers. The inner bounds generalize past results for the two-user erasure BC, which is a special case of the LPE-BC with COF with only one layer. The novelty lies in the use of emph{inter-user & inter-layer network coding} retransmissions (for those packets that have only been received by the unintended user), where each random linear combination may involve packets intended for any user originally sent on any of the layers. Analytical and numerical examples show that the proposed outer bound is optimal for some LPE-BCs.
قيم البحث
اقرأ أيضاً
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 Yates, who char
acterized the capacity region for any number of users and any number of layers when there is no COF. This paper provides a comparative overview of this channel model along the following lines: First, inner and outer bounds to the capacity region (set of achievable rates with backlogged arrivals) are presented: a) a new outer bound based on the idea of the physically degraded broadcast channel, and b) an inner bound of the LPE-BC with COF for the case of two users and any number of layers. Next, an inner bound on the stability region (set of exogenous arrival rates for which packet arrival queues are stable) for the same model is derived. The capacity region inner bound generalizes past results for the two-user erasure BC, which is a special case of the LPE-BC with COF with only one layer. The novelty lies in the use of inter-user and inter-layer network coding retransmissions (for those packets that have only been received by the unintended user), where each random linear combination may involve packets intended for any user originally sent on any of the layers. For the case of $K = 2$ users and $Q geq 1$ layers, the inner bounds to the capacity region and the stability region coincide; both strategically employ the novel retransmission protocol. For the case of $Q = 2$ layers, sufficient conditions are derived by Fourier-Motzkin elimination for the inner bound on the stability region to coincide with the capacity outer bound, thus showing that in those cases the capacity and stability regions coincide.
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 region unde
r certain assumptions. These results provided the fundamental ideas used in communication protocols for networks with delayed channel state information. However, to the best of our knowledge, the capacity region of erasure broadcast channels with feedback and with a common message for both receivers has never been presented. This latter problem shows up as a sub-problem in many multi-terminal communication networks such as the X-Channel, and the two-unicast problem. In this work, we present the capacity region of the two-user erasure broadcast channels with delayed feedback, private messages, and a common message. We consider arbitrary and possibly correlated erasure distributions. We develop new outer-bounds that capture feedback and quantify the impact of delivering a common message on the capacity region. We also propose a transmission strategy that achieves the outer-bounds. Our transmission strategy differs from prior results in that to achieve the capacity, it creates side-information at the weaker user such that the decodability is ensured even if we multicast the common message with a rate higher than its link capacity.
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 knowledge of th
e channel state (i.e., the state is visible), and (ii) when the channel state is unknown at the transmitter, but observations of it are available at the transmitter through feedback (i.e., the state is hidden). In both scenarios, matching outer and inner bounds on the rates of communication are derived and the capacity region is determined. It is shown that similar results carry over to channels with memory and delayed feedback and memoryless compound channels with feedback. When the state is visible, the capacity region has a single-letter characterization and is in terms of a linear program. Two optimal coding schemes are devised that use feedback to keep track of the sent/received packets via a network of queues: a probabilistic scheme and a deterministic backpressure-like algorithm. The former bases its decisions solely on the past channel state information and the latter follows a max-weight queue-based policy. The performance of the algorithms are analyzed using the frameworks of rate stability in networks of queues, max-flow min-cut duality in networks, and finite-horizon Lyapunov drift analysis. When the state is hidden, the capacity region does not have a single-letter characterization and is, in this sense, uncomputable. Approximations of the capacity region are provided and two optimal coding algorithms are outlined. The first algorithm is a probabilistic coding scheme that bases its decisions on the past L acknowledgments and its achievable rate region approaches the capacity region exponentially fast in L. The second algorithm is a backpressure-like algorithm that performs optimally in the long run.
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 this hidden
Markov chain are available at the transmitter through feedback. Matching outer and inner bounds are derived and the capacity region is determined. The capacity region does not have a single-letter characterization and is, in this sense, uncomputable. Approximations of the capacity region are provided and two optimal coding algorithms are outlined. The first algorithm is a probabilistic coding scheme that bases its decisions on the past L feedback sequences. Its achievable rate-region approaches the capacity region exponentially fast in L. The second algorithm is a backpressure-like algorithm that performs optimally in the long run.
The relay broadcast channel (RBC) is considered, in which a transmitter communicates with two receivers with the assistance of a relay. Based on different degradation orders among the relay and the receivers outputs, three types of physically degrade
d RBCs (PDRBCs) are introduced. Inner bounds and outer bounds are derived on the capacity region of the presented three types. The bounds are tight for two types of PDRBCs: 1) one receivers output is a degraded form of the other receivers output, and the relays output is a degraded form of the weaker receivers output; 2) one receivers output is a degraded form of the relays output, and the other receivers output is a degraded form of the relays output. For the Gaussian PDRBC, the bounds match, i.e., establish its capacity region.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
