Results 1 to 10 of about 44,928 (175)

Improved Adaptive Successive Cancellation List Decoding of Polar Codes [PDF]

open access: yesEntropy, 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

Partitioned Successive-Cancellation List Decoding of Polar Codes [PDF]

open access: yes2016 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,
Balatsoukas-Stimming, Alexios   +4 more
core   +2 more sources

Fast Polar Decoding With Successive Cancellation List Creeper Algorithm

open access: yesIEEE 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

Fast Successive-Cancellation List Flip Decoding of Polar Codes [PDF]

open access: yesIEEE 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

Successive Cancellation List Polar Decoder using Log-likelihood Ratios [PDF]

open access: yes2014 48th Asilomar Conference on Signals, Systems and Computers, 2014
Successive cancellation list (SCL) decoding algorithm is a powerful method that can help polar codes achieve excellent error-correcting performance. However, the current SCL algorithm and decoders are based on likelihood or log-likelihood forms, which ...
Parhi, Keshab K., Yuan, Bo
core   +2 more sources

Symbol-Based Successive Cancellation List Decoder for Polar Codes [PDF]

open access: yes2014 IEEE Workshop on Signal Processing Systems (SiPS), 2014
Polar codes is promising because they can provably achieve the channel capacity while having an explicit construction method. Lots of work have been done for the bit-based decoding algorithm for polar codes.
Lin, Jun, Xiong, Chenrong, Yan, Zhiyuan
core   +2 more sources

Restart Mechanisms for the Successive-Cancellation List-Flip Decoding of Polar Codes [PDF]

open access: yesEntropy
Polar 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

Intelligent Path-Selection-Aided Decoding of Polar Codes [PDF]

open access: yesEntropy, 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

An Implementation of List Successive Cancellation Decoder with Large List Size for Polar Codes [PDF]

open access: yes2017 27th International Conference on Field Programmable Logic and Applications (FPL), 2017
Polar codes are the first class of forward error correction (FEC) codes with a provably capacity-achieving capability. Using list successive cancellation decoding (LSCD) with a large list size, the error correction performance of polar codes exceeds ...
Chen, Ji   +6 more
core   +2 more sources

SC List-Flip Decoding of Polar Codes by Shifted Pruning: A General Approach [PDF]

open access: yesEntropy, 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

Home - About - Disclaimer - Privacy