Window Processing of Binary Polarization Kernels

被引:11
|
作者
Trofimiuk, Grigorii [1 ]
Trifonov, Peter [1 ]
机构
[1] ITMO Univ, Fac Secure Informat Technol, St Petersburg 197101, Russia
关键词
Polar codes; polarization kernels; fast decoding; POLAR CODES; DECODERS; EXPONENT;
D O I
10.1109/TCOMM.2021.3072730
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A decoding algorithm for polar (sub)codes with binary 2(t) x 2(t) polarization kernels is presented. It is based on the window processing (WP) method, which exploits the linear relationship of the polarization kernels and the Arikan matrix. This relationship enables one to compute the kernel input symbols probabilities by computing the probabilities of several paths in Arikan successive cancellation (SC) decoder. In this paper we propose an improved version of WP, which has significantly lower arithmetic complexity and operates in log-likelihood ratios (LLRs) domain. The algorithm identifies and reuses common subexpressions arising in computation of Arikan SC path scores. The proposed algorithm is applied to kernels of size 16 and 32 with improved polarization properties. It enables polar (sub)codes with the considered kernels to simultaneously provide better performance and lower decoding complexity compared with polar (sub)codes with Arikan kernel.
引用
收藏
页码:4294 / 4305
页数:12
相关论文
共 50 条
  • [1] Reduced complexity window processing of binary polarization kernels
    Trofimiuk, Grigorii
    Trifonov, Peter
    [J]. 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 1412 - 1416
  • [2] Construction of binary polarization kernels for low complexity window processing
    Trofimiuk, Grigorii
    Trifonov, Peter
    [J]. 2019 IEEE INFORMATION THEORY WORKSHOP (ITW), 2019, : 115 - 119
  • [3] On the Scaling Exponent of Binary Polarization Kernels
    Fazeli, Arman
    Vardy, Alexander
    [J]. 2014 52ND ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2014, : 797 - 804
  • [4] Binary Polarization Kernels From Code Decompositions
    Presman, Noam
    Shapira, Ofer
    Litsyn, Simon
    Etzion, Tuvi
    Vardy, Alexander
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (05) : 2227 - 2239
  • [5] Recursive Trellis Processing of Large Polarization Kernels
    Trifonov, Peter
    [J]. 2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 2090 - 2095
  • [6] Design of BCH Polarization Kernels With Reduced Processing Complexity
    Moskovskaya, Elizaveta
    Trifonov, Peter
    [J]. IEEE COMMUNICATIONS LETTERS, 2020, 24 (07) : 1383 - 1386
  • [7] The interpretation of multifocal binary kernels
    Erich Sutter
    [J]. Documenta Ophthalmologica, 2000, 100 (2-3) : 49 - 75
  • [8] A Search Method for Large Polarization Kernels
    Trofimiuk, Grigorii
    [J]. 2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 2084 - 2089
  • [9] INTERACTION KERNELS FOR BINARY CLUSTER SYSTEMS
    SUZUKI, Y
    RESKE, EJ
    HECHT, KT
    [J]. BULLETIN OF THE AMERICAN PHYSICAL SOCIETY, 1981, 26 (04): : 609 - 609
  • [10] Binary Embedding with Additive Homogeneous Kernels
    Kim, Saehoon
    Choi, Seungjin
    [J]. THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 2094 - 2100