Improved Adaptive Successive Cancellation List Decoding of Polar Codes [PDF]
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 successive cancellation list (SCL) algorithm, these two algorithms discard the previous decoding result ...
Wang X +5 more
europepmc +5 more sources
LLR-Based Successive Cancellation List Decoding of Polar Codes [PDF]
We show that successive cancellation list decoding can be formulated exclusively using log-likelihood ratios. In addition to numerical stability, the log-likelihood ratio based formulation has useful properties which simplify the sorting step involved in successive cancellation list decoding.
Alexios Balatsoukas-Stimming +2 more
openaire +9 more sources
Partitioned successive-cancellation list decoding of polar codes [PDF]
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 +4 more sources
Successive Cancellation Automorphism List Decoding of Polar Codes [PDF]
The discovery of suitable automorphisms of polar codes gained a lot of attention by applying them in Automorphism Ensemble Decoding (AED) to improve the error-correction performance, especially for short block lengths. This paper introduces Successive Cancellation Automorphism List (SCAL) decoding of polar codes as a novel application of automorphisms ...
Lucas Johannsen +5 more
core +5 more sources
Hardware Architecture for List Successive Cancellation Decoding of Polar Codes [PDF]
This brief presents a hardware architecture and algorithmic improvements for list successive cancellation (SC) decoding of polar codes. More specifically, we show how to completely avoid copying of the likelihoods, which is algorithmically the most cumbersome part of list SC decoding.
Alexios Balatsoukas-Stimming +3 more
openaire +3 more sources
Successive Cancellation Sampling Decoder: An Attempt to Analyze List Decoding Theoretically [PDF]
6 pages, 4 figures, ISIT ...
Hsin-Po Wang 0001, Venkatesan Guruswami
core +6 more sources
An implementation of list successive cancellation decoder with large list size for polar codes [PDF]
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 other well-known FEC codes.
ChenYang Xia +6 more
openaire +3 more sources
Symbol-Decision Successive Cancellation List Decoder for Polar Codes [PDF]
13 pages, 17 ...
Chenrong Xiong, Zhiyuan Yan
exaly +3 more sources
On Path Memory in List Successive Cancellation Decoder of Polar Codes [PDF]
Polar code is a breakthrough in coding theory. Using list successive cancellation decoding with large list size L, polar codes can achieve excellent error correction performance. The L partial decoded vectors are stored in the path memory and updated according to the results of list management.
ChenYang Xia +3 more
openaire +3 more sources
Bidirectional stack decoding of polar codes [PDF]
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

