Transformation of binary linear block codes to polar codes with dynamic frozen

Chien Ying Lin; Yu-Chih Huang; Shin Lin Shieh; Po-Ning Chen

doi:10.1109/OJCOMS.2020.2979529

Transformation of binary linear block codes to polar codes with dynamic frozen

Chien Ying Lin, Yu-Chih Huang, Shin Lin Shieh, Po-Ning Chen

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

In this paper, a general transformation of binary linear block codes (BLBCs) to (possibly, multi-kernel) polar codes with dynamic frozen bits is proposed. Through a simple matrix permutation operation, a one-to-one connection between the codewords of a BLBC and its transformed polar code can be established. This transformation allows the usage of any decoding algorithm of polar codes for efficient soft decoding of BLBCs, including the powerful successive cancellation list (SCL) decoding algorithm. Simulations show that the soft SCL polar decoding of BLBCs can achieve a comparative performance to the order statistic decoding (OSD), as well as the maximum-likelihood decoding (MLD) in certain cases, with a much lower computational complexity.

Original language	English
Article number	2979529
Pages (from-to)	333-341
Number of pages	9
Journal	IEEE Open Journal of the Communications Society
Volume	1
DOIs	https://doi.org/10.1109/OJCOMS.2020.2979529
State	Published - 2020

Keywords

Binary linear block codes and soft decoding
Channel coding
Polar codes

Access to Document

10.1109/OJCOMS.2020.2979529

Cite this

@article{3e5f11443a7f441c9318c21b415aed22,

title = "Transformation of binary linear block codes to polar codes with dynamic frozen",

abstract = "In this paper, a general transformation of binary linear block codes (BLBCs) to (possibly, multi-kernel) polar codes with dynamic frozen bits is proposed. Through a simple matrix permutation operation, a one-to-one connection between the codewords of a BLBC and its transformed polar code can be established. This transformation allows the usage of any decoding algorithm of polar codes for efficient soft decoding of BLBCs, including the powerful successive cancellation list (SCL) decoding algorithm. Simulations show that the soft SCL polar decoding of BLBCs can achieve a comparative performance to the order statistic decoding (OSD), as well as the maximum-likelihood decoding (MLD) in certain cases, with a much lower computational complexity.",

keywords = "Binary linear block codes and soft decoding, Channel coding, Polar codes",

author = "Lin, {Chien Ying} and Yu-Chih Huang and Shieh, {Shin Lin} and Po-Ning Chen",

year = "2020",

doi = "10.1109/OJCOMS.2020.2979529",

language = "English",

volume = "1",

pages = "333--341",

journal = "IEEE Open Journal of the Communications Society",

issn = "2644-125X",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Transformation of binary linear block codes to polar codes with dynamic frozen

AU - Lin, Chien Ying

AU - Huang, Yu-Chih

AU - Shieh, Shin Lin

AU - Chen, Po-Ning

PY - 2020

Y1 - 2020

N2 - In this paper, a general transformation of binary linear block codes (BLBCs) to (possibly, multi-kernel) polar codes with dynamic frozen bits is proposed. Through a simple matrix permutation operation, a one-to-one connection between the codewords of a BLBC and its transformed polar code can be established. This transformation allows the usage of any decoding algorithm of polar codes for efficient soft decoding of BLBCs, including the powerful successive cancellation list (SCL) decoding algorithm. Simulations show that the soft SCL polar decoding of BLBCs can achieve a comparative performance to the order statistic decoding (OSD), as well as the maximum-likelihood decoding (MLD) in certain cases, with a much lower computational complexity.

AB - In this paper, a general transformation of binary linear block codes (BLBCs) to (possibly, multi-kernel) polar codes with dynamic frozen bits is proposed. Through a simple matrix permutation operation, a one-to-one connection between the codewords of a BLBC and its transformed polar code can be established. This transformation allows the usage of any decoding algorithm of polar codes for efficient soft decoding of BLBCs, including the powerful successive cancellation list (SCL) decoding algorithm. Simulations show that the soft SCL polar decoding of BLBCs can achieve a comparative performance to the order statistic decoding (OSD), as well as the maximum-likelihood decoding (MLD) in certain cases, with a much lower computational complexity.

KW - Binary linear block codes and soft decoding

KW - Channel coding

KW - Polar codes

UR - http://www.scopus.com/inward/record.url?scp=85097193875&partnerID=8YFLogxK

U2 - 10.1109/OJCOMS.2020.2979529

DO - 10.1109/OJCOMS.2020.2979529

M3 - Article

AN - SCOPUS:85097193875

SN - 2644-125X

VL - 1

SP - 333

EP - 341

JO - IEEE Open Journal of the Communications Society

JF - IEEE Open Journal of the Communications Society

M1 - 2979529

ER -

Transformation of binary linear block codes to polar codes with dynamic frozen

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this