Complete State Critical Set Based SCLF Decoding Algorithm for Polar Codes

The revised critical set (RCS) used by successive cancellation list flip (SCLF) decoding algorithm only retains the unreliable bits of SC state.So, the bits of information in the RCS are not comprehensive enough.Aiming at this problem, this paper proposed a kind of complete state critical set (CSCS) based SCLF decoding algorithm for polar codes.In order to obtain a more complete flipping set of states, the proposed CSCS is constructed according to different path splitting states after pruning.According to different states of CSCS, hard decision and path metric (PM) correction methods are adopted respectively, to cut off the wrong path and keep the correct path, so as to achieve bit flipping function.Experimental results show that compared with the traditional SCLF decoding algorithm, the performance of complete state SCLF (CS-SCLF) decoding algorithm is improved.At the same time, the average flipping number of flips is reduced without loss of decoding performance.

Publication Details

Journal
KSII Transactions on Internet and Information Systems
Published
2024-12-31
DOI
https://doi.org/10.3837/tiis.2024.12.011
Primary Topic
Error Correcting Code Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Complete State Critical Set Based SCLF Decoding Algorithm for Polar Codes

KSII Transactions on Internet and Information Systems
Error Correcting Code Techniques
article

Complete State Critical Set Based SCLF Decoding Algorithm for Polar Codes

article en

Abstract

The revised critical set (RCS) used by successive cancellation list flip (SCLF) decoding algorithm only retains the unreliable bits of SC state.So, the bits of information in the RCS are not comprehensive enough.Aiming at this problem, this paper proposed a kind of complete state critical set (CSCS) based SCLF decoding algorithm for polar codes.In order to obtain a more complete flipping set of states, the proposed CSCS is constructed according to different path splitting states after pruning.According to different states of CSCS, hard decision and path metric (PM) correction methods are adopted respectively, to cut off the wrong path and keep the correct path, so as to achieve bit flipping function.Experimental results show that compared with the traditional SCLF decoding algorithm, the performance of complete state SCLF (CS-SCLF) decoding algorithm is improved.At the same time, the average flipping number of flips is reduced without loss of decoding performance.

KSII Transactions on Internet and Information SystemsVol. 18(12)
Climate action
Openalex Percentile: Top 71%
Error Correcting Code Techniques
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.