Topic
List decoding
About: List decoding is a research topic. Over the lifetime, 7251 publications have been published within this topic receiving 151182 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: This improved decoder makes use of a list of syndrome computations instead of a single one based on hard-decision, and builds soft information at the variable node input by assigning votes weighted by different amplitudes.
Abstract: In this letter, a new algorithm to decode non-binary LDPC (NB-LDPC) codes is proposed. This algorithm is inspired from very low complexity decoders that have been proposed recently, in which only syndrome computations at the check node update are used, while performing symbol-flipping based update at the variable node. Usually, the low complexity decoders based on symbol flipping suffer from a non-negligible performance degradation compared to soft-decision NB-LDPC decoders. Our improved decoder makes use of a list of syndrome computations instead of a single one based on hard-decision, and builds soft information at the variable node input by assigning votes weighted by different amplitudes. Simulations show that using multiple votes with multiple weights yields better performance, while still maintaining the low complexity feature.
33 citations
TL;DR: A family of codes is presented that can correct two-dimensional clusters of errors of size b1 × b2, using simple parity-check codes, and simple encoding and decoding algorithms are presented.
Abstract: The authors present a family of codes that can correct two-dimensional clusters of errors of size b1 × b2, using simple parity-check codes. The new codes are n1 × n2 array codes, where n1 ≥ 2b1b2 – b1, n2 ≥ 2b1b2, b1 divides n1 and b2 divides n2. Simple encoding and decoding algorithms are presented.
33 citations
15 Sep 1999
TL;DR: This work proposes an efficient algorithm of decoding turbo codes that can greatly reduce the delay and computation and uses extrinsic information as the reliability measure of each decoded bit.
Abstract: Turbo decoding can be done in an iterative manner. This requires the delay and computational complexity for decoding an input data. We propose an efficient algorithm of decoding turbo codes that can greatly reduce the delay and computation. It uses extrinsic information as the reliability measure of each decoded bit. When the variance of the extrinsic information exceeds a threshold the iteration for decoding stops with negligible performance loss to conventional decoding algorithm.
33 citations
Patent•
23 Apr 2009TL;DR: In this paper, a decoder includes multiple decoder stages and a controller, which determines whether the decoding operation performed by one of the decoding stages with respect to the received signal is successful.
Abstract: A decoder includes multiple decoder stages and a controller. The decoder stages perform decoding operations with respect to a received signal using corresponding different decoding algorithms. The controller determines whether the decoding operation performed by one of the decoder stages with respect to the received signal is successful, and controls the decoding operation of each of the other decoder stages in response to a result of the determination.
33 citations
TL;DR: In this paper, it was shown that a recently proposed algorithm for decoding cyclic codes may be applied efficiently to all binary cyclic code with tles2 and n < 63.
Abstract: In this paper, we show that a recently proposed algorithm for decoding cyclic codes may be applied efficiently to all binary cyclic codes with tles2 and n<63. This is accomplished by providing structure theorems for the codes in this range and classifying the relevant cases
33 citations