Achievable Rate Region for Three User Discrete Broadcast Channel Based on Coset Codes
Achievable Rate Region for Three User Discrete Broadcast Channel Based on Coset Codes
复制标题
基于陪集码的三用户离散广播信道可达到的速率区域
DOI：
10.1109/isit.2013.6620432
复制
发表时间：
2012
影响因子：
2.5
通讯作者：
M. I. S. Sandeep Pradhan
中科院分区：
文献类型：
--
作者：
Arun Padakandla;M. I. S. Sandeep Pradhan
我们考虑使用三个接收器（3-DBC）开发编码技术和得出可实现的速率区域的问题。基于非结构化代码的区域，此后称为<inline-formula> <tex-math notegy =“ latex”> $ \ pmb {\ mathscr {u}}} \ Mathcal {m Mathcal {M} $ </tex-math> </inline-formula> - 我们提出了一种基于coset代码的编码技术PMB {\ Mathscr {u}} \ Mathcal {M} $ </tex-Math> </inline-formula> - 我们使用新的代码概括了所提出的编码技术斜体>（PCC） - 具有经验和代数特性，并评估其在此推导中的一般3-DBC的可实现率区域的性能是binning和联合典型性编码和解码统计上相关的PCC。 3-DBC的斜体实例，该实例基于PCC提出的编码技术严格较大。
We consider the problem of developing coding techniques and deriving achievable rate regions for discrete memoryless broadcast channels with three receivers (3-DBC). We begin by identifying a novel vector additive 3-DBC for which we characterize an upper bound on the the largest achievable rate region based on unstructured codes, henceforth referred to as <inline-formula> <tex-math notation="LaTeX">$\pmb {\mathscr {U}}\mathcal {M}$ </tex-math></inline-formula>-region. We propose a coding technique based on coset codes that yield an achievable rate triple not contained within <inline-formula> <tex-math notation="LaTeX">$\pmb {\mathscr {U}}\mathcal {M}$ </tex-math></inline-formula>-region. We generalize the proposed coding technique using a new ensemble of codes—<italic>partitioned coset codes</italic> (PCC)—containing both empirical and algebraic properties, and evaluate its performance to derive an achievable rate region for the general 3-DBC. The new elements in this derivation are binning and joint typicality encoding and decoding of statistically correlated PCCs. We validate the utility of this technique by identifying <italic>non-additive</italic> instances of 3-DBC for which the proposed coding techniques based on PCC yield strictly larger rates.