首页> 外文期刊>IEEE Transactions on Information Theory >Multilevel Channel Polarization for Arbitrary Discrete Memoryless Channels
【24h】

Multilevel Channel Polarization for Arbitrary Discrete Memoryless Channels

机译:任意离散无记忆通道的多级通道极化

获取原文
获取原文并翻译 | 示例
           

摘要

It is shown that polar codes, with their original $(u,u+v)$ kernel, achieve the symmetric capacity of discrete memoryless channels with arbitrary input alphabet sizes. It is shown that in general, channel polarization happens in several, rather than only two levels so that the synthesized channels are either useless, perfect or “partially perfect.” Any subset of the channel input alphabet which is closed under addition induces a coset partition of the alphabet through its shifts. For any such partition of the input alphabet, there exists a corresponding partially perfect channel whose outputs uniquely determine the coset to which the channel input belongs. By a slight modification of the encoding and decoding rules, it is shown that perfect transmission of certain information symbols over partially perfect channels is possible. Our result is general regarding both the cardinality and the algebraic structure of the channel input alphabet; i.e., we show that for any channel input alphabet size and any Abelian group structure on the alphabet, polar codes are optimal. Due to the modifications, we make to the encoding rule of polar codes, the constructed codes fall into a larger class of structured codes called nested group codes.
机译:结果表明,极性码及其原始$(u,u + v)$内核可以实现具有任意输入字母大小的离散无记忆通道的对称容量。结果表明,一般而言,信道极化发生在几个级别上,而不是仅在两个级别上发生,因此,合成的信道是无用的,完善的或“部分完善的”。在加法下关闭的通道输入字母的任何子集都会通过其移位来诱导字母的陪集划分。对于输入字母的任何这种划分,都有一个相应的部分完善的通道,其输出唯一地确定通道输入所属的陪集。通过稍微修改编码和解码规则,可以看出某些信息符号在部分完美的信道上的完美传输是可能的。关于通道输入字母的基数和代数结构,我们的结果是通用的。即,我们表明,对于任何通道输入字母大小和字母上的任何阿贝尔群结构,极性代码都是最佳的。由于修改,我们对极地代码的编码规则进行了规定,将构造的代码归入称为嵌套组代码的更大的结构化代码类别。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号