Results 1 to 10 of about 6,640 (129)
Improved Adaptive Successive Cancellation List Decoding of Polar Codes [PDF]
Entropy, 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 ...
Xiumin Wang +5 more
doaj +2 more sources
Fast Successive-Cancellation List Flip Decoding of Polar Codes
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
List Decoding of Arıkan’s PAC Codes [PDF]
Entropy, 2021 Polar coding gives rise to the first explicit family of codes that provably achieve capacity with efficient encoding and decoding for a wide range of channels. However, its performance at short blocklengths under standard successive cancellation decoding
Hanwen Yao +2 more
doaj +2 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
SC List-Flip Decoding of Polar Codes by Shifted Pruning: A General Approach [PDF]
Entropy, 2022 In the successive cancellation (SC) list decoding, the tree pruning operation retains the L best paths with respect to a metric at every decoding step. However, the correct path might be among the L worst paths due to the imposed penalties. In this case,
Mohammad Rowshan, Emanuele Viterbo
doaj +2 more sources
CRC-Aided Adaptive BP Decoding of PAC Codes [PDF]
Entropy, 2022 Although long polar codes with successive cancellation decoding can asymptotically achieve channel capacity, the performance of short blocklength polar codes is far from optimal.
Xianwen Zhang +4 more
doaj +2 more sources
Intelligent Path-Selection-Aided Decoding of Polar Codes [PDF]
Entropy, 2023 CRC-aided successive cancellation list (CA-SCL) decoding is a powerful algorithm that dramatically improves the error performance of polar codes. Path selection is a major issue that affects the decoding latency of SCL decoders. Generally, path selection
Hongji Cui, Kai Niu, Shunfu Zhong
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
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
Bidirectional stack decoding of polar codes [PDF]
Vojnotehnički Glasnik, 2021 Introduction/purpose: The paper introduces a reduced latency stack decoding algorithm of polar codes, inspired by the bidirectional stack decoding of convolutional codes and based on the folding technique.
Aleksandar Đ. Minja +2 more
doaj +1 more source