Fast Successive-Cancellation List Flip Decoding of Polar Codes [PDF]
IEEE Access, 2022 This work presents a fast successive-cancellation list flip (Fast-SCLF) decoding algorithm for polar codes that addresses the high latency issue associated with the successive-cancellation list flip (SCLF) decoding algorithm.
Nghia Doan +2 more
doaj +3 more sources
Adaptive List Flip Decoder for Polar Codes with High-Order Error Correction Capability and a Simplified Flip Metric [PDF]
Entropy, 2022 Designing an efficient decoder is an effective way to improve the performance of polar codes with limited code length. List flip decoders have received attention due to their good performance trade-off between list decoders and flip decoders.
Yansong Lv +4 more
doaj +2 more sources
Higher-Order Belief Propagation Correction Decoder for Polar Codes [PDF]
Entropy, 2022 Belief propagation (BP) decoding for polar codes has been extensively studied because of its inherent parallelism. However, its performance remains inferior to that of successive cancellation list decoding (SCL) due to the structure of the decoding graph.
Meng Zhang +3 more
doaj +2 more sources
Bit-Flip Algorithm for Successive Cancellation List Decoder of Polar Codes
IEEE Access, 2019 A successive cancellation list (SCL) decoder with the assistance of a cyclic redundancy check (CRC) can provide competitive decoding performance for polar codes compared with the state-of-the-art codes.
Fengyi Cheng +3 more
doaj +3 more sources
Restart Mechanisms for the Successive-Cancellation List-Flip Decoding of Polar Codes [PDF]
EntropyPolar codes concatenated with a cyclic redundancy check (CRC) code have been selected in the 5G standard with the successive-cancellation list (SCL) of list size L = 8 as the baseline algorithm.
Charles Pillet +3 more
doaj +2 more sources
Improving Polar-Coded SCMA System by Information Coupling and Parity Check [PDF]
Sensors, 2020 In this paper, the uplink information-coupled polar-coded sparse code multiple access (PC-SCMA) system is proposed. For this system, we first design the encoding method of systematic joint parity check and CRC-aided (PCCA) polar code.
Xi Wu, Yafeng Wang
doaj +2 more sources
Low-Complexity Automorphism Ensemble Decoding of Reed-Muller Codes Using Path Pruning [PDF]
EntropyThe 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
Quasi-Optimal Path Convergence-Aided Automorphism Ensemble Decoding of Reed–Muller Codes [PDF]
EntropyBy 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 +3 more
doaj +2 more sources
A Split-Reduced Successive Cancellation List Decoder for Polar Codes [PDF]
IEEE Journal on Selected Areas in Communications, 2016 This paper focuses on low complexity successive cancellation list (SCL) decoding of polar codes. In particular, using the fact that splitting may be unnecessary when the reliability of decoding the unfrozen bit is sufficiently high, a novel splitting rule is proposed.
H Vincent Poor +2 more
exaly +3 more sources
Improved Adaptive Successive Cancellation List Decoding of Polar Codes [PDF]
Entropy (Basel), 2019 Although the adaptive successive cancellation list (AD-SCL) algorithm and the segmented-CRC adaptive successive cancellation list (SCAD-SCL) algorithm based on the cyclic redundancy check (CRC) can greatly reduce the computational complexity of the successive cancellation list (SCL) algorithm, these two algorithms discard the previous decoding result ...
Wang X +5 more
europepmc +4 more sources