Results 1 to 10 of about 32,959 (158)
An Improved
IEEE Access, 2018 Comparing with hard decision decoding algorithms, soft decoding has a lower probability of bit error but a higher computational complexity. As a maximum-likelihood soft decoding method, the A* algorithm is the most basic and widely used to minimize bit ...
Bin Xu, Chenhao Ying, Yuan Luo
doaj +2 more sources
SCF Decoding Algorithm Based on Log Likelihood Ratio and Channel Polarization Reliability [PDF]
Jisuanji gongcheng, 2022 The traditional Successive Cancellation bit-Flipping(SCF) decoding algorithm only uses the absolute value of Log Like Ratio(LLR) to measure the reliability of information bit decoding results, which leads to a high Block Error Rate(BLER) and more ...
HUANG Sheng, ZHENG Xiufeng, CAO Zhixiong
doaj +1 more source
Reinforcement Learning for Bit-Flipping Decoding of Polar Codes
Entropy, 2021 A traditional successive cancellation (SC) decoding algorithm produces error propagation in the decoding process. In order to improve the SC decoding performance, it is important to solve the error propagation.
Xiumin Wang +3 more
doaj +1 more source
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 channel decoding method for polar codes
Shenzhen Daxue xuebao. Ligong ban, 2022 The polar code is a channel coding technology which can reach the Shannon limit in theory and has the advantage of low coding and decoding complexity. It is now one of the channel coding solutions in 5G communication.
YE Maolin +3 more
doaj +1 more source
Iterative Hard-Decision Decoding Algorithms for Binary Reed-Muller Codes
IEEE Access, 2022 In this paper, novel hard-decision iterative decoding algorithms for binary Reed-Muller (RM) codes are presented. First, two algorithms are devised based on the majority-logic decoding algorithm with reliability measures of the received sequence. The bit-
Yong-Ting Ni +4 more
doaj +1 more source
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
Algorithmic Obfuscation for LDPC Decoders
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2023 In order to protect intellectual property against untrusted foundry, many logic-locking schemes have been developed. The main idea of logic locking is to insert a key-controlled block into a circuit to make the circuit function incorrectly without right keys. However, in the case that the algorithm implemented by the circuit is naturally fault-tolerant
Jingbo Zhou 0002, Xinmiao Zhang 0001
openaire +4 more sources
Applied Sciences, 2022 According to an in-depth analysis of the relationship among n-level polybinary transformation, the time-packing factor and the performance of the decoding algorithm, we find that the appropriate n-level polybinary transformation can improve the ...
Peng Sun +3 more
doaj +1 more source
Simplified polar code decoding algorithm
Dianzi Jishu Yingyong, 2018 Polar code is an error correction coding technique, which can prove from the mathematical point of view to reach Shannon′s limit. However, the traditional decoding algorithm, such as the successive cancellation(SC) and the successive cancellation list ...
Wang Dan +3 more
doaj +1 more source