Results 1 to 10 of about 53,028 (278)

SC-Fano Decoding of Polar Codes [PDF]

IEEE Access, 2019
For finite-length polar codes, the standard successive cancellation (SC) decoding has been improved, such as SC-List (SCL), SC-Stack (SCS), and SC-Flip (SCF) decodings.
Minoh Jeong, Song-Nam Hong
exaly   +5 more sources

A latency‐reduced SC flip decoding algorithm for polar codes

IET Communications, 2022
The successive cancellation flip (SC Flip) decoding algorithm was recently suggested for decoding polar codes, which could improve the performance of the frame error rate (FER).
Dong Yang, Yinyou Mao, Xingcheng Liu
doaj   +2 more sources

Quasi-Optimal Path Convergence-Aided Automorphism Ensemble Decoding of Reed–Muller Codes [PDF]

Entropy
By exploiting the rich automorphisms of Reed–Muller (RM) codes, the recently developed automorphism ensemble (AE) successive cancellation (SC) decoder achieves a near-maximum-likelihood (ML) performance for short block lengths.
Kairui Tian, He Sun, Yukai Liu, Rongke Liu   +3 more
doaj   +2 more sources

Threshold Successive Cancellation Flip Decoding Algorithm for Polar Codes: Design and Performance [PDF]

Entropy
In this paper, we propose the threshold successive cancellation flip (Th-SCF) decoding algorithm for polar codes, which enhances the performance of the SC decoder while maintaining low complexity.
Zhicheng Liu, Liuquan Yao, Shuai Yuan, Guiying Yan, Zhiming Ma, Yuting Liu   +5 more
doaj   +2 more sources

Improved Successive Cancellation Decoding of Polar Codes

IEEE Transactions on Communications, 2013
As improved versions of successive cancellation (SC) decoding algorithm, successive cancellation list (SCL) decoding and successive cancellation stack (SCS) decoding are used to improve the finite-length performance of polar codes.
Kai Chen, Kai Niu, Jiaru Lin
exaly   +3 more sources

Low-Complexity Automorphism Ensemble Decoding of Reed-Muller Codes Using Path Pruning [PDF]

Entropy
The newly developed automorphism ensemble decoder (AED) leverages the rich automorphisms of Reed–Muller (RM) codes to achieve near maximum likelihood (ML) performance at short code lengths.
Kairui Tian, Rongke Liu, Zheng Lu
doaj   +2 more sources

Improving Windowed Decoding of SC LDPC Codes by Effective Decoding Termination, Message Reuse, and Amplification

IEEE Access, 2018
In this paper, we address a number of weaknesses of the windowed decoding of spatially coupled low-density parity-check (SC LDPC) codes and propose three modifications that simultaneously improve its performance, complexity, and latency.
Inayat Ali, Jong-Hwan Kim, Sang-Hyo Kim, Heeyoul Kwak, Jong-Seon No   +4 more
doaj   +2 more sources

Simplified Dynamic SC-Flip Polar Decoding [PDF]

ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2020
SC-Flip (SCF) decoding is a low-complexity polar code decoding algorithm alternative to SC-List (SCL) algorithm with small list sizes. To achieve the performance of the SCL algorithm with large list sizes, the Dynamic SC-Flip (DSCF) algorithm was proposed.
Furkan Ercan, Thibaud Tonnellier, Nghia Doan, Warren J. Gross   +3 more
openaire   +3 more sources

SCF Decoding Algorithm Based on Log Likelihood Ratio and Channel Polarization Reliability [PDF]

Jisuanji gongcheng, 2022
The traditional Successive Cancellation bit-Flipping(SCF) decoding algorithm only uses the absolute value of Log Like Ratio(LLR) to measure the reliability of information bit decoding results, which leads to a high Block Error Rate(BLER) and more ...
HUANG Sheng, ZHENG Xiufeng, CAO Zhixiong
doaj   +1 more source

Reinforcement Learning for Bit-Flipping Decoding of Polar Codes

Entropy, 2021
A traditional successive cancellation (SC) decoding algorithm produces error propagation in the decoding process. In order to improve the SC decoding performance, it is important to solve the error propagation.
Xiumin Wang, Jinlong He, Jun Li, Liang Shan   +3 more
doaj   +1 more source