Relaxed Decoding of Polar Codes With Large Kernels
Peter Trifonov · IEEE Communications Letters · 2021
A simplified decoding method for polar codes with large kernels is presented. The proposed approach consists in decoder-side substitution of some submatrices of the polarizing transformation with matrices, which admit simpler evaluation of log-likelihood ratios. This approach enables complexity reduction for the successive cancellation, list and sequential decoding algorithms.