Results 11 to 20 of about 60,317 (301)

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   +3 more sources

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

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   +3 more sources

Fast and Flexible Successive-Cancellation List Decoders for Polar Codes [PDF]

open access: yesIEEE Transactions on Signal Processing, 2017
Polar codes have gained significant amount of attention during the past few years and have been selected as a coding scheme for the next generation of mobile broadband standard. Among decoding schemes, successive-cancellation list (SCL) decoding provides
Seyyed Ali Hashemi   +2 more
exaly   +5 more sources

A Sequence Repetition Node-Based Successive Cancellation List Decoder for 5G Polar Codes: Algorithm and Implementation [PDF]

open access: yesIEEE Transactions on Signal Processing, 2022
Due to the low-latency and high-reliability requirements of 5G, low-complexity node-based successive cancellation list (SCL) decoding has received considerable attention for use in 5G communications systems.
yuqing ren   +2 more
exaly   +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

An Improved Bit-Flipping Algorithm of Successive Cancellation List Decoding for Polar Codes

open access: yesMathematics, 2023
Polar codes, as the coding scheme for the control channel in fifth-generation mobile communication technology (5G), have attracted widespread attention since their proposal.
Desheng Wang   +5 more
doaj   +2 more sources

Joint Successive Cancellation List Decoding for the Double Polar Codes [PDF]

open access: yesIEEE Communications Letters, 2022
As a new joint source-channel coding scheme, the double polar (D-Polar) codes have been proposed recently. In this letter, a novel joint source-channel decoder, namely the joint successive cancellation list (J-SCL) decoder, is proposed to improve the ...
Yanfei Dong   +4 more
semanticscholar   +3 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

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   +3 more sources

Home - About - Disclaimer - Privacy