Results 1 to 10 of about 71,496 (178)
Iterative channel equalization, channel decoding and source decoding [PDF]
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
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 ...
J. Zhang, M.P.C. Fossorier
exaly +4 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
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
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
Geiselhart, Marvin +4 more
openaire +3 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
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.
J. Justesen, T. Hoholdt, J. Hjaltason
openaire +3 more sources
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.
Winstead, Chris +3 more
openaire +2 more sources
Optimum non-iterative turbo-decoding [PDF]
By observing the structure of the decoder's trellis a new, non-iterative turbo-decoder based on a super-trellis structure is proposed, which exhibits the same decoding complexity as a conventional convolutional decoder possessing an identical number of trellis states.
Breiling, M, Hanzo, L
openaire +2 more sources
Erasure Codes with a Banded Structure for Hybrid Iterative-ML Decoding [PDF]
This paper presents new FEC codes for the erasure channel, LDPC-Band, that have been designed so as to optimize a hybrid iterative-Maximum Likelihood (ML) decoding.
Cunche, Mathieu +3 more
core +5 more sources

