Sequential Decoding of Polar Codes

The problem of efficient decoding of polar codes is considered. A low-complexity sequential soft decision decoding algorithm is proposed. It is based on the successive cancellation approach, and it employs most likely codeword probability estimates for selection of a path within the code tree to be...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2014-07, Vol.18 (7), p.1127-1130
Main Authors: Miloslavkaya, V., Trifonov, P.
Format: Article
Language:English
Subjects:
Arrays
Complexity theory
Decoding
Heuristic algorithms
Iterative decoding
Random variables
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The problem of efficient decoding of polar codes is considered. A low-complexity sequential soft decision decoding algorithm is proposed. It is based on the successive cancellation approach, and it employs most likely codeword probability estimates for selection of a path within the code tree to be extended.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2014.2323237