Results 1 to 10 of about 7,364 (234)
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
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 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
IEEE Information Theory Workshop, 2005., 2005 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
Shuffled Iterative Decoding [PDF]
IEEE Transactions on Communications, 2005 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
openaire +2 more sources
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 +2 more sources
Optimum non-iterative turbo-decoding [PDF]
Proceedings of 8th International Symposium on Personal, Indoor and Mobile Radio Communications - PIMRC '97, 2002 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
SSCANL decoder based joint iterative detection and decoding algorithm
Dianxin kexue, 2022 In order to improve the receiver performance of the sparse code multiple access (SCMA) system based on polar codes, the cyclic redundancy check (CRC) aided joint iterative detection and decoding receiver scheme based on simplify soft cancellation list ...
Chongyang LIU, Rui GUO
doaj +2 more sources
A Hypergraph Filtering Based Iterative Decoding Approach for Linear Channel Codes
IEEE Access, 2021 Efficient decoding for general linear channel codes has been a long standing problem. Message passing type algorithms can achieve near-optimal performance for channel codes with sparse check matrices and long code-lengths, but they may suffer from ...
Jiaqi He +4 more
doaj +1 more source