Results 11 to 20 of about 1,038 (151)
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 +4 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
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
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
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
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
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
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
ADAPTIVE REDUCED PATHS SUCCESSIVE CANCELLATION LIST DECODING FOR POLAR CODES
Iraqi Journal of Information & Communication Technology, 2021 Adaptive Reduced Path Successive Cancellation List (ARP-SCL) decoding for polar codes is proposed in this paper. The aim here is to reduce the complexity of the conventional Successive Cancellation List (SCL) and a previously proposed Reduced Path SCL (
Walled Abdulwahab, Abdulkareem Kadhim
doaj +1 more source
Partitioned successive-cancellation list decoding of polar codes [PDF]
2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2016 Successive-cancellation list (SCL) decoding is an algorithm that provides very good error-correction performance for polar codes. However, its hardware implementation requires a large amount of memory, mainly to store intermediate results. In this paper, a partitioned SCL algorithm is proposed to reduce the large memory requirements of the conventional
Seyyed Ali Hashemi +4 more
openaire +2 more sources