m用户MAC的极化码
Polar Codes for the m-User MAC
摘要：
在本文中，极化码的$m$用户多址信道（MAC）与二进制输入的构造。结果表明，Arıkan的极化技术单独应用于每个用户变换独立使用的$m$用户二进制输入MAC到连续使用的极值MAC。这种变换具有许多理想的性质：（i）原始MAC的“均匀和速率”被保留，（ii）极值MAC具有均匀速率区域，这些区域不仅是多拟阵，而且是拟阵，因此（iii）每个用户发送未编码或固定比特都可以达到它们的均匀和速率;在这个意义上，它们很容易通信。极化码然后可以被构造为具有$O(n \log n)$的编码和解码复杂度（其中$n$是块长度）、$o(\exp(- n^{1/2 - \e}))$的块错误概率，并且能够实现具有任意多个用户的任何二进制输入MAC的均匀和速率。还讨论了这种极化码构造在AWGN信道上通信的应用。
英文摘要：
In this paper, polar codes for the $m$-user multiple access channel (MAC) with binary inputs are constructed. It is shown that Arıkan's polarization technique applied individually to each user transforms independent uses of a $m$-user binary input MAC into successive uses of extremal MACs. This transformation has a number of desirable properties: (i) the `uniform sum rate' of the original MAC is preserved, (ii) the extremal MACs have uniform rate regions that are not only polymatroids but matroids and thus (iii) their uniform sum rate can be reached by each user transmitting either uncoded or fixed bits; in this sense they are easy to communicate over. A polar code can then be constructed with an encoding and decoding complexity of $O(n \log n)$ (where $n$ is the block length), a block error probability of $o(\exp(- n^{1/2 - \e}))$, and capable of achieving the uniform sum rate of any binary input MAC with arbitrary many users. An application of this polar code construction to communicating on the AWGN channel is also discussed.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
