Skip to main content

Rudified Convolutional Encoders

  • Chapter
Numbers, Information and Complexity
  • 344 Accesses

Abstract

In this semi-tutorial paper convolutional codes and their various encoders are presented. The terminology rudified convolutional encoders is introduced for convolutional encoders that are both systematic and polynomial. It is argued that these rudified convolutional encoders—contrary to common belief—are sometimes the best choice.

This research was supported in part by the Swedish Research Council for Engineering Sciences under Grants 97-235 and 97-723.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. R. Johannesson and K. Sh. Zigangirov, Fundamentals of convolutional coding, Piscataway, N. J., IEEE Press, 1999.

    Book  Google Scholar 

  2. J. A. Heller, “Sequential decoding: Short constraint length convolutional codes”, Jet Propulsion Lab., California Inst. Technol., Pasadena, Space Program Summary 37–54, vol. 3, Dec. 1968, 171–174.

    Google Scholar 

  3. D. J. Costello, Jr., “Free distance bounds for convolutional codes”, IEEE Trans. Inform. Theory, vol. 20, 1974, 356–365.

    Article  MathSciNet  MATH  Google Scholar 

  4. S. W. Golomb, Shift Register Sequences, Holden-Day, San Fransisco, 1967. Revised ed., Aegean Park Press, Laguna Hills, Cal., 1982.

    Google Scholar 

  5. G. D. Forney, Jr., (1967), Review of random tree codes (NASA Ames. Res. Cen., Contract NAS2–3637, NASA CR, 73176, Final Rep.;Appx A). See also Forney, G. D., Jr. (1974), Convolutional codes II: Maximum-likelihood decoding and convolutional codes III: Sequential decoding. Inform Contr., 25: 222–297.

    Google Scholar 

  6. H. Osthoff, J. B. Anderson, R. Johannesson, and C.-f. Lin, “Systematic feed-forward convolutional encoders are better than other encoders with an M-algorithm decoder”, IEEE Trans. Inform. Theory, vol. 44, 1998, 831–838.

    Article  MathSciNet  MATH  Google Scholar 

  7. K. Sh. Zigangirov and V. D. Kolesnik, “List decoding of trellis codes”, Problems of Control and Information Theory 9, 1980, 347–364.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer Science+Business Media New York

About this chapter

Cite this chapter

Johannesson, R. (2000). Rudified Convolutional Encoders. In: Althöfer, I., et al. Numbers, Information and Complexity. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6048-4_23

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-6048-4_23

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-4967-7

  • Online ISBN: 978-1-4757-6048-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics