Polar Subcodes

Peter Trifonov; Vera Miloslavskaya

doi:10.1109/JSAC.2015.2504269

Polar Subcodes

Peter Trifonov, Vera Miloslavskaya

Computer Science

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

138 Citations (Scopus)

Abstract

An extension of polar codes is proposed, which allows some of the frozen symbols, called dynamic frozen symbols, to be data-dependent. A construction of polar codes with dynamic frozen symbols, being subcodes of extended BCH codes, is proposed. The proposed codes have higher minimum distance than classical polar codes, but still can be efficiently decoded using the successive cancellation algorithm and its extensions. The codes with Arikan, extended BCH and Reed-Solomon kernel are considered. The proposed codes are shown to outperform LDPC and turbo codes, as well as polar codes with CRC.

Original language	English
Pages (from-to)	254-266
Journal	IEEE Journal on Selected Areas in Communications
Volume	34
Issue number	2
Early online date	26 Nov 2015
DOIs	https://doi.org/10.1109/JSAC.2015.2504269
Publication status	Published - 28 Feb 2016

Access to Document

10.1109/JSAC.2015.2504269

https://hdl.handle.net/1959.11/64593

Handle.net

Persistent link

Cite this

@article{ce0560543386451b9d9c937fee0ced51,

title = "Polar Subcodes",

abstract = "An extension of polar codes is proposed, which allows some of the frozen symbols, called dynamic frozen symbols, to be data-dependent. A construction of polar codes with dynamic frozen symbols, being subcodes of extended BCH codes, is proposed. The proposed codes have higher minimum distance than classical polar codes, but still can be efficiently decoded using the successive cancellation algorithm and its extensions. The codes with Arikan, extended BCH and Reed-Solomon kernel are considered. The proposed codes are shown to outperform LDPC and turbo codes, as well as polar codes with CRC.",

author = "Peter Trifonov and Vera Miloslavskaya",

year = "2016",

month = feb,

day = "28",

doi = "10.1109/JSAC.2015.2504269",

language = "English",

volume = "34",

pages = "254--266",

journal = "IEEE Journal on Selected Areas in Communications",

issn = "1558-0008",

publisher = "Institute of Electrical and Electronics Engineers",

number = "2",

}

TY - JOUR

T1 - Polar Subcodes

AU - Trifonov, Peter

AU - Miloslavskaya, Vera

PY - 2016/2/28

Y1 - 2016/2/28

N2 - An extension of polar codes is proposed, which allows some of the frozen symbols, called dynamic frozen symbols, to be data-dependent. A construction of polar codes with dynamic frozen symbols, being subcodes of extended BCH codes, is proposed. The proposed codes have higher minimum distance than classical polar codes, but still can be efficiently decoded using the successive cancellation algorithm and its extensions. The codes with Arikan, extended BCH and Reed-Solomon kernel are considered. The proposed codes are shown to outperform LDPC and turbo codes, as well as polar codes with CRC.

AB - An extension of polar codes is proposed, which allows some of the frozen symbols, called dynamic frozen symbols, to be data-dependent. A construction of polar codes with dynamic frozen symbols, being subcodes of extended BCH codes, is proposed. The proposed codes have higher minimum distance than classical polar codes, but still can be efficiently decoded using the successive cancellation algorithm and its extensions. The codes with Arikan, extended BCH and Reed-Solomon kernel are considered. The proposed codes are shown to outperform LDPC and turbo codes, as well as polar codes with CRC.

UR - https://www.scopus.com/pages/publications/84962077042

U2 - 10.1109/JSAC.2015.2504269

DO - 10.1109/JSAC.2015.2504269

M3 - Article

SN - 1558-0008

VL - 34

SP - 254

EP - 266

JO - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

IS - 2

ER -

Polar Subcodes

Abstract

Access to Document

Handle.net

Fingerprint

Cite this