Abstract
This paper deals with the performance of "Generalized Minimum Distance Decoding". In this method, a generalized distance taking into account of the reliability of the code symbol is used. We outline relationships between generalized minimum distance and correlation which are two criteria equivalent to Maximum Likelihood Decoding (MLD). A sufficient condition which guarantees the correct result of the GMD decoding algorithm is studied. For high signal-to-noise ratios, the GMD decoding algorithm enables to achieve MLD performance with a complexity O(n3). We present, by computer simulation, the behavior of the GMD algorithm for different error-correcting codes, in particular, the results for concatenated schemes (Reed-Solomon outer codes with inner convolutional codes).
Preview
Unable to display preview. Download preview PDF.
References
G.D. FORNEY, Jr, "Generalized Minimum Distance Decoding", IEEE Trans. Inform. Theory, vol. IT-12, pp.125–131,Apr. 1966.
G. EINARSSON and C.E.SUNDBERG,"A note on soft decision decoding with successive erasures", IEEE Trans. Inform. Theory, Jan. 1976.
G.D. FORNEY,Jr, "Concatenated Codes". Cambridge, MA. MIT,1966.
C. Clark,Jr. "Error-Correction Coding for Digital Communications", PLENUM PRESS, New York.
A. DUR," On the computation of the performance probability for block codes with a bounded-distance decoding Rule",IEEE Trans. on Inf. theory, Vol. 34, No. 1, Jan. 1988.
C.H.YU and D.J.COSTELLO,Jr,"Generalized Minimum Distance Decoding Algorithm for Qary Output channels", IEEE Trans. Inform. Theory, vol. IT-26, no.2,Mar. 1980.
J.P. Odenwalder,"Concatenated Reed-Solomon/Viterbi channel coding for advanced planetary mission: Analysis, Simulations and Tests, Linkabit Corporation, Final Report on contract No 953866, Dec. 1974.
K.Y.LIU and J.J.LEE,"Recent Results on the use of Concatenated Reed-Solomon/Viterbi Channel Coding and Data Compression for space Communications", IEEE Trans. on Com. Vol. COM-32, No.5, May 1984.
G. BATTAIL, "Pondération des symboles decodés par l'algorithme de Viterbi", Ann. TELECOM. Vol.42, No.1–2,1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhu, Y.P., Godlewski, P. (1989). Results of generalized minimum distance decoding for block code of rate 1/2. In: Cohen, G., Wolfmann, J. (eds) Coding Theory and Applications. Coding Theory 1988. Lecture Notes in Computer Science, vol 388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019854
Download citation
DOI: https://doi.org/10.1007/BFb0019854
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51643-9
Online ISBN: 978-3-540-46726-7
eBook Packages: Springer Book Archive