Algebraic matching techniques for fast decoding of polar codes with Reed-Solomon kernel
Information Theory
2018-04-03 v1 math.IT
Abstract
We propose to reduce the decoding complexity of polar codes with non-Arikan kernels by employing a (near) ML decoding algorithm for the codes generated by kernel rows. A generalization of the order statistics algorithm is presented for soft decoding of Reed-Solomon codes. Algebraic properties of the Reed-Solomon code are exploited to increase the reprocessing order. The obtained algorithm is used as a building block to obtain a decoder for polar codes with Reed-Solomon kernel.
Cite
@article{arxiv.1804.00620,
title = {Algebraic matching techniques for fast decoding of polar codes with Reed-Solomon kernel},
author = {Peter Trifonov},
journal= {arXiv preprint arXiv:1804.00620},
year = {2018}
}
Comments
Accepted to ISIT 2018