Pith. sign in

REVIEW

Frozen Set Design for Precoded Polar Codes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.10047 v3 pith:YDJTBD7P submitted 2023-11-16 cs.IT math.IT

classification cs.ITmath.IT
keywords frozenboundscodescomplexitydesignperformancepolarprecoded
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper focuses on the frozen set design for precoded polar codes decoded by the successive cancellation list (SCL) algorithm. We propose a novel frozen set design method, whose computational complexity is low due to the use of analytical bounds and constrained frozen set structure. We derive new bounds based on the recently published complexity analysis of SCL decoding with near maximum-likelihood (ML) performance. To predict the ML performance, we employ the state-of-the-art bounds relying on the code weight distribution. The bounds and constrained frozen set structure are incorporated into the genetic algorithm to generate optimized frozen sets with low complexity. Our simulation results show that the constructed precoded polar codes of length 512 have a superior frame error rate (FER) performance compared to the state-of-the-art codes under SCL decoding with various list sizes.

Discussion (0). Continue with ORCID to comment.

Pith tools