Results 1 to 10 of about 7,963 (152)
Shuffled Iterative Decoding [PDF]
Shuffled versions of iterative decoding of low-density parity-check codes and turbo codes are presented. The proposed schemes have about the same computational complexity as the standard versions, and converge faster. Simulations show that the new schedules offer better performance/complexity tradeoffs, especially when the maximum number of iterations ...
Juntan Zhang, M P C Fossorier
exaly +3 more sources
An Efficient Two-Stage Decoding Scheme for LDPC-CRC Concatenated Codes [PDF]
In 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 Decoding of Concatenated Codes: A Tutorial
The turbo decoding algorithm of a decade ago constituted a milestone in error-correction coding for digital communications, and has inspired extensions to generalized receiver topologies, including turbo equalization, turbo synchronization, and turbo ...
Phillip A. Regalia
doaj +3 more sources
Low-Density Parity-Check Decoding Algorithm Based on Symmetric Alternating Direction Method of Multipliers [PDF]
The 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
Convergence of iterative decoding
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 Ten Brink
exaly +2 more sources
Iterative Reed–Muller Decoding [PDF]
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
Marvin Geiselhart +4 more
openaire +2 more sources
Symbol-level iterative information set decoding of RS codes
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
Stochastic iterative decoders [PDF]
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.
Chris Winstead +3 more
openaire +2 more sources
We analyze the relation between iterative decoding and the properties of the extended parity check matrix. By considering a modified version of bit flipping, which produces a list of decoded words, we derive several relations between decodable error patterns and parameters of the code.
Justesen, Jørn +2 more
openaire +1 more source
New criteria for iterative decoding [PDF]
Iterative decoding was not originally introduced as the solution to an optimization problem rendering the analysis of its convergence very difficult. In this paper, we investigate the link between iterative decoding and classical optimization techniques.
Alberge, Florence +2 more
openaire +4 more sources

