Shortened Polar Codes

Vera Miloslavskaya

doi:10.1109/TIT.2015.2453312

Shortened Polar Codes

Vera Miloslavskaya

Computer Science

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

70 Citations (Scopus)

Abstract

An optimization algorithm for finding a shortening pattern and a set of frozen symbols for polar codes is proposed. The structure of polar codes is exploited to eliminate many equivalent shortening patterns, thus reducing the search space. A reduced-complexity suboptimal algorithm is proposed for finding shortening patterns for long polar codes. Shortened codes obtained with the proposed method are shown to outperform low-density parity-check (LDPC) codes.

Original language	English
Pages (from-to)	4852-4865
Journal	IEEE Transactions on Information Theory
Volume	61
Issue number	9
Early online date	8 Jul 2015
DOIs	https://doi.org/10.1109/TIT.2015.2453312
Publication status	Published - 30 Sept 2015

Access to Document

10.1109/TIT.2015.2453312

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

Handle.net

Persistent link

Cite this

@article{935b31fbd5d340b5bdcf0793228a11df,

title = "Shortened Polar Codes",

abstract = "An optimization algorithm for finding a shortening pattern and a set of frozen symbols for polar codes is proposed. The structure of polar codes is exploited to eliminate many equivalent shortening patterns, thus reducing the search space. A reduced-complexity suboptimal algorithm is proposed for finding shortening patterns for long polar codes. Shortened codes obtained with the proposed method are shown to outperform low-density parity-check (LDPC) codes.",

author = "Vera Miloslavskaya",

year = "2015",

month = sep,

day = "30",

doi = "10.1109/TIT.2015.2453312",

language = "English",

volume = "61",

pages = "4852--4865",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "9",

}

TY - JOUR

T1 - Shortened Polar Codes

AU - Miloslavskaya, Vera

PY - 2015/9/30

Y1 - 2015/9/30

N2 - An optimization algorithm for finding a shortening pattern and a set of frozen symbols for polar codes is proposed. The structure of polar codes is exploited to eliminate many equivalent shortening patterns, thus reducing the search space. A reduced-complexity suboptimal algorithm is proposed for finding shortening patterns for long polar codes. Shortened codes obtained with the proposed method are shown to outperform low-density parity-check (LDPC) codes.

AB - An optimization algorithm for finding a shortening pattern and a set of frozen symbols for polar codes is proposed. The structure of polar codes is exploited to eliminate many equivalent shortening patterns, thus reducing the search space. A reduced-complexity suboptimal algorithm is proposed for finding shortening patterns for long polar codes. Shortened codes obtained with the proposed method are shown to outperform low-density parity-check (LDPC) codes.

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

U2 - 10.1109/TIT.2015.2453312

DO - 10.1109/TIT.2015.2453312

M3 - Article

SN - 0018-9448

VL - 61

SP - 4852

EP - 4865

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 9

ER -

Shortened Polar Codes

Abstract

Access to Document

Handle.net

Fingerprint

Cite this