Sub-4.7 Scaling Exponent of Polar Codes

被引:1
作者
Wang, Hsin-Po [1 ,2 ,3 ]
Lin, Ting-Chun [2 ,4 ]
Vardy, Alexander [1 ]
Gabrys, Ryan [5 ,6 ]
机构
[1] Univ Calif San Diego, Dept Elect, San Diego, CA 92093 USA
[2] Univ Calif San Diego, Comp Engn ECE, San Diego, CA 92093 USA
[3] Univ Calif Berkeley, Dept Elect Engn & Comp Sci EECS, Berkeley, CA 94720 USA
[4] Univ Calif San Diego, San Diego, CA 92093 USA
[5] Naval Informat Warfare Ctr, San Diego, CA 92152 USA
[6] Univ Calif San Diego, Calif Inst Telecommun & Informat Technol Calit2, San Diego, CA 92093 USA
关键词
Polar code; scaling exponent; density evolution; information combining; binary memoryless symmetric (BMS) channels; CHANNEL POLARIZATION; CAPACITY; BOUNDS;
D O I
10.1109/TIT.2023.3253074
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Polar codes approach channel capacity provably and empirically and are thereby a constituent code of the 5G standard. Compared to low-density parity-check codes, however, the performance of short-length polar codes have rooms for improvement that could hinder its adoption by a wider class of applications. As part of the program that addresses the performance issue at short length, it is crucial to understand how ? fast binary memoryless symmetric channels polarize. A number, called scaling exponent, was defined to measure the speed of polarization and several estimates of the scaling exponent were given in literature. As of 2022, the tightest overestimate is 4.714 made by Mondelli, Hassani, and Urbanke in 2015. We lower the overestimate to 4.63. The idea behind this improvement is that, instead of describing the relation between a channel W and its children W(sic) and W-?, we describe the relation between W and its grandchildren W(sic)(sic), W(sic)(?), W?(sic), and W-??. By doing so, the evolution of channels becomes "less Markovian" and hence more tighter inequalities can be obtained.
引用
收藏
页码:4235 / 4254
页数:20
相关论文
共 45 条
  • [1] Source Polarization
    Arikan, Erdal
    [J]. 2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 899 - 903
  • [2] On the rate of channel polarization
    Arikan, Erdal
    Telatar, Emre
    [J]. 2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 1493 - +
  • [3] Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
    Arikan, Erdal
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) : 3051 - 3073
  • [4] General Strong Polarization
    Blasiok, Jaroslaw
    Guruswami, Venkatesan
    Nakkiran, Preetum
    Rudra, Atri
    Sudan, Madhu
    [J]. JOURNAL OF THE ACM, 2022, 69 (02)
  • [5] Blasiok Jaroslaw., 2018, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018), p34:1, DOI DOI 10.4230/LIPICS.APPROX-RANDOM.2018.34
  • [6] Buzaglo S, 2017, IEEE INT SYMP INFO, P2618, DOI 10.1109/ISIT.2017.8007003
  • [7] Polar Coding for the Multiple Access Wiretap Channel via Rate-Splitting and Cooperative Jamming
    Chou, Remi A.
    Yener, Aylin
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (12) : 7903 - 7921
  • [8] Lossless Source Coding with Polar Codes
    Cronie, Harm S.
    Korada, Satish Babu
    [J]. 2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 904 - 908
  • [9] Duursma I., 2022, APPROXIMATION RANDOM, V245
  • [10] Fathollahi Dorsa, 2022, 2022 IEEE International Symposium on Information Theory (ISIT), P2154, DOI 10.1109/ISIT50566.2022.9834712