AI Chat AI Image Generator AI Video Text to Speech

Algebraic matching techniques for fast decoding of polar codes with Reed-Solomon kernel

04/02/2018

∙

by Peter Trifonov, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

research

∙ 01/12/2020

Efficient decoding of polar codes with some 16×16 kernels

A decoding algorithm for polar codes with binary 16×16 kernels with pola...

0 Grigorii Trofimiuk, et al. ∙

research

∙ 08/22/2018

Block Sequential Decoding Techniques for Polar Subcodes

A reduced complexity sequential decoding algorithm for polar subcodes is...

0 Grigorii Trofimiuk, et al. ∙

research

∙ 04/16/2020

Sliding Window Polar Codes

We propose a novel coupling technique for the design of polar codes of l...

0 Valerio Bioglio, et al. ∙

research

∙ 03/20/2023

Dynamic Frozen-Function Design for Reed-Muller Codes With Automorphism-Based Decoding

In this letter, we propose to add dynamic frozen bits to underlying pola...

0 Samet Gelincik, et al. ∙

research

∙ 05/22/2020

Large Kernel Polar Codes with efficient Window Decoding

In this paper, we modify polar codes constructed with some 2^t x 2^t pol...

0 Fariba Abbasi, et al. ∙

research

∙ 01/19/2018

Chained Successive Cancellation Decoding of the Extended Golay code

The extended Golay code is shown to be representable as a chained polar ...

0 Peter Trifonov, et al. ∙

research

∙ 09/05/2019

Hyper-Graph-Network Decoders for Block Codes

Neural decoders were shown to outperform classical message passing techn...

0 Eliya Nachmani, et al. ∙