Optimizing Polar Codes for Reduced Latency Successive Cancellation List Decoder

This letter presents the application of genetic algorithms (GenAlg) to optimize polar codes for reducing the decoding latency of fast cyclic redundancy check aided successive cancellation list decoders. The theoretical decoding time steps (TS) in code construction are assessed under the constraint of a maximum special node size. The GenAlg employed iteratively utilizes mutation and crossover to reduce decoding TS by generating more large special nodes while maintaining acceptable performance. By avoiding redundant simulations, the GenAlg iterations are reduced by 5 orders of magnitude. Synthesis results indicate that the proposed scheme can reduce latency by up to 20.2% compared to 5G codes.

Authors

Institutions

Publication Details

Journal
IEEE Communications Letters
Published
2024-12-23
DOI
https://doi.org/10.1109/lcomm.2024.3521080
Citations
1
Primary Topic
Error Correcting Code Techniques
Type
article
Field-Weighted Citation Impact
0.35

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimizing Polar Codes for Reduced Latency Successive Cancellation List Decoder

Huayi Zhou, Yuqing Ren, Warren J. Gross, Jiajie Li
1 citations
IEEE Communications Letters
Error Correcting Code Techniques
0.35
article

Optimizing Polar Codes for Reduced Latency Successive Cancellation List Decoder

Huayi Zhou, Yuqing Ren, Warren J. Gross, Jiajie Li
article en
1 citations

Abstract

This letter presents the application of genetic algorithms (GenAlg) to optimize polar codes for reducing the decoding latency of fast cyclic redundancy check aided successive cancellation list decoders. The theoretical decoding time steps (TS) in code construction are assessed under the constraint of a maximum special node size. The GenAlg employed iteratively utilizes mutation and crossover to reduce decoding TS by generating more large special nodes while maintaining acceptable performance. By avoiding redundant simulations, the GenAlg iterations are reduced by 5 orders of magnitude. Synthesis results indicate that the proposed scheme can reduce latency by up to 20.2% compared to 5G codes.

IEEE Communications LettersVol. 29(3)
McGill University (CA), École Polytechnique Fédérale de Lausanne (CH)
National Natural Science Foundation of China, Natural Science Foundation of Jiangsu Province
Openalex Percentile: Top 35%
Error Correcting Code Techniques
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.