On the Many Faces of Block Codes
Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder complexity. Necessary and sufficient conditions for subtrellis overlaying are next derived from the representation of the block code as a group, partitioned into a subgroup and its cosets. Finally a view of the code as a graph permits a combination of two shortest path algorithms to facilitate efficient decoding on an overlayed trellis.
Unable to display preview. Download preview PDF.
- 6.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.Google Scholar
- 9.D. Lind and M. Marcus, An Introduction to Symbolic Dynamics and Coding, Cambridge University Press, 1995.Google Scholar
- 10.F.J. MacWilliams and N.J.A. Sloane, The Theory of Error Correcting Codes, North-Holland, Amsterdam, 1981.Google Scholar
- 11.J.L. Massey, Foundations and methods of channel encoding, in Proc. Int. Conf. on Information Theory and Systems 65(Berlin, Germany) Sept 1978.Google Scholar
- 14.Amitava Dasgupta, Priti Shankar, Kaustubh Deshmukh, and B.S. Rajan, On Viewing Block Codes as Finite Automata, Technical Report IISc-CSA-1999-7, Department of Computer Science and Automation, Indian Institute of Science, Bangalore 560012, India, November, 1999.Google Scholar
- 15.A. Vardy, Trellis structure of codes, in Handbook of Coding Theory, R.A. Brualdi, W.C. Huffman, V.S. Pless, Eds., Vol.2, Chap. 24, Elsevier, 1998.Google Scholar
- 18.J.C. Willems, Models for Dynamics, in Dynamics Reported, 2, U. Kirchgraber and H.O. Walther, Eds. New York: Wiley, 1989, pp 171–269.Google Scholar