Abstract
We have implemented a package that transforms concise algebraic descriptions of linear block codes into finite automata representations, and also generates decoders from such representations. The transformation takes a description of the code in the form of a k × n generator matrix over a field with q elements, representing a finite language containing q k strings, and constructs a minimal automaton for the language from it, employing a well known algorithm. Next, from a decomposition of the minimal automaton into subautomata, it generates an overlayed automaton, and an efficient decoder for the code using a new algorithm. A simulator for the decoder on an additive white Gaussian noise channel is also generated. This simulator can be used to run test cases for specific codes for which an overlayed automaton is available. Experiments on the well known Golay code indicate that the new decoding algorithm is considerably more efficient than the traditional Viterbi algorithm run on the original automaton.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
L.R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, Optimal decoding of linear codes for minimizing symbol error rate, IEEE Trans. Inform. Theory 20(2), March 1974, pp 284–287.
R.E. Blahut, Theory and Practice of Error control Codes, Addison Wesley, 1984.
A.R. Calderbank, G. David Forney,Jr., and Alexander Vardy, Minimal Tail-Biting Trellises: The Golay Code and More, IEEE Trans. Inform. Theory 45(5) July 1999,pp 1435–1455.
G.C. Clark, Jr. and J.B. Cain, Error-Correction Coding for Digital Communication., New York: Plenum, 1981.
Amitava Dasgupta, Priti Shankar, Kaustubh Deshmukh, and B.S, Rajan On Viewing Block Codes as Finite Automata, Technical Report IISc-CSA-99-7, Department of Computer Science and Automation, Indian Institute of Science, Bangalore-560012
K. Deshmukh, Shankar, P., Dasgupta, A., Sundar Rajan, B., On the many faces of block codes, in Proceedings of STACS 2000, LNCS 1770, (Lille, France, February 2000), pp 53–64.
G.D. Forney, Jr.,Coset codes II: Binary lattices and related codes, IEEE Trans. Inform. Theory 36(5), Sept. 1988,pp 1152–1187.
G.D. Forney, Jr. and M.D. Trott, The dynamics of group codes:State spaces, trellis diagrams and canonical encoders, IEEE Trans. Inform. Theory 39(5) Sept 1993,pp 1491–1513.
P.E. Hart, N.J. Nilsson, and B. Raphael, A formal basis for the heuristic determination of minimum cost paths, IEEE Trans. Solid-State Circuits SSC-4, 1968, pp 100–107.
Ralf Kotter and Vardy, A., Construction of Minimal Tail-Biting Trellises,in Proceedings IEEE Information Theory Workshop (Killarney, Ireland, June 1998), 72–74.
Ralf Kotter and Vardy, A., The theory of tailbiting trellises, (manuscript in preparation).
F.R. Kschischang and V. Sorokine, On the trellis structure of block codes, IEEE Trans. Inform. Theory 41(6), Nov 1995,pp 1924–1937.
D. Lind and M. Marcus, An Introduction to Symbolic Dynamics and Coding, Cambridge University Press, 1995.
F.J. MacWilliams and N.J.A. Sloane,The Theory of Error Correcting Codes, North-Holland, Amsterdam, 1981.
J.L. Massey, Foundations and methods of channel encoding, in Proc. Int. Conf. on Information Theory and Systems 65(Berlin, Germany) Sept 1978.
R.J. McEliece, The Theory of Information and Coding, Encyclopedia of Mathematics and its Applications, Addison Wesley, 1977.
R.J. McEliece, On the BCJR trellis for linear block codes, IEEE Trans. Inform. Theory 42,November 1996, pp 1072–1092.
D.J. Muder, Minimal trellises for block codes, IEEE Trans. Inform. Theory 34(5), Sept 1988,pp 1049–1053.
A. Vardy, Trellis structure of codes, in Handbook of Coding Theory, V.S. Pless and W.C. Huffman, Eds.,Elsevier Science, 1998.
A.J. Viterbi, Error bounds for convolutional codes and an asymptotically optimum decoding algorithm, IEEE Trans. Inform. Theory 13, April 1967, pp 260–269.
N. Wiberg, H.-A. Loeliger and R. Kotter, Codes and iterative decoding on general graphs, Eoro. Trans. Telecommun.,6 pp513–526, Sept 1995.
J.K. Wolf, Efficient maximum-likelihood decoding of linear block codes using a trellis, IEEE Trans. Inform. Theory 24 pp 76–80.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shankar, P., Sasidharan, K., Aggarwal, V., Rajan, B.S. (2001). A Package for the Implementation of Block Codes as Finite Automata. In: Yu, S., Păun, A. (eds) Implementation and Application of Automata. CIAA 2000. Lecture Notes in Computer Science, vol 2088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44674-5_24
Download citation
DOI: https://doi.org/10.1007/3-540-44674-5_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42491-8
Online ISBN: 978-3-540-44674-3
eBook Packages: Springer Book Archive