A Puncturing Algorithm of Polar Code Based on Gaussian Approximation

被引:0
作者
Li Shibao [1 ]
Gao Xun [1 ]
Dong Zhenwei [1 ]
Liu Jianhang [2 ]
Cui Xuerong [1 ]
机构
[1] China Univ Petr East China, Coll Oceanog & Space Informat, Qingdao 266580, Peoples R China
[2] China Univ Petr East China, Coll Comp Sci & Technol, Qingdao 266580, Peoples R China
基金
国家重点研发计划; 中国国家自然科学基金;
关键词
Polar code; Rate-compatible; Puncturing; Gaussian Approximation(GA); CONSTRUCTION;
D O I
10.11999/JEIT201007
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The influence of channel construction process on the algorithm performance is not considered in the existing polar code puncturing algorithms. To solve this problem, a Puncturing algorithm of Polar Code based on Gaussian Approximation (GAPPC) is proposed. Firstly, using Gaussian approximation for channel construction of polar code and analyzing the relationship between Gaussian approximation and puncturing algorithm, the modified Gaussian approximation function is derived to reduce the output value of channel construction with introduced Gaussian correction factors. Then the ordered channel reliability set is obtained by ordering the polarization subchannels under the channel construction with the modified Gaussian approximation function. Finally, the mapping rule is determined according to the relationship of channel capacity, and the puncturing bit set and frozen bit set are selected so that the puncturing polar code is completed. Experimental results show that the frame error rate and bit error rate are significantly reduced under different code lengths and bit rates.
引用
收藏
页码:3149 / 3155
页数:7
相关论文
共 18 条
  • [1] 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
  • [2] Bioglio V, 2017, IEEE WIREL COMMUNN
  • [3] Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
    Chung, SY
    Richardson, TJ
    Urbanke, RL
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) : 657 - 670
  • [4] Eslami A, 2011, IEEE INT SYMP INFO, P16, DOI 10.1109/ISIT.2011.6033837
  • [5] HANIF M A, 2019, TELECOMMUNICATIONS I, V3, P63, DOI [10.26636/jtit.2019.132219, DOI 10.26636/JTIT.2019.132219]
  • [6] An Efficient Construction of Rate-Compatible Punctured Polar (RCPP) Codes Using Hierarchical Puncturing
    Hong, Song-Nam
    Jeong, Min-Oh
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2018, 66 (11) : 5041 - 5052
  • [7] Rate Matching for Polar Codes Based on Binary Domination
    Jang, Min
    Ahn, Seok-Ki
    Jeong, Hongsil
    Kim, Kyung-Joong
    Myung, Seho
    Kim, Sang-Hyo
    Yang, Kyeongcheol
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2019, 67 (10) : 6668 - 6681
  • [8] Optimal Puncturing of Polar Codes With a Fixed Information Set
    Li, Liping
    Song, Wei
    Niu, Kai
    [J]. IEEE ACCESS, 2019, 7 : 65965 - 65972
  • [9] Pre-decoding Based Maximum-likelihood Simplified Successive-cancellation Decoding of Polar Codes
    Liu Jianhang
    He Yijing
    Li Shibao
    Lu Lijin
    Deng Yunqiang
    [J]. JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY, 2019, 41 (04) : 959 - 966
  • [10] LIU Wei, 2020, 2020 INT WIR COMM MO, P154, DOI [10.1109/IWCMC48107.2020.9148522, DOI 10.1109/IWCMC48107.2020.9148522]