Results 1 to 10 of about 1,103,393 (348)
Stochastic iterative decoders [PDF]
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., 2005 This paper presents a stochastic algorithm for iterative error control decoding. We show that the stochastic decoding algorithm is an approximation of the sum-product algorithm. When the code's factor graph is a tree, as with trellises, the algorithm approaches maximum a-posteriori decoding.
Winstead, Chris +3 more
openaire +4 more sources
Learned Neural Iterative Decoding for Lossy Image Compression Systems [PDF]
Data Compression Conference, 2018 For lossy image compression systems, we develop an algorithm, iterative refinement, to improve the decoder's reconstruction compared to standard decoding techniques.
Alexander Ororbia +6 more
semanticscholar +2 more sources
An Efficient Two-Stage Decoding Scheme for LDPC-CRC Concatenated Codes [PDF]
EntropyIn modern communication systems, the concatenation of a low-density parity-check (LDPC) code with a cyclic redundancy check (CRC) code is commonly used for error correction.
Lingjun Kong +3 more
doaj +2 more sources
Iterative channel equalization, channel decoding and source decoding [PDF]
2005 IEEE 61st Vehicular Technology Conference, 2005 The performance of soft source decoding is evaluated over dispersive AWGN channels. By employing source codes having error-correcting capabilities, such as Reversible Variable-Length Codes (RVLCs) and Variable-Length Error-Correcting (VLEC) codes, the ...
Hanzo, L., Wang, J., Yang, L-L.
core +3 more sources
Low-Density Parity-Check Decoding Algorithm Based on Symmetric Alternating Direction Method of Multipliers [PDF]
EntropyThe Alternating Direction Method of Multipliers (ADMM) has proven to be an efficient approach for implementing linear programming (LP) decoding of low-density parity-check (LDPC) codes.
Ji Zhang +5 more
doaj +2 more sources
Iterative decoding beyond belief propagation
2010 Information Theory and Applications Workshop (ITA), 2010 At the heart of modern coding theory lies the fact that low-density parity-check (LDPC) codes can be efficiently decoded by belief propagation (BP). The BP is an inference algorithm which operates on a graphical model of a code, and lends itself to low-complexity and high-speed implementations, making it the algorithm of choice in many applications. It
Planjery, Shiva +4 more
openaire +2 more sources
Improved Iterative Decoding of Network-Channel Codes for Multiple-Access Relay Channel. [PDF]
Int Sch Res Notices, 2015 Majumder S, Verma S.
europepmc +3 more sources
Convergence of iterative decoding
Electronics Letters, 1999 A novel method for visualising the convergence behaviour of iterative decoding schemes is proposed. Each constituent decoder is represented by a mutual information transfer characteristic which describes the flow of extrinsic information through the soft in/soft out decoder.
S. Brink
openaire +2 more sources
Iterative Reed-Muller Decoding [PDF]
2021 11th International Symposium on Topics in Coding (ISTC), 2021 Reed-Muller (RM) codes are known for their good maximum likelihood (ML) performance in the short block-length regime. Despite being one of the oldest classes of channel codes, finding a low complexity soft-input decoding scheme is still an open problem. In this work, we present a belief propagation (BP) decoding architecture for RM codes based on their
Geiselhart, Marvin +4 more
openaire +3 more sources
Symbol-level iterative information set decoding of RS codes
Alexandria Engineering Journal, 2023 This paper presents the implementation of a low-complex iterative symbol-level decoding scheme for Reed-Solomon codes. Most soft-decision iterative decoders for Reed-Solomon codes work on a bit level due to the efficient passing of soft information due ...
Yuval Genga +2 more
doaj +1 more source