Results 11 to 20 of about 1,141 (250)
A Split-Reduced Successive Cancellation List Decoder for Polar Codes [PDF]
IEEE Journal on Selected Areas in Communications, 2016 This paper focuses on low complexity successive cancellation list (SCL) decoding of polar codes. In particular, using the fact that splitting may be unnecessary when the reliability of decoding the unfrozen bit is sufficiently high, a novel splitting rule is proposed.
H Vincent Poor +2 more
exaly +3 more sources
Hardware Architecture for List Successive Cancellation Decoding of Polar Codes [PDF]
IEEE Transactions on Circuits and Systems II: Express Briefs, 2014 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
SC List-Flip Decoding of Polar Codes by Shifted Pruning: A General Approach [PDF]
Entropy, 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
List successive cancellation decoding of polar codes
Electronics Letters, 2012 A list successive cancellation (LSC) decoding algorithm to boost the performance of polar codes is proposed. Compared with traditional successive cancellation decoding algorithms, LSC simultaneously produces at most L locally best candidates during the decoding process to reduce the chance of missing the correct codeword.
K. Chen, K. Niu, J.R. Lin
exaly +2 more sources
An Error Segment Bit-Flip Algorithm for Successive Cancellation List Decoding of Polar Codes
MathematicsPolar 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]
Vojnotehnič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
Iraqi 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
Partitioned successive-cancellation list decoding of polar codes [PDF]
2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2016 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
Applied 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
IEEE 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