Skip to main content
SpringerLink
Log in

Catastrophicity Test for Time-Varying Convolutional Encoders

  • Conference paper
  • First Online:
Cryptography and Coding (Cryptography and Coding 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1746))

Included in the following conference series:

Abstract

A new catastrophicity test for convolutional encoders whose rate and generator polynomials vary with time is presented. Based on this test computationally efficient algorithm to determine whether or not a time-varying convolutional encoder is catastrophic is derived. This algorithm is shown to be simpler than the catastrophicity test proposed by Balakirsky [1]. Furthermore, the algorithm can easily be generalised to rate k/n time-varying convolutional encoders.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V.B. Balakirsky, “A necessary and su_cient condition for time-variant convolutional encoders to be noncatastrophic,” Lecture Notes in Computer Science, No. 781, pp. 1–10, Springer-Verlag, 1993.

    MATH  Google Scholar 

  2. J.L. Massey and M.K. Sain, “Inverses of linear sequential circuits,” IEEE Trans. Computers, Vol. C-17,No. 4, pp. 330–337, April 1968.

    Article  Google Scholar 

  3. R.R. Olsen, “Note on feedforward inverses for linear sequential circuits,” IEEE Trans. Computers, Vol. C-19,No. 12, pp. 1216–1221, Dec. 1970.

    Article  MathSciNet  Google Scholar 

  4. G.D. Forney, Jr., “Minimal bases of rational vector spaces, with applications to multivariable linear systems,” SIAM J. Control, vol. 13, pp.493–520, May 1975.

    Article  MathSciNet  Google Scholar 

  5. R. Johannesson and Z.-X. Wan, “A linear algebra approach to convolutional encoders,” IEEE Trans. Inform. Theory, vol. IT-39,No. 4, pp. 1219–1233, July 1993.

    Article  MathSciNet  Google Scholar 

  6. P.J. Lee, “There are many good time-varying convolutional codes,” IEEE Trans. Inform. Theory, Vol. IT-35,No. 2, pp. 460–463, March 1989.

    Article  MathSciNet  Google Scholar 

  7. M. Mooser, “Some periodic convolutional codes better than any fixed code,” IEEE Trans. Inform. Theory, Vol. IT-29,No. 5, pp. 750–751, Sept. 1983.

    Article  Google Scholar 

  8. R. Palazzo, “A time-varying convolutional encoder better than the best time-invariant encoder,” IEEE Trans. Inform. Theory, Vol IT-39,No.3, pp. 1109–1110, May 1993.

    Article  MathSciNet  Google Scholar 

  9. C. O’Donoghue, and C.J. Burkley, “Minimality and canonicity tests for rational generator matrices for convolutional codes,” in Proc. 1998 IEEE Information Theory Workshop, pp. 112–114, Killarney, 22-26 June, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Silicon & Software Systems, South County Business Park, Leopardstown, Dublin, Ireland

    Conor O’Donoghue

  2. Dept. of Electronic Engineering, University of Limerick, Limerick, Ireland

    Cyril Burkley

Authors
  1. Conor O’Donoghue
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cyril Burkley
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Vodafone Limited, The Courtyard, 2-4 London Road Newbury, Berkshire, RG14 1JX, UK

    Michael Walker

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

O’Donoghue, C., Burkley, C. (1999). Catastrophicity Test for Time-Varying Convolutional Encoders. In: Walker, M. (eds) Cryptography and Coding. Cryptography and Coding 1999. Lecture Notes in Computer Science, vol 1746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46665-7_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-46665-7_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66887-9

  • Online ISBN: 978-3-540-46665-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation