Efficient Design and Decoding of Polar Codes

Polar codes are shown to be instances of both generalized concatenated codes and multilevel codes. It is shown that the performance of a polar code can be improved by representing it as a multilevel code and applying the multistage decoding algorithm with maximum likelihood decoding of outer codes....

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2012-11, Vol.60 (11), p.3221-3227
Main Author: Trifonov, P.
Format: Article
Language:English
Subjects:
Approximation
Approximation algorithms
Concatenated codes
Constellation diagram
Decoding
Density
Error probability
Evolution
Gaussian
Mathematical analysis
Maximum likelihood decoding
Multilevel
multilevel codes
Polar codes
Vectors
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:Polar codes are shown to be instances of both generalized concatenated codes and multilevel codes. It is shown that the performance of a polar code can be improved by representing it as a multilevel code and applying the multistage decoding algorithm with maximum likelihood decoding of outer codes. Additional performance improvement is obtained by replacing polar outer codes with other ones with better error correction performance. In some cases this also results in complexity reduction. It is shown that Gaussian approximation for density evolution enables one to accurately predict the performance of polar codes and concatenated codes based on them.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2012.081512.110872