Abstract
This paper describes and evaluates implementations of the Dorsch algorithm for RS codes. This algorithm has previously been applied only to binary codes and requires adaptation for application to multilevel codes. The Dorsch algorithm has also been applied to some Reed Solomon codes which can also be formulated as binary codes in order to compare the two approaches. On the AWGN channel, the binary approach shows better performance for the same complexity than the multilevel approach and it appears that the Dorsch algorithm is not well suited to multilevel codes.
Preview
Unable to display preview. Download preview PDF.
References
Shin, S.K. and Sweeney, P. (1994), 'soft decision decoding of Reed Solomon Codes using Trellis methods”, IEE Proceedings Communications Vol 141. No 5.
Forney, G.D. (1966), ‘Generalised minimum distance decoding', IEEE Transactions on Information Theory, IT-12, pp 125–31
Chase D. (1972), ‘A class of algorithms for decoding block codes with channel measurement information', IEEE Transactions on Information Theory, IT-18, 170–82.
Dorsch, B.G. (1974), ‘A decoding algorithm for binary block codes and J-ary output channels', IEEE Transactions on Information Theory, IT-20, pp 391–4.
Eiguren, J. (1994), 'soft decision algorithm for linear block codes', PhD Thesis, University of Manchester.
Sweeney, P. (1995), ‘Cyclic block codes definable over multiple finite fields', Electronics Letters. Vol 31. No 5.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ho, H.P., Sweeney, P. (1995). Soft decision decoding of Reed Solomon codes using the Dorsch algorithm. In: Boyd, C. (eds) Cryptography and Coding. Cryptography and Coding 1995. Lecture Notes in Computer Science, vol 1025. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60693-9_12
Download citation
DOI: https://doi.org/10.1007/3-540-60693-9_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60693-2
Online ISBN: 978-3-540-49280-1
eBook Packages: Springer Book Archive