Results 71 to 80 of about 1,239,425 (219)
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
Sparse Graphs for Belief Propagation Decoding of Polar Codes [PDF]
International Symposium on Information Theory, 2017 We describe a novel approach to interpret a polar code as a low-density parity-check (LDPC)-like code with an underlying sparse decoding graph. This sparse graph is based on the encoding factor graph of polar codes and is suitable for conventional belief
Sebastian Cammerer +3 more
semanticscholar +1 more source
Belief Propagation Bit-Flip Decoder for Polar Codes [PDF]
IEEE Access, 2019 The bit-flip method has been successfully applied to the successive cancellation (SC) decoder to improve the block error rate (BLER) performance for polar codes in the finite code length region. However, due to the sequential decoding, the SC decoder inherently suffers from longer decoding latency than that of the belief propagation (BP) decoder with ...
Yongrun Yu +3 more
openaire +2 more sources
Erasure Decoding for Quantum LDPC Codes via Belief Propagation with Guided Decimation [PDF]
2024 60th Annual Allerton Conference on Communication, Control, and ComputingQuantum low-density parity-check (LDPC) codes are a promising family of quantum error-correcting codes for fault tolerant quantum computing with low overhead.
Mert Gökduman +2 more
semanticscholar +1 more source
Neural Belief Propagation Decoding of CRC-Polar Concatenated Codes [PDF]
ICC 2019 - 2019 IEEE International Conference on Communications (ICC), 2018 Polar codes are the first class of error correcting codes that provably achieve the channel capacity at infinite code length. They were selected for use in the fifth generation of cellular mobile communications (5G).
Nghia Doan +4 more
semanticscholar +1 more source
Low Complexity Approach for High Throughput Belief-Propagation based Decoding of LDPC Codes
Advances in Electrical and Computer Engineering, 2013 The paper proposes a low complexity belief propagation (BP) based decoding algorithm for LDPC codes. In spite of the iterative nature of the decoding process, the proposed algorithm provides both reduced complexity and increased BER performances as ...
BOT, A. +3 more
doaj +1 more source
A Polar Subcode Approach to Belief Propagation List Decoding
, 2022 Permutation decoding gained recent interest as it can exploit the symmetries of a code in a parallel fashion. Moreover, it has been shown that by viewing permuted polar codes as polar subcodes, the set of usable permutations in permutation decoding can ...
Geiselhart, Marvin +3 more
core
Improved belief propagation decoding algorithm based on decoupling representation of Pauli operators for quantum LDPC codes [PDF]
, 2023 We propose a new method called decoupling representation to represent Pauli operators as vectors over $GF(2)$, based on which we propose partially decoupled belief propagation and fully decoupled belief propagation decoding algorithm for quantum low ...
Zhong, Kaixin +5 more
core +1 more source
Low complexity belief propagation polar code decoder
2015 IEEE Workshop on Signal Processing Systems (SiPS), 2015 6 ...
Syed Mohsin Abbas +3 more
openaire +3 more sources
Fifteen Years of Quantum LDPC Coding and Improved Decoding Strategies
IEEE Access, 2015 The near-capacity performance of classical low-density parity check (LDPC) codes and their efficient iterative decoding makes quantum LDPC (QLPDC) codes a promising candidate for quantum error correction.
Zunaira Babar +4 more
doaj +1 more source