我应该准备多少矩阵才能以最优速度极化信道?
How Many Matrices Should I Prepare To Polarize Channels Optimally Fast?
AI总结:
本文研究极化码中核数量与缩放指数的权衡,证明核数可界为O(ℓ^(3/μ-1)),缩放指数接近3时单核足够,接近2时需约O(√ℓ)个核。
摘要:
以接近最优速度(即缩放指数接近$2$)逼近容量的极化码已被证明对于$q$元擦除信道(Pfister和Urbanke)、二进制擦除信道BEC(Fazeli、Hassani、Mondelli和Vardy)、所有BMS信道(Guruswami、Riazanov和Ye)以及所有DMC(Wang和Duursma)是可能的。然而,后两篇论文与前两篇之间存在一个细微差别,即在极化过程中使用了多个动态核,这导致复杂度增加且硬件加速机会减少。本文阐明了这一细微差别,提供了构造中核数量与缩放指数之间的权衡。我们证明核的数量可以由$O(\ell^{3/\mu-1})$界定,其中$\mu$是目标缩放指数,$\ell$是核大小。特别地,如果满足于缩放指数接近$3$,则单个核就足够了;而要接近最优缩放指数$2$,则大约$O(\sqrt{\ell})$个核就足够了。
英文摘要:
Polar codes that approach capacity at a near-optimal speed, namely with scaling exponents close to $2$, have been shown possible for $q$-ary erasure channels (Pfister and Urbanke), the BEC (Fazeli, Hassani, Mondelli, and Vardy), all BMS channels (Guruswami, Riazanov, and Ye), and all DMCs (Wang and Duursma). There is, nevertheless, a subtlety separating the last two papers from the first two, namely the usage of multiple dynamic kernels in the polarization process, which leads to increased complexity and fewer opportunities to hardware-accelerate. This paper clarifies this subtlety, providing a trade-off between the number of kernels in the construction and the scaling exponent. We show that the number of kernels can be bounded by $O(\ell^{3/μ-1})$ where $μ$ is the targeted scaling exponent and $\ell$ is the kernel size. In particular, if one settles for scaling exponent approaching $3$, a single kernel suffices, and to approach the optimal scaling exponent of $2$, about $O(\sqrt{\ell})$ kernels suffice.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。