Reduced GMD decoding

@article{Weber2003ReducedGD,
  title={Reduced GMD decoding},
  author={Jos H. Weber and Khaled A. S. Abdel-Ghaffar},
  journal={IEEE Trans. Inf. Theory},
  year={2003},
  volume={49},
  pages={1013-1027}
}
A framework is presented for generalized minimum distance (GMD) decoding with a limited number of decoding trials and a restricted set of reliability values. In GMD decoding, symbols received from the channel may be erased before being fed into an algebraic error-erasure decoder for error correction, in subsequent or simultaneous trials with different erasing patterns. The decision whether or not to erase a symbol in a certain trial is taken by an erasure-choosing algorithm which takes into… 

Figures and Tables from this paper

Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff
TLDR
This work investigates single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff, based on either erasing a fraction of the received symbols or erasing all symbols whose reliability values are below a certain threshold.
On Asymptotic Strategies for GMD Decoding with Arbitrary Error-Erasure Tradeoff
TLDR
This work investigates different erasing strategies based on either erasing a fraction of the received symbols or erasing all symbols whose reliability values are below a certain threshold, using multi-trial GMD Forney’s decoder.
Reduced GMD decoding of concatenated codes
  • J. Weber, K. Abdel-Ghaffar
  • Computer Science
    GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)
  • 2001
TLDR
A general version of the generalized minimum distance (GMD) decoding algorithm that accommodates different erasing strategies and can offer a reduction in complexity over Forney's GMD decoding is presented.
Optimal threshold-based multi-trial error/erasure decoding with the Guruswami-Sudan algorithm
TLDR
This work provides formulae which allow to optimally exploit the erasure option of decoders with arbitrary λ, if the decoder can be used z ≥ 1 times, and shows that BMD decoder with zBMD decoding trials can result in lower residual codeword error probability than Guruswami-Sudan (GS) list decodes with zGS trials, if z BMD is only slightly larger than zGS.
On Generalized Minimum Distance Decoding Thresholds for the AWGN Channel
We consider the Additive White Gaussian Noise channel with Binary Phase Shift Keying modulation. Our aim is to enable an algebraic hard decision Bounded Minimum Distance decoder for a binary block
Optimal erasure selection of M-ary PAM signaling for errors and erasures decoding algorithms
TLDR
An analytical criterion for optimal erasure selection is derived, by which a suboptimal threshold is defined, which can be used for errors and erasures decoding of large code-distance channel codes.
A Unified View on Known Algebraic Decoding Algorithms and New Decoding Concepts
TLDR
Known properties of cyclic codes are used to give a unified description of many classical decoding algorithms for Reed-Solomon codes up to half the minimum distance and variants of a new error/erasure decoding algorithm are given.
Generalized minimum distance decoding with arbitrary error, erasure tradeoff
TLDR
A means of expressing their error-correcting capabilities by a unified function, the Generalized Decoding Radius is introduced, which considers the decoding radius of GMD decoding, i.e., the maximum number of errors that are correctable with guarantee.
On Extended Forney-Kovalev GMD decoding
TLDR
An m-trial generalized minimum distance (GMD) decoder based on λ is proposed, which extends results of Forney and Kovalev to the whole given range of λ.
Single-trial adaptive decoding of concatenated codes
TLDR
A Bounded Minimum distance decoder is used for the inner code correcting up to (d − 1)/2 errors and a Bounded Distance decoder for the outer code, which corrects ε errors and τ erasures if λε + τ ≤ d − 1, where a real number 1 < λ ≤ 2 is the tradeoff rate between errors and erasures for this outer decoder.
...
...

References

SHOWING 1-10 OF 19 REFERENCES
Simplified correlation decoding by selecting possible codewords using erasure information
TLDR
A new algorithm for soft-decision decoding is presented, simplifying the correlation scheme by selecting certain codewords and decreasing decoding complexity by using erasure information.
Class of algorithms for decoding block codes with channel measurement information
  • D. Chase
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1972
TLDR
It is shown that as the signal-to-noise ratio (SNR) increases, the asymptotic behavior of these decoding algorithms cannot be improved, and computer simulations indicate that even for SNR the performance of a correlation decoder can be approached by relatively simple decoding procedures.
A Unified Method for Evaluating the Error-Correction Radius of Reliability-Based Soft-Decision Algorithms for Linear Block Codes
TLDR
A simple algorithm that always converges to the optimum solution of this optimization problem is presented and the error-correction radii of some well-known reliability-based soft-decision decoding algorithms are revisited and compared.
An improvement to generalized-minimum-distance decoding
TLDR
The performance of generalized minimum distance (GMD) decoding is better if the new criterion is used, and the weights used in GMD decoding are generalized to permit each of the possible M symbol values to have a different weight.
Error performance analysis for reliability-based decoding algorithms
  • M. Fossorier, Shu Lin
  • Computer Science
    2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)
  • 2000
TLDR
The statistical approach proposed by D. Agrawal and A. Vardy 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-type, combined GMD and Chase- type, and ordered statistic decoding.
Generalized minimum distance decoding in Euclidean space: Performance analysis
TLDR
This analysis of generalized minimum distance (GMD) decoding algorithms for Euclidean space codes is presented, and it is proved that although these decoding regions are polyhedral, they are essentially always nonconvex.
An interactive concatenated turbo coding system
TLDR
A concatenated turbo coding system in which a Reed¿Solomon outer code is concatenation with a binary turbo inner code to achieve both good bit error and frame error performance and reduces decoding delay.
Generalized minimum distance decoding
  • G. Forney
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1966
TLDR
A new distance measure is introduced which permits likelihood information to be used in algebraic minimum distance decoding techniques and an efficient decoding algorithm is given, and exponential bounds on the probability of not decoding correctly are developed.
Two classes of minimum generalized distance decoding algorithms,”Probl
  • Pered. Inform. , vol. 22,
  • 1986
...
...