Abstract:
We present techniques for the construction of polar codes with large kernels and
their decoding. A crucial problem in the implementation of the successive cancellation decoding
algorithm and its derivatives is kernel processing, i.e., fast evaluation of the log-likelihood ratios
for kernel input symbols. We discuss window and recursive trellis processing methods. We
consider techniques for evaluation of the reliability of bit subchannels and for obtaining codes
with improved distance properties.
Fulltext:
PDF file (320 kB)
First page:
PDF file