IEEE Communications Letters

On combining Chase-2 and GMD decoding algorithms for nonbinary block codes

H. Tang, Y. Liu, M.P.C. Fossorier, Shu Lin

Published May 1, 2001• 57 citations

Abstract

In this letter, a class of algorithms that combines Chase-2 and GMD (generalized minimum distance) decoding algorithms is presented for nonbinary block codes. This approach provides additional trade-offs between error performance and decoding complexity. Reduced-complexity versions of the algorithms with practical interests are then provided and simulated.

DOI: 10.1109/4234.922762

Related papers

Chase-type and GMD coset decodings

M.P.C. Fossorier, Shu Lin

In this letter, Chase decoding algorithms are generalized into a family of bounded distance decoding algorithms, so that the conventional Chase algorithm-2 and Chase algorithm-3 become the two extremes of this family. Consequently, more flexibility in the tradeoffs between error performance and decoding complexity is provided by this generalization, especially for codes with large minimum distance. Finally this approach is extended to decoding with erasures.

IEEE Transactions on CommunicationsMar 1, 200031 citations

Asymptotic optimality of the GMD and Chase decoding algorithms

Yuansheng Tang, Toru Fujiwara, Tadao Kasami

The generalized minimum distance (GMD) and Chase (1972) decoding algorithms are some of the most important suboptimum bounded distance decoding algorithms for binary linear block codes over an additive white Gaussian noise (AWGN) channel. We compute the limitation of the ratio between the probability of decoding error for the GMD or any one of the Chase decoding algorithms and that of the maximum-likelihood (ML) decoding when the signal-to-noise ratio (SNR) approaches infinity. If the minimum Hamming distance of the code is greater than 2, the limitation is shown to be equal to 1 and thus the GMD and Chase decoding algorithms are asymptotically optimum.

IEEE Transactions on Information TheoryAug 1, 20029 citations

Error performance analysis for reliability-based decoding algorithms

M.P.C. Fossorier, Shu Lin

The statistical approach proposed by Agrawal and Vardy (see ibid., vol.46, no.1, p.60-83, 2000) to evaluate the error performance of the generalized minimum distance (GMD) decoding is extended to other reliability-based decoding algorithms for binary linear block codes, namely Chase (1972) type, combined GMD and Chase type, and order statistic decoding (OSD). In all cases, tighter and simpler bounds than those previously proposed have been obtained with this approach.

IEEE Transactions on Information TheoryJan 1, 200262 citations

Difference between two soft-decisiondecoding algorithms

Jan Nilsson

A relationship between two well-known soft-decision decoding algorithms is derived; the generalised minimum distance (GMD) algorithm and the Chase algorithm. The relation shows, in the case of soft-decision decoding of binary block codes, that the weakest third version of the Chase algorithm is more powerful than the GMD algorithm.

Electronics LettersSep 29, 19941 citation

Reduced GMD decoding of concatenated codes

Jos H. Weber, Khaled Abdel-Ghaffar

We present a general version of the generalized minimum distance (GMD) decoding algorithm (see Forney, G.D., Jr, 1966) that accommodates different erasing strategies. This version is called reduced GMD decoding since, depending on the erasing strategy used, it can offer a reduction in complexity over Forney's GMD decoding. We apply reduced GMD decoding to concatenated codes. In particular, we study the error correction capability and the unsuccessful decoding probability of concatenated codes with reduced GMD decoding.

GlobecomNov 13, 20020 citations

Geometrical and performance analysis of GMD and Chase decoding algorithms

Eran Fishler, Ofer Amrani, Yair Be'ery

The overall number of nearest neighbors in bounded distance decoding (BDD) algorithms is given by N/sub 0,eff/=N/sub 0/+N/sub BDD/. Where NBDD denotes the number of additional, non-codeword, neighbors that are generated during the (suboptimal) decoding process. We identify and enumerate the nearest neighbors associated with the original generalized minimum distance (GMD) and Chase (1972) decoding algorithms. After careful examination of the decision regions of these algorithms, we derive an approximated probability ratio between the error contribution of a noncodeword neighbor (one of N/sub BDD/ points) and a codeword nearest neighbor. For Chase algorithm 1 it is shown that the contribution to the error probability of a noncodeword nearest neighbor is a factor of 2/sup d-1/ less than the contribution of a codeword, while for Chase algorithm 2 the factor is 2/sup [d/2]-1/, d being the minimum Hamming distance of the code. For Chase algorithm 3 and GMD, a recursive procedure for calculating this ratio, which turns out to be nonexponential in d, is presented. This procedure can also be used for specifically identifying the error patterns associated with Chase algorithm 3 and GMD. Utilizing the probability ratio, we propose an improved approximated upper bound on the probability of error based on the union bound approach. Simulation results are given to demonstrate and support the analytical derivations.

IEEE Transactions on Information TheoryJul 1, 199910 citations