Abstract
Weight distributions of convolutional codes are important because they permit computation of bounds on the error performance. In this paper, we present a novel approach to computing the complete weight distribution function (WDF) of a convolutional code. We compute the weight distribution series using the generalized Viterbi Algorithm (GVA) and then find the minimum linear recursion relation in this series using the shift register synthesis algorithm (SRSA). The WDF follows from the minimum recursion. In order to generalize the use of the SRSA over certain commutative rings, we prove the key result that the set of finite recursions forms a principal ideal.
Supported in part by NSF grant # CCR-9805885.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. L. Massey, “Shift-Register Synthesis and BCH Decoding”,IEEE Transactions of Information Theory, Vol. 15, pp. 122–127, January 1969.
A. J. Viterbi and J. K. Omura, Principles of Digital Communication and Coding, New York: McGraw-Hill Book Company, 1979.
S. Lin and D. J. Costello,Jr.,Error Control Coding: Fundamentals and Applications, Englewood Cliffs: Prentice Hall, 1983.
R. J. McEliece, “On the BCJR Trellis for Linear Block Codes”, IEEE Transactions of Information Theory, Vol. 42, pp. 1072–1092, July 1996.
P. Fitzpatrick and G.H. Norton, “Linear recurring sequences and the path weight enumerator of a convolutional code” Elect. Lett., 27 (1991), pp. 98–99.
I. Onyszchuk, “Finding the Complete Path and Weight of Convolutional Codes”, JPL TDA Progress Report, 42–100, 1990.
R. J. McEliece, “How to Compute Weight Enumerators for Convolutional Codes”, Communications and Coding, M. Darnell and B. Honary, eds., Taunton, Somerset, England: Research Studies Press Ltd., pp. 121–141, June 1998.
M. Motani and C. Heegard, “The Viterbi Algorithm Meets The Key Equation”, Proceedings of International Symposium on Information Theory (Boston, MA), August 1998.
S. Golomb, Shift Register Sequences, Revised Edition, Aegean Park Press, May, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Motani, M., Heegard, C. (1999). Computing Weight Distributions of Convolutional Codes Via Shift Register Synthesis. In: Fossorier, M., Imai, H., Lin, S., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1999. Lecture Notes in Computer Science, vol 1719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46796-3_31
Download citation
DOI: https://doi.org/10.1007/3-540-46796-3_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66723-0
Online ISBN: 978-3-540-46796-0
eBook Packages: Springer Book Archive