Extended Polar Codes Perform Better in Terms of Compound Rate and Scaling Behavior

被引:0
|
作者
Hassani, S. Hamed [1 ]
机构
[1] Ecole Polytech Fed Lausanne, Sch Comp & Commun Sci, Lausanne, Switzerland
关键词
CHANNELS; CAPACITY;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Polar codes provably achieve the capacity of a wide array of channels under successive decoding. However, in terms of some practical aspects, these codes do not perform optimally and need further improvement. In this paper, we consider two such aspects: universality and finite-length scaling. We argue analytically that for extensions of polar codes that are based on l x l matrices, these aspects become optimal as l grows large.
引用
收藏
页数:5
相关论文
共 5 条
  • [1] Universal Bounds on the Scaling Behavior of Polar Codes
    Goli, Ali
    Hassani, S. Hamed
    Urbanke, Ruediger
    [J]. 2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012,
  • [2] On the Polarizing Behavior and Scaling Exponent of Polar Codes with Product Kernels
    Bhandari, Manan
    Bansal, Ishan
    Lalitha, V
    [J]. 2020 TWENTY SIXTH NATIONAL CONFERENCE ON COMMUNICATIONS (NCC 2020), 2020,
  • [3] On the scaling of Polar codes: I. The behavior of polarized channels
    Hassani, S. Hamed
    Urbanke, Rudiger
    [J]. 2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 874 - 878
  • [4] Low-Complexity Concatenated Polar Codes with Excellent Scaling Behavior
    Yoon, Sung Whan
    Moon, Jaekyun
    [J]. 2017 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS WORKSHOPS (ICC WORKSHOPS), 2017, : 948 - 954
  • [5] On the scaling of Polar Codes: II. The behavior of un-polarized channels
    Hassani, S. Hamed
    Alishahi, Kasra
    Urbanke, Rudiger
    [J]. 2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 879 - 883