Results 31 to 40 of about 5,289 (159)
Multi-CRC Polar Codes and M-SCFlip-Based Decoding
IEEE Access, 2019 A multi-cyclic redundancy check (Multi-CRC) polar code construction algorithm is proposed in this paper to solve the error propagation problem of successive cancellation decoding for polar codes.
Rui Guo, Kangni Chen, Huaping Liu
doaj +1 more source
Effective bi-directional overlapped sliding window decoding of SC-LDPC codes
ICT ExpressIn this paper, a bi-directional sliding window decoder is proposed for spatially coupled low-density parity-check (SC-LDPC) codes, which improves the decoding complexity and performance compared to the conventional sliding window decoding (SWD) by ...
Jiho Kim, Hyeong-Gun Joo, Dong-Joon Shin
doaj +1 more source
Threshold Computation for Spatially Coupled Turbo-Like Codes on the AWGN Channel
Entropy, 2021 In this paper, we perform a belief propagation (BP) decoding threshold analysis of spatially coupled (SC) turbo-like codes (TCs) (SC-TCs) on the additive white Gaussian noise (AWGN) channel.
Muhammad Umar Farooq +2 more
doaj +1 more source
Spatially Coupled Generalized Low-Density Parity-Check Codes Over Class-A Impulsive Noise Channels
IEEE Access, 2019 In this paper, a class of spatially coupled generalized low-density parity-check (SC-GLDPC) codes with minimum coupling width is introduced to mitigate the Class-A impulsive noise. Codes with minimum coupling width are beneficial to simple code structure,
Ping Wang, Liuguo Yin, Jianhua Lu
doaj +1 more source
IEEE Access, 2020 As a class of convolutional error-correction codes (ECCs), spatially coupled protograph low-density parity-check (SC-PLDPC) codes with a sufficiently large coupling length can approach the channel capacity under belief propagation (BP) decoding. However,
Yunlong Zhao, Yi Fang, Zhaojie Yang
doaj +1 more source
On the Non-Approximate Successive Cancellation Decoding of Binary Polar Codes With Medium Kernels
IEEE Access, 2023 Polar codes constructed by large kernels can attain better finite length performance than those originating from Arıkan’s $2\times 2$ kernel. However, the successive cancellation (SC) decoding for these polar codes is impractical even for
Zhiliang Huang +3 more
doaj +1 more source
SC List-Flip Decoding of Polar Codes by Shifted Pruning: A General Approach
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 +1 more source
Fast Polar Decoding With Successive Cancellation List Creeper Algorithm
IEEE AccessPolar codes have emerged as a focal point in the field of error-correcting codes, owing to their remarkable capacity-achieving characteristics and their relevance in various modern communication systems. The basic successive cancellation (SC) approach is
Ilya Timokhin, Fedor Ivanov
doaj +1 more source
IEEE Photonics Journal, 2020 The neural successive cancellation (NSC) decoder with tanh-based modified log-likelihood ratio (LLR) is proposed for reducing the decoding latency of polar codes over free space optical (FSO) turbulence channel.
Jiafei Fang +6 more
doaj +1 more source
Photonics, 2022 The bit error ratio (BER) performance of a non-orthogonal multiple access (NOMA) visible light communication (VLC) system is poor due to the unequal distances between adjacent points in the superposition constellation (SC).
Tong Wu +4 more
doaj +1 more source