Polar Codes Based on Piecewise Gaussian Approximation: Design and Analysis

被引：6

作者：

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 | 2022年 / 10卷

基金：

巴西圣保罗研究基金会;

关键词：

Electronics packaging; Decoding; Polar codes; Reliability; Genetic algorithms; Channel estimation; Gaussian approximation; PC construction; piecewise approximation; POLARIZATION;

D O I：

10.1109/ACCESS.2022.3190393

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this article, we propose the construction of polar codes based on piecewise Gaussian approximation (PGA) techniques. The PGA is first optimized and then compared to the Gaussian approximation (GA) construction method, showing performance gains for medium blocks and high precision for long blocks, in scenarios with successive cancellation (SC) decoding and additive white gaussian noise (AWGN) channel. Based on the PGA, we develop two approximations based on multi-segmented polynomials that are easy to implement. We present the Approximate PGA (APGA) that is optimized for medium blocks and provides a performance improvement without increasing complexity. Furthermore, we develop the simplified PGA (SPGA) as an alternative to the GA, which is optimized for long blocks and achieves high construction accuracy. Simulation results show that the APGA and SPGA construction methods outperform existing GA and competing approaches for medium and long block codes with notable performance improvement.

引用

页码：73571 / 73582

页数：12

共 30 条

[1]

[Anonymous], 2018, TECHN SPEC GROUP RAD

[2] Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels [J].

Arikan, Erdal .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) :3051-3073

[3] AFF3CT: A Fast Forward Error Correction Toolbox! [J].

Cassagne, Adrien ;

Hartmann, Olivier ;

Leonardon, Mathieu ;

He, Kun ;

Leroux, Camille ;

Tajan, Romain ;

Aumage, Olivier ;

Barthou, Denis ;

Tonnellier, Thibaud ;

Pignoly, Vincent ;

Le Gal, Bertrand ;

Jego, Christophe .

SOFTWAREX, 2019, 10

[4] Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation [J].

Chung, SY ;

Richardson, TJ ;

Urbanke, RL .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :657-670

[5] Does Gaussian Approximation Work Well for the Long-Length Polar Code Construction? [J].

Dai, Jincheng ;

Niu, Kai ;

Si, Zhongwei ;

Dong, Chao ;

Lin, Jiaru .

IEEE ACCESS, 2017, 5 :7950-7963

[6]

Ebada M, 2019, ANN ALLERTON CONF, P177, DOI [10.1109/allerton.2019.8919804, 10.1109/ALLERTON.2019.8919804]

[7] Decoder-Tailored Polar Code Design Using the Genetic Algorithm [J].

Elkelesh, Ahmed ;

Ebada, Moustafa ;

Cammerer, Sebastian ;

ten Brink, Stephan .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2019, 67 (07) :4521-4534

[8]

Fang Z, 2017, PROCEEDINGS OF 2017 3RD IEEE INTERNATIONAL CONFERENCE ON COMPUTER AND COMMUNICATIONS (ICCC), P2429, DOI 10.1109/CompComm.2017.8322971

[9] PROOF OF WEIERSTRASS APPROXIMATION THEOREM USING BAND-LIMITED FUNCTIONS [J].

GIARDINA, CR ;

CHIRLIAN, PM .

PROCEEDINGS OF THE IEEE, 1973, 61 (04) :512-512

[10] Rate-compatible puncturing of low-density parity-check codes [J].

Ha, J ;

Kim, J ;

McLaughlin, SW .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (11) :2824-2836

← 1 2 3 →