首页> 外文会议>IEEE Wireless Communications and Networking Conference Workshops >Capacity-Achieving Rate-Compatible Polar Codes for General Channels
【24h】

Capacity-Achieving Rate-Compatible Polar Codes for General Channels

机译:通用通道的容量达到速率兼容的极性代码

获取原文

摘要

We present a rate-compatible polar coding scheme that achieves the capacity of any family of channels. Our solution generalizes the previous results [1], [2] that provide capacity-achieving rate-compatible polar codes for a degraded family of channels. The motivation for our extension comes from the fact that in many practical scenarios, e.g., MIMO systems and non-Gaussian interference, the channels cannot be ordered by degradation. The main technical contribution of this paper consists in removing the degradation condition. To do so, we exploit the ideas coming from the construction of universal polar codes. Our scheme possesses the usual attractive features of polar codes: low complexity code construction, encoding, and decoding; super-polynomial scaling of the error probability with the block length; and absence of error floors. On the negative side, the scaling of the gap to capacity with the block length is slower than in standard polar codes, and we prove an upper bound on the scaling exponent.
机译:我们提出了一种速率兼容的极性编码方案,该方案可实现任何系列信道的容量。我们的解决方案概括了先前的结果[1],[2],这些结果为退化的信道族提供了容量实现速率兼容的极性代码。我们进行扩展的动机来自以下事实:在许多实际情况下,例如MIMO系统和非高斯干扰,信道无法通过降级来排序。本文的主要技术贡献在于消除降解条件。为此,我们利用了构建通用极地代码的想法。我们的方案具有极地代码的通常吸引人的特征:低复杂度的代码构造,编码和解码;错误概率与块长度的超多项式缩放;并且没有错误底线。不利的一面是,随着块长度的增加,间隙到容量的缩放比标准极性代码慢,并且我们证明了缩放指数的上限。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号