Results 11 to 20 of about 1,679,303 (194)
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
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
A Complexity Reduction Method for Successive Cancellation List Decoding [PDF]
This brief introduces a hardware complexity reduction method for successive cancellation list (SCL) decoders. Specifically, we propose to use a sorting scheme so that L paths with smallest path metrics are also sorted according to their path indexes for path pruning.
Dizdar, Onur
openaire +6 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
Soft-Output Successive Cancellation List Decoding
We introduce an algorithm for approximating the codebook probability that is compatible with all successive cancellation (SC)-based decoding algorithms, including SC list (SCL) decoding. This approximation is based on an auxiliary distribution that mimics the dynamics of decoding algorithms with an SC decoding schedule.
Ken R Duffy +2 more
exaly +3 more sources
Simplified Successive Cancellation List Decoding of PAC Codes [PDF]
7 pages, 3 ...
Hamid Saber +2 more
core +5 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
Partitioned Successive-Cancellation List Flip Decoding of Polar Codes [PDF]
6 pages, 7 figures, 1 table, Accepted in IEEE SIPS ...
Charles Pillet +3 more
core +5 more sources
Wireless Covert Communication with Polarization Dirty Constellation
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
We utilise a metaheuristic optimisation method, inspired by nature, called the Lévy‐flight firefly algorithm (LFA), to tackle the power regulation and user grouping in the NOMA systems. Abstract The non‐orthogonal multiple access strategies have shown promise to boost fifth generation and sixth generation wireless networks' spectral efficiency and ...
Zaid Albataineh +4 more
wiley +1 more source

