Segmented Successive Cancellation List Polar Decoding with Joint BCH-CRC Codes

被引:0
|
作者
Liang, Xiao [1 ,2 ]
Zhou, Huayi [1 ,2 ]
Wang, Zhongfeng [3 ]
You, Xiaohu [2 ]
Zhang, Chuan [1 ,2 ]
机构
[1] Southeast Univ, Lab Efficient Architectures Digital Commun & Sign, Nanjing, Jiangsu, Peoples R China
[2] Southeast Univ, Natl Mobile Commun Res Lab, Nanjing, Jiangsu, Peoples R China
[3] Nanjing Univ, Sch Elect Sci & Engn, Nanjing, Jiangsu, Peoples R China
关键词
Polar codes; successive cancellation; BCH; CRC; segmented decoding; VLSI architecture; HYBRID ARQ SCHEME;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Polar codes, which have been adopted as the channel code for 3GPP eMBB control channel, are the first codes achieving the capacity of symmetric binary-input discrete memoryless channels (B-DMCs). For short length polar codes, which are favorable for control channels, CRC-aided segmented successive cancellation list (SCL) decoding can reduce the hardware complexity and memory cost. However, CRC brings no performance gain in segmented decoding. In this paper, an efficient joint decoding scheme called BCH-CRC-aided segmented SCL decoding (BC-SCL) is firstly proposed. Its HARQ refined version is also given. BCH and CRC are employed in different segments to maximize their own correction or check advantages. Numerical results on binary-input additive white Gaussian noise (BI-AWGN) channel have shown the performance gain of the proposed BC-SCL decoder. The corresponding hardware architecture is also proposed. Short-length BC-SCL decoder with (N = 128, K = 64, L = 2) is implemented with Altera Stratix V FPGA. Compared to the CRC-aided decoder, the proposed decoder requires only 76.12% ALMs with slightly increased latency. Therefore, BC-SCL scheme can highly demonstrate advantages of both BCH and CRC in polar segmented decoding.
引用
收藏
页码:1509 / 1513
页数:5
相关论文
共 50 条
  • [41] Multiple CRC-aided variable successive cancellation list decoder of polar codes
    Cao Miao
    Zhao Shuang
    Zhao Shengmei
    TheJournalofChinaUniversitiesofPostsandTelecommunications, 2017, 24 (02) : 83 - 88
  • [42] Successive Cancellation Priority Decoding of Polar Codes
    Guan, Di
    Niu, Kai
    Dong, Chao
    Zhang, Ping
    IEEE ACCESS, 2019, 7 : 9575 - 9585
  • [43] Permuted Successive Cancellation Decoding for Polar Codes
    Buzaglo, Sarit
    Fazeli, Arman
    Siegel, Paul H.
    Taranalli, Veeresh
    Vardy, Alexander
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 2618 - 2622
  • [44] Improved Successive Cancellation Decoding of Polar Codes
    Chen, Kai
    Niu, Kai
    Lin, Jiaru
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2013, 61 (08) : 3100 - 3107
  • [45] Neural Successive Cancellation Decoding of Polar Codes
    Doan, Nghia
    Hashemi, Seyyed Ali
    Gross, Warren J.
    2018 IEEE 19TH INTERNATIONAL WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS (SPAWC), 2018, : 271 - 275
  • [46] COMBINING BELIEF PROPAGATION AND SUCCESSIVE CANCELLATION LIST DECODING OF POLAR CODES ON A GPU PLATFORM
    Cammerer, Sebastian
    Leible, Benedikt
    Stahl, Matthias
    Hoydis, Jakob
    ten Brink, Stephan
    2017 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2017, : 3664 - 3668
  • [47] Deep-Learning-Aided Successive Cancellation List Flip Decoding for Polar Codes
    Liang, Fu-Siang
    Lu, Shan
    Ueng, Yeong-Luh
    IEEE TRANSACTIONS ON COGNITIVE COMMUNICATIONS AND NETWORKING, 2024, 10 (02) : 374 - 386
  • [48] Low-complexity Successive Cancellation List Decoding for Polar Codes based on SPRT
    Li, Wenpeng
    Du, Liping
    Chen, Yueyun
    2019 28TH WIRELESS AND OPTICAL COMMUNICATIONS CONFERENCE (WOCC), 2019, : 193 - 196
  • [49] An Improved Bit-Flipping Algorithm of Successive Cancellation List Decoding for Polar Codes
    Wang, Desheng
    Yin, Jihang
    Xu, Yonggang
    Yang, Xuan
    Xu, Qiuwei
    Hua, Gang
    MATHEMATICS, 2023, 11 (21)
  • [50] In Situ Multi-Bit Decision for Successive Cancellation List Decoding of Polar Codes
    Park, Jaehyeon
    Lee, Jaeyoung
    Park, In-Cheol
    IEEE ACCESS, 2022, 10 : 86943 - 86952