Mixed-Kernels Constructions of Polar Codes

Noam Presman; Ofer Shapira; Simon Litsyn

doi:10.1109/JSAC.2015.2504278

Mixed-Kernels Constructions of Polar Codes

Noam Presman, Ofer Shapira, Simon Litsyn

School of Electrical Engineering

Tel Aviv University

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

37 Scopus citations

Abstract

Mixed kernels of polar codes are mapping functions having inputs of different alphabet sizes that are used to construct polar coding scheme. These schemes are constructed by incorporating several (homogeneous) kernels, each one over different alphabet size. In this paper, the idea of mixed-kernels construction is introduced and analyzed. An asymptotic analysis of the proposed scheme shows that its polarization properties are strongly related to the ones of the constituent kernels. Simulation of finite length instances of the scheme indicate their advantages both in error correction performance and complexity compared to the known polar coding structures.

Original language	English
Article number	7339419
Pages (from-to)	239-253
Number of pages	15
Journal	IEEE Journal on Selected Areas in Communications
Volume	34
Issue number	2
DOIs	https://doi.org/10.1109/JSAC.2015.2504278
State	Published - 1 Feb 2016

Keywords

Polar codes
code decomposition
successive cancellation

Access to Document

10.1109/JSAC.2015.2504278

Cite this

@article{97d6eb23160b4918a2c5a777c290a3ce,

title = "Mixed-Kernels Constructions of Polar Codes",

abstract = "Mixed kernels of polar codes are mapping functions having inputs of different alphabet sizes that are used to construct polar coding scheme. These schemes are constructed by incorporating several (homogeneous) kernels, each one over different alphabet size. In this paper, the idea of mixed-kernels construction is introduced and analyzed. An asymptotic analysis of the proposed scheme shows that its polarization properties are strongly related to the ones of the constituent kernels. Simulation of finite length instances of the scheme indicate their advantages both in error correction performance and complexity compared to the known polar coding structures.",

keywords = "Polar codes, code decomposition, successive cancellation",

author = "Noam Presman and Ofer Shapira and Simon Litsyn",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.",

year = "2016",

month = feb,

day = "1",

doi = "10.1109/JSAC.2015.2504278",

language = "אנגלית",

volume = "34",

pages = "239--253",

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

issn = "0733-8716",

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

number = "2",

}

TY - JOUR

T1 - Mixed-Kernels Constructions of Polar Codes

AU - Presman, Noam

AU - Shapira, Ofer

AU - Litsyn, Simon

PY - 2016/2/1

Y1 - 2016/2/1

N2 - Mixed kernels of polar codes are mapping functions having inputs of different alphabet sizes that are used to construct polar coding scheme. These schemes are constructed by incorporating several (homogeneous) kernels, each one over different alphabet size. In this paper, the idea of mixed-kernels construction is introduced and analyzed. An asymptotic analysis of the proposed scheme shows that its polarization properties are strongly related to the ones of the constituent kernels. Simulation of finite length instances of the scheme indicate their advantages both in error correction performance and complexity compared to the known polar coding structures.

AB - Mixed kernels of polar codes are mapping functions having inputs of different alphabet sizes that are used to construct polar coding scheme. These schemes are constructed by incorporating several (homogeneous) kernels, each one over different alphabet size. In this paper, the idea of mixed-kernels construction is introduced and analyzed. An asymptotic analysis of the proposed scheme shows that its polarization properties are strongly related to the ones of the constituent kernels. Simulation of finite length instances of the scheme indicate their advantages both in error correction performance and complexity compared to the known polar coding structures.

KW - Polar codes

KW - code decomposition

KW - successive cancellation

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

U2 - 10.1109/JSAC.2015.2504278

DO - 10.1109/JSAC.2015.2504278

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84962045976

SN - 0733-8716

VL - 34

SP - 239

EP - 253

JO - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

IS - 2

M1 - 7339419

ER -

Mixed-Kernels Constructions of Polar Codes

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this