Results 11 to 20 of about 344 (172)
CRC-Aided Adaptive BP Decoding of PAC Codes [PDF]
Although long polar codes with successive cancellation decoding can asymptotically achieve channel capacity, the performance of short blocklength polar codes is far from optimal.
Xianwen Zhang +4 more
doaj +2 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.
Warren Gross +2 more
exaly +3 more sources
An Error Segment Bit-Flip Algorithm for Successive Cancellation List Decoding of Polar Codes
Polar codes have garnered significant attention since they were proposed due to their capacity-achieving properties and their low-complexity decoding process, and they were selected as the coding scheme for the control channel in 5G mobile communication ...
Jing Zhang +3 more
doaj +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
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
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
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

