Results 11 to 20 of about 52,949 (260)
SC-Fano Decoding of Polar Codes [PDF]
IEEE Access, 2019 For finite-length polar codes, the standard successive cancellation (SC) decoding has been improved, such as SC-List (SCL), SC-Stack (SCS), and SC-Flip (SCF) decodings.
Min-Oh Jeong, Song-Nam Hong
doaj +3 more sources
IEEE Access, 2018 In this paper, we address a number of weaknesses of the windowed decoding of spatially coupled low-density parity-check (SC LDPC) codes and propose three modifications that simultaneously improve its performance, complexity, and latency.
Inayat Ali +4 more
doaj +2 more sources
Simplified Dynamic SC-Flip Polar Decoding [PDF]
ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2020 SC-Flip (SCF) decoding is a low-complexity polar code decoding algorithm alternative to SC-List (SCL) algorithm with small list sizes. To achieve the performance of the SCL algorithm with large list sizes, the Dynamic SC-Flip (DSCF) algorithm was proposed.
Furkan Ercan +3 more
openaire +3 more sources
Reduced-latency SC polar decoder architectures [PDF]
2012 IEEE International Conference on Communications (ICC), 2012 Polar codes have become one of the most favorable capacity achieving error correction codes (ECC) along with their simple encoding method. However, among the very few prior successive cancellation (SC) polar decoder designs, the required long code length makes the decoding latency high. In this paper, conventional decoding algorithm is transformed with
Zhang, Chuan, Yuan, Bo, Parhi, Keshab K.
openaire +2 more sources
Practical Dynamic SC-Flip Polar Decoders: Algorithm and Implementation [PDF]
IEEE Transactions on Signal Processing, 2020 SC-Flip (SCF) is a low-complexity polar code decoding algorithm with improved performance, and is an alternative to high-complexity (CRC)-aided SC-List (CA-SCL) decoding. However, the performance improvement of SCF is limited since it can correct up to only one channel error ($ =1$).
Furkan Ercan +3 more
openaire +2 more sources
Tongxin xuebao, 2023 In order to reduce the decoding latency of the successive cancellation (SC) decoding algorithm further, a kind of fast SC decoding algorithm based on simplified sequence repetition (SR) nodes, namely simplified sequence repetition node-based fast SC ...
Rui GUO, Yang LIU
doaj +2 more sources
Neural-Network-Assisted Polar Code Decoding Schemes
Applied Sciences, 2022 The traditional fast successive-cancellation (SC) decoding algorithm can effectively reduce the decoding steps, but the decoding adopts a sub-optimal algorithm, so it cannot improve the bit error performance. In order to improve the bit error performance
Hengyan Liu +3 more
doaj +1 more source
Polar Codes based on Bit Flipping Improved BP Decoding Algorithm
Guangtongxin yanjiu, 2021 Polar codes is the only coding scheme in the world that has been proved that the Shannon threshold is reachable. Because of the high time delay caused by the serial characteristic of Successive Cancellation (SC) decoding, the Belief Propagation (BP ...
Hua-hua WANG +4 more
doaj +1 more source
BER Evaluation Based SCFlip Algorithm for Polar Codes Decoding
IEEE Access, 2020 Successive cancellation (SC) decoding of polar codes may bring about error propagation that needs to be mitigated. In this paper, we present a new SC Flipping (SCFlip) decoder, named bit error rate (BER) evaluation based SCFlip (BER-SCFlip), which can ...
Xueting Zhang +2 more
doaj +1 more source
Successive Cancellation Decoding of Single Parity-Check Product Codes [PDF]
, 2017 We introduce successive cancellation (SC) decoding of product codes (PCs) with single parity-check (SPC) component codes. Recursive formulas are derived, which resemble the SC decoding algorithm of polar codes. We analyze the error probability of SPC-PCs
Amat, Alexandre Graell i +3 more
core +2 more sources