اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn the Achievable Rate Region of the $ K $-Receiver Broadcast Channels via Exhaustive Message Splitting
97
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper focuses on $ K $-receiver discrete-time memoryless broadcast channels (DM-BCs) with private messages, where the transmitter wishes to convey $K$ private messages to $K$ receivers respectively. A general inner bound on the capacity region is proposed based on an exhaustive message splitting and a $K$-level modified Martons coding. The key idea is to split every message into $ sum_{j=1}^K {Kchoose j} $ submessages each corresponding to a set of users who are assigned to recover them, and then send these submessages through codewords that are jointly typical with each other. To guarantee the joint typicality among all transmitted codewords, a sufficient condition on the subcodebooks sizes is derived through a newly establishing hierarchical covering lemma, which extends the 2-level multivariate covering lemma to the $K$-level case including $(2^{K}-1)$ random variables with more intricate dependence. As the number of auxiliary random variables and rate constraints both increase linearly with $(2^{K}-1)$, the standard Fourier-Motzkin elimination procedure becomes infeasible when $K$ is large. To tackle this problem, we obtain the final form of achievable rate region with a special observation of disjoint unions of sets that constitute the power set of $ {1,dots,K}$. The proposed achievable rate region allows arbitrary input probability mass functions (pmfs) and improves over all previously known ones for $ K$-receiver ($Kgeq 3$) BCs whose input pmfs should satisfy certain Markov chain(s).
قيم البحث
اقرأ أيضاً
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. We f
irst propose a transmission scheme and derive an inner bound for the two-receiver memoryless broadcast channel. We next prove that this inner bound is tight for the deterministic channel and the more capable channel, thereby establishing their capacity regions. We show that this inner bound is also tight for all classes of two-receiver broadcast channels whose capacity regions were known prior to this work. Our proposed scheme is consequently a unified capacity-achieving scheme for these classes of broadcast channels.
Achievable rate regions for cooperative relay broadcast channels with rate-limited feedback are proposed. Specifically, we consider two-receiver memoryless broadcast channels where each receiver sends feedback signals to the transmitter through a noi
seless and rate-limited feedback link, and meanwhile, acts as relay to transmit cooperative information to the other receiver. Its shown that the proposed rate regions improve on the known regions that consider either relaying cooperation or feedback communication, but not both.
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 secrecy capacity region for the K-receiver degraded broadcast channel (BC) is given for confidential messages sent to the receivers and to be kept secret from an external wiretapper. Superposition coding and Wyners random code partitioning are us
ed to show the achievable rate tuples. Error probability analysis and equivocation calculation are also provided. In the converse proof, a new definition for the auxiliary random variables is used, which is different from either the case of the 2-receiver BC without common message or the K-receiver BC with common message, both with an external wiretapper; or the K-receiver BC without a wiretapper.
This paper investigates the capacity region of the three-receiver AWGN broadcast channel where the receivers (i) have private-message requests and (ii) may know some of the messages requested by other receivers as side information. We first classify
all 64 possible side information configurations into eight groups, each consisting of eight members. We next construct transmission schemes, and derive new inner and outer bounds for the groups. This establishes the capacity region for 52 out of 64 possible side information configurations. For six groups (i.e., groups 1, 2, 3, 5, 6, and 8 in our terminology), we establish the capacity region for all their members, and show that it tightens both the best known inner and outer bounds. For group 4, our inner and outer bounds tighten the best known inner bound and/or outer bound for all the group members. Moreover, our bounds coincide at certain regions, which can be characterized by two thresholds. For group 7, our inner and outer bounds coincide for four members, thereby establishing the capacity region. For the remaining four members, our bounds tighten both the best known inner and outer bounds.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
