Results 1 to 10 of about 638 (196)
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 +5 more sources
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 +5 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 +4 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 +3 more sources
Fast Polar Decoding With Successive Cancellation List Creeper Algorithm
IEEE Access, 2023 Polar codes have emerged as a focal point in the field of error-correcting codes, owing to their remarkable capacity-achieving characteristics and their relevance in various modern communication systems. The basic successive cancellation (SC) approach is
Ilya Timokhin, Fedor Ivanov
doaj +2 more sources
Low complexity list successive cancellation decoding of polar codes [PDF]
IET Communications, 2014 The authors propose a low complexity list successive cancellation (LCLSC) decoding algorithm, where the advantages of the successive cancellation (SC) decoding and the list successive cancellation (LSC) decoding are both considered. In the proposed decoding, SC decoding instead of LSC decoding is implemented when all information bits from bad ...
Congzhe Cao, Zesong Fei, Jinhong Yuan
exaly +3 more sources
On metric sorting for successive cancellation list decoding of polar codes [PDF]
2015 IEEE International Symposium on Circuits and Systems (ISCAS), 2015 To be presented in 2015 IEEE International Symposium on Circuits and Systems (ISCAS'2015)
Alexios Balatsoukas-Stimming +1 more
exaly +3 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
List successive cancellation decoding of polar codes
Electronics Letters, 2012 A list successive cancellation (LSC) decoding algorithm to boost the performance of polar codes is proposed. Compared with traditional successive cancellation decoding algorithms, LSC simultaneously produces at most L locally best candidates during the decoding process to reduce the chance of missing the correct codeword.
K Niu
exaly +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