Results 11 to 20 of about 1,678,536 (296)
A Fully-Parallel Turbo Decoding Algorithm [PDF]
IEEE Transactions on Communications, 2015 This paper proposes a novel alternative to the Logarithmic Bahl-Cocke-Jelinek-Raviv (Log-BCJR) algorithm for turbo decoding, yielding significantly improved processing throughput and latency. While the Log-BCJR processes turbo-encoded bits in a serial forwards-backwards manner, the proposed algorithm operates in a fully-parallel manner, processing all ...
Maunder, R.G.
openaire +6 more sources
Decoding algorithms for surface codes [PDF]
QuantumQuantum technologies have the potential to solve certain computationally hard problems with polynomial or super-polynomial speedups when compared to classical methods.
Antonio deMarti iOlius +4 more
doaj +5 more sources
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
Adaptive nested trellis decoding for block codes. [PDF]
, 1994 A new adaptive trellis decoding technique for block codes is proposed. The technique is based on an encoding technique which allows the design of almost all known linear codes together with their minimal trellises.
Markarian, G. S. +5 more
core +5 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
Low latency low power bit flipping algorithms for LDPC decoding [PDF]
, 2010 Low Density Parity Check (LDPC) codes have been adopted in a number of wired and wireless communication standards due to their improved error correcting ability and relatively simple decoder structure.
Koçak, T +11 more
core +1 more source
On optimal and near-optimal turbo decoding using generalized max operator [PDF]
, 2009 Motivated by a recently published robust geometric programming approximation, a generalized approach for approximating efficiently the max* operator is presented.
PAPAHARALABOS S +5 more
core +1 more source
Non-recursive max* operator with reduced implementation complexity for turbo decoding [PDF]
, 2012 In this study, the authors deal with the problem of how to effectively approximate the max?? operator when having n > 2 input values, with the aim of reducing implementation complexity of conventional Log-MAP turbo decoders.
P. T. Mathiopoulos +5 more
core +1 more source
IEEE Access, 2021 We propose generalized partially information coupled (PIC) polar codes and their construction method. In the proposed codes, each code block (CB) shares systematic information bits partially with J adjacent CBs on each side, where J is referred to as the
Hyoungbae Ahn +2 more
doaj +1 more source
On the Power of Relaxed Local Decoding Algorithms [PDF]
SIAM Journal on Computing, 2020 A locally decodable code (LDC) C : \{ 0, 1\} k \rightarrow \{ 0, 1\} n is an error correcting code wherein individual bits of the message can be recovered by only querying a few bits of a noisy codeword. LDCs found a myriad of applications both in theory and in practice, ranging from probabilistically checkable proofs to distributed storage.
Tom Gur, Oded Lachish
openaire +5 more sources