|
This article is cited in 3 scientific papers (total in 3 papers)
Coding Theory
Design and decoding of polar codes with large kernels: a survey
P. V. Trifonov ITMO University, St.-Petersburg, Russia
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.
Keywords:
polar codes, large kernels.
Received: 29.12.2022 Revised: 22.02.2023 Accepted: 22.02.2023
Citation:
P. V. Trifonov, “Design and decoding of polar codes with large kernels: a survey”, Probl. Peredachi Inf., 59:1 (2023), 25–45; Problems Inform. Transmission, 59:1 (2023), 22–40
Linking options:
https://www.mathnet.ru/eng/ppi2390 https://www.mathnet.ru/eng/ppi/v59/i1/p25
|
|