Trellis-based Decoding Techniques for Polar Codes with Large Kernels

被引:5
|
作者
Trifonov, Peter [1 ]
机构
[1] ITMO Univ, St Petersburg, Russia
关键词
POLARIZATION; EXPONENT;
D O I
10.1109/itw44776.2019.8989386
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A recursive trellis-based algorithm is proposed for computing the probabilities arising in the successive cancellation (SC) decoding algorithm for polar codes with arbitrary linear kernels. This approach enables one to re-use intermediate values obtained at different phases. Arikan SC algorithm is shown to be a special case of this method.
引用
收藏
页码:249 / 253
页数:5
相关论文
共 50 条
  • [31] TRELLIS-BASED CIRCLE DETECTION
    Hild, Kenneth E., II
    Erdogmus, Deniz
    Mathan, Santosh
    Pavel, Misha
    2008 IEEE WORKSHOP ON MACHINE LEARNING FOR SIGNAL PROCESSING, 2008, : 211 - +
  • [32] ERROR-TRELLIS SYNDROME DECODING TECHNIQUES FOR CONVOLUTIONAL-CODES
    REED, IS
    TRUONG, TK
    IEE PROCEEDINGS-F RADAR AND SIGNAL PROCESSING, 1985, 132 (02) : 77 - 83
  • [33] Symbol assignment for high-rate circular trellis-based turbo codes
    Ganti, Kamalakar
    Dill, Jeffrey C.
    WCNC 2008: IEEE WIRELESS COMMUNICATIONS & NETWORKING CONFERENCE, VOLS 1-7, 2008, : 1056 - 1060
  • [34] Short Length Trellis-Based Codes for Gaussian Multiple-Access Channels
    Ozcelikkale, Ayca
    Duman, Tolga M.
    IEEE SIGNAL PROCESSING LETTERS, 2014, 21 (10) : 1177 - 1181
  • [35] Binary Linear Codes With Optimal Scaling: Polar Codes With Large Kernels
    Fazeli, Arman
    Hassani, Hamed
    Mondelli, Marco
    Vardy, Alexander
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (09) : 5693 - 5710
  • [36] Trellis-Based Check Node Processing for Low-Complexity Nonbinary LP Decoding
    Punekar, Mayur
    Flanagan, Mark F.
    2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011, : 1653 - 1657
  • [37] Binary Linear Codes with Optimal Scaling: Polar Codes with Large Kernels
    Fazeli, Arman
    Hassani, Hamed
    Mondelli, Marco
    Vardy, Alexander
    2018 IEEE INFORMATION THEORY WORKSHOP (ITW), 2018, : 395 - 399
  • [38] On constructing trellis codes with large free distances and low decoding complexities
    Wang, JY
    Lin, MC
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1997, 45 (09) : 1017 - 1020
  • [39] Trellis decoding of some decomposable codes
    Altay, G
    Yalçin, S
    Uçan, ON
    RAST 2003: RECENT ADVANCES IN SPACE TECHNOLOGIES, PROCEEDINGS, 2003, : 667 - 669
  • [40] Trellis decoding of linear block codes
    Univ of Pretoria, Pretoria, South Africa
    Proc S Afr Symp Commun Signal Process, (171-174):