DocumentCode
7392
Title
Shortened Polar Codes
Author
Miloslavskaya, Vera
Author_Institution
Dept. of Distrib. Comput. & Networking, Peter the Great St. Petersburg Polytech. Univ., St. Petersburg, Russia
Volume
61
Issue
9
fYear
2015
fDate
Sept. 2015
Firstpage
4852
Lastpage
4865
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.
Keywords
decoding; optimisation; low-density parity-check codes; optimization algorithm; polar codes; reduced-complexity suboptimal algorithm; sequential decoding; successive cancellation decoding; Arrays; Decoding; Error probability; Heuristic algorithms; Iron; Linear codes; Optimization; Polar codes; sequential decoding; shortening; successive cancellation decoding;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2015.2453312
Filename
7152894
Link To Document