Design of Rate-Compatible Polar Codes Based on Non-Uniform Channel Polarization

被引:4
|
作者
Oliveira, Robert M. [1 ]
de Lamare, Rodrigo C. [1 ]
机构
[1] Pontifical Catholic Univ Rio De Janeiro PUC Rio, Ctr Telecommun Studies CETUC, BR-22451900 Rio De Janeiro, Brazil
来源
IEEE ACCESS | 2021年 / 9卷 / 09期
关键词
Decoding; Polar codes; Kernel; Complexity theory; Standards; Matrix decomposition; Gaussian approximation; arbitrary-length; rate-compatible; non-uniform polarization; channel polarization; re-polarization; HYBRID ARQ SCHEME; CONSTRUCTION; PERFORMANCE;
D O I
10.1109/ACCESS.2021.3065816
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this article we propose a technique for polar codes (PC) construction for any code length. By default, PC construction is limited to code length proportional to the power of two. To construction the code length arbitrary, puncturing, shortening and extension techniques must be applied. However, performance is degraded with the use of these techniques. Other ways to design polar codes with arbitrary code length but which have encoding and decoding with higher complexity such as multi-kernel, concatenated codes and specific constructions for belief propagation (BP) or successive cancellation list (SCL) decoding. The polarization theory is generalized for non-uniform channels (NUC) and with this approach we can construction rate-compatible PC and variable code length. We developed an implementation algorithm based on the of PC construction by Gaussian approximation (NUPGA). In a scenario where the transmission is over an additive white Gaussian noise (AWGN) channel and under successive cancellation (SC) decoding, the PC construction of arbitrary code length can be implemented with NUPGA. With NUPGA we re-polarize the projected synthetic channels by choosing more efficiently the positions of the information bits. In addition, we present a generalization of the Gaussian approximation (GA) for the polarization and re-polarization processes and an extension technique for PC. The PC construction based on NUPGA present better performance than the existing techniques as shown in the simulations of this work.
引用
收藏
页码:41902 / 41912
页数:11
相关论文
共 50 条
  • [31] Polar Codes for Fast Fading Channel: Design Based on Polar Spectrum
    Niu, Kai
    Li, Yan
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2020, 69 (09) : 10103 - 10114
  • [32] Rate-Compatible Short-Length Protograph LDPC Codes
    Thuy Van Nguyen
    Nosratinia, Aria
    IEEE COMMUNICATIONS LETTERS, 2013, 17 (05) : 948 - 951
  • [33] CHANNEL POLARIZATION AND RESEARCH, DEVELOPMENT OF POLAR CODES
    Li, Guiping
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2014, 10 (06): : 2051 - 2065
  • [34] Design of Rate-Compatible QC-IRA-d Codes Based on Gaussian Approximation Analysis and Graph Extension
    Lei, Jing
    Li, Erbao
    Li, Wenwen
    WIRELESS PERSONAL COMMUNICATIONS, 2017, 97 (02) : 2269 - 2282
  • [35] Adaptive Transmission Based on Multi-Relay Selection and Rate-Compatible LDPC Codes
    Su, Hualing
    He, Yucheng
    Zhou, Lin
    GREEN ENERGY AND SUSTAINABLE DEVELOPMENT I, 2017, 1864
  • [36] The Design of Rate-Compatible LDPC Codes for IR-HARQ Systems over Erasure Channels
    Rastovac, Dragan
    Vukobratovic, Dejan
    Stankovic, Vladimir
    Stankovic, Lina
    2010 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2010,
  • [37] Rate-compatible LDPC codes with short block lengths based on puncturing and extension techniques
    Liu, Jingjing
    de Lamare, Rodrigo C.
    AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS, 2015, 69 (11) : 1582 - 1589
  • [38] Designing Rate-Compatible Irregular Repeat Accumulate Codes through Splitting
    Xiao, Min
    Wang, Lin
    Li, Jing
    IEEE COMMUNICATIONS LETTERS, 2011, 15 (10) : 1104 - 1106
  • [39] A New Polar Code Design Based on Reciprocal Channel Approximation
    Ochiai, Hideki
    Ikeya, Kosuke
    Mitran, Patrick
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2023, 71 (02) : 631 - 643
  • [40] Structured Nonbinary Rate-Compatible Low-Density Parity-Check Codes
    Huang, Jie
    Zhou, Wei
    Zhou, Shengli
    IEEE COMMUNICATIONS LETTERS, 2011, 15 (09) : 998 - 1000