Soft decision decoding of linear block codes based on ordered statistics

Fossorier, M.P.C.; Lin, Shu

doi:10.1109/isit.1994.394624

Cited by 76 publications

(146 citation statements)

References 2 publications

Supporting

Mentioning

144

Contrasting

Order By: Relevance

“…More importantly, we define and measure the decoding (time) complexity O of the list decoding algorithms as the size of the list given by the number of the test codewords that are examined in the decoding process. Hence, the ML decoding (2) has the complexity, O ML = 2 K , which is prohibitive for larger values of K. Among the practical list-based decoding algorithms with the acceptable decoding complexity, we investigate the OSD-based list decoding algorithms [4] for the soft-decision decoding of linear binary block codes. The OSD decoding resumes by reordering the received sequence of reliabilities r i , i = 1, 2, .…”

Section: List Decodingmentioning

confidence: 99%

“…The decoding step to obtain the decisionĉ 0 is referred to as the 0th order OSD reprocessing in [4]. In addition, due to linearity of C, we have that (c 0 ⊕e) ∈ C, and thus, the test error patterns e ∈ E L can be also referred to as the test codewords in the decoding (4).…”

Section: List Decodingmentioning

confidence: 99%

“…Many universal decoding algorithms have been proposed for the decoding of linear binary block codes [3]. The decoding algorithms in [4,5] are based on the testing and re-encoding of the information bits as initially considered by Dorsch [6]. In particular, a list of the likely transmitted codewords is generated using the reliabilities of the received bits, and then, the most likely codeword is selected from this list.…”

Section: Introductionmentioning

confidence: 99%

“…The list of the likely transmitted codewords can be constructed from a set of the test error patterns. The test error patterns can be predefined as in [4,7], and as assumed also in this article, predefined and optimized for the channel statistics as in [8], or defined adaptively for a particular received sequence as suggested in [9]. The complexity of *Correspondence: p.loskot@swan.ac.uk 2 College of Engineering, Swansea University, Singleton Park, Swansea SA2 8PP, UK Full list of author information is available at the end of the article the list decoding can be further reduced by the skipping and stopping rules as shown, for example, in [4,7].…”

Section: Introductionmentioning

confidence: 99%

“…Among numerous variants of the list decoding techniques, the ordered-statistics decoding (OSD) is well known [4,7]. The structural properties of the FEC code are utilized to reduce the OSD complexity in [10].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Ordered statistics-based list decoding techniques for linear binary block codes

Alnawayseh

Loskot

2012

J Wireless Com Network

View full text Add to dashboard Cite

The ordered statistics-based list decoding techniques for linear binary block codes of small to medium block length are investigated. The construction of a list of the test error patterns is considered. The original ordered-statistics decoding (OSD) is generalized by assuming segmentation of the most reliable independent positions (MRIPs) of the received bits. The segmentation is shown to overcome several drawbacks of the original OSD. The complexity of the ordered statistics-based decoding is further reduced by assuming a partial ordering of the received bits in order to avoid the complex Gauss elimination. The probability of the test error patterns in the decoding list is derived. The bit error rate performance and the decoding complexity trade-off of the proposed decoding algorithms is studied by computer simulations. Numerical examples show that, in some cases, the proposed decoding schemes are superior to the original OSD in terms of both the bit error rate performance as well as the decoding complexity.

show abstract

Section: List Decodingmentioning

confidence: 99%

Section: List Decodingmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Ordered statistics-based list decoding techniques for linear binary block codes

Alnawayseh

Loskot

2012

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

Generalised reliability‐based syndrome decoding of LDPC codes

Feng

2008

Trans Emerging Tel Tech

View full text Add to dashboard Cite

SUMMARYAimed at bridging the gap between the maximum likelihood and the suboptimal decoding schemes for short or medium LDPC codes, a generalised ordered statistic decoding (OSD), in the form of syndrome decoding, is presented in the paper. The OSD is invoked once when a nonzero decoding syndrome is returned for the preceded belief propagation (BP) or min-sum (MS) variants. With respect to the OSD with an accumulative reliability metric for the BP in the logarithmic likelihood ratio (LLR) domain, we extend the metric to the BP in the probability domain. Furthermore, the OSD with the metric specific for the MS variants, shows an appealing trade-off between performance and complexity. Meanwhile, when determining the optimal error pattern estimation, an alternative designed to reduce the number of the required real additions proves to be effective.

show abstract

Analysis and performance evaluation of new coding options for space telecommand links ‐ Part I: AWGN channels

Baldi

Chiaraluce

Garello

et al. 2014

Satell Commun Network

View full text Add to dashboard Cite

We investigate and compare, over the additive white Gaussian noise channel, different options for updating the error correcting code currently used in space mission telecommand links. Besides some more consolidated proposals, using low-density parity-check codes, we characterize and assess the performance of alternative schemes, based on parallel turbo codes and soft-decision decoded Bose-Chaudhuri-Hocquenghem (BCH) codes. The analysis considers relevant metrics like the codeword error rate, the frame error rate, and the undetected frame error rate. The considered codes include binary and non-binary low-density parity-check codes, parallel turbo codes and extended BCH codes, with different decoding algorithms. The complexity of the various schemes and possible limits for their application are considered and discussed. Several numerical examples are provided. International Parallel turbo codes are already included in the CCSDS Telemetry Recommendation [13] but with different code parameters. The CCSDS turbo encoder scheme is depicted in Figure 3. In the figure we Figure 3. Consulative Committee for Space Data Systems parallel turbo encoder.

show abstract

Soft decision decoding of linear block codes based on ordered statistics

Cited by 76 publications

References 2 publications

Ordered statistics-based list decoding techniques for linear binary block codes

Ordered statistics-based list decoding techniques for linear binary block codes

Generalised reliability‐based syndrome decoding of LDPC codes

Analysis and performance evaluation of new coding options for space telecommand links ‐ Part I: AWGN channels

Contact Info

Product

Resources

About