Results 1 to 10 of about 45,010 (270)

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 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

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

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

Bidirectional stack decoding of polar codes [PDF]

open access: yesVojnotehnič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

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

Wireless Covert Communication with Polarization Dirty Constellation

open access: yesApplied Sciences, 2023
Wireless covert communication is an emerging communication technique that prevents eavesdroppers. This paper presents a novel approach to wireless covert communication based on polar codes with dirty constellation polarization.
Mingyu Hu, Sen Qiao, Xiaopeng Ji
doaj   +1 more source

Interleaved Local Sorting for Successive Cancellation List Decoding of Polar Codes

open access: yesIEEE Access, 2021
In the successive cancellation list decoding of polar codes, the metric sorting dominates the overall decoding latency. To reduce the latency of metric sorting, this paper proposes a new sorting method, called interleaved local sorting, which divides the
Wooyoung Kim   +3 more
doaj   +1 more source

A Low-latency Successive Cancellation List Decoding Algorithm for Polar Codes [PDF]

open access: yesJisuanji gongcheng, 2018
In order to further reduce the decoding delay,a low-latency adaptive Successive Cancellation List(SCL) decoding algorithm based on path reuse is proposed.A repeated path replicating scheme based on CRC check is adopted for the phenomenon that there is a ...
LIU Yajun,LI Shibao,LIU Jianhang,CHEN Haihua
doaj   +1 more source

Home - About - Disclaimer - Privacy