Results 11 to 20 of about 212 (168)
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
An improved path splitting strategy on successive cancellation list decoder for polar codes
The performance of the cyclic redundancy check aided successive cancellation list (CA‐SCL) decoder for polar codes exceeds that of the Turbo codes and the Low Density Parity Check (LDPC) codes adopted in the World Interoperability for Microwave Access ...
Yunlong Peng, Jingyun Bao, Xingcheng Liu
doaj +1 more source
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 +2 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
ADAPTIVE REDUCED PATHS SUCCESSIVE CANCELLATION LIST DECODING FOR POLAR CODES
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
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 +3 more sources
Successive Cancellation Automorphism List Decoding of Polar Codes
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
openaire +2 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.
openaire +3 more sources
Joint Successive Cancellation List Decoding for the Double Polar Codes
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 decoding performance of the D-Polar codes.
Yanfei Dong +4 more
openaire +2 more sources

