• DocumentCode
    3202538
  • Title

    Multi-rate convolutional codes using common nonlinear generators for memory order four

  • Author

    Mayhew, Gregory L.

  • Author_Institution
    Dept. of Electr. & Syst. Eng., Washington Univ. St. Louis, St. Louis, MO
  • fYear
    2009
  • fDate
    7-14 March 2009
  • Firstpage
    1
  • Lastpage
    14
  • Abstract
    This paper presents sets of convolutional codes with memory order four which have maximal free distance and have common nonlinear generating functions. Every code in a set has at least one feedforward coding equation that is nonlinear over a binary Galois field. Each set has convolutional codes with rates one-half, one-third, and one-fourth. In each set, the generators of the rate one-third code include all the generators of the rate one-half code. In each set, the generators of the rate one-fourth code include all the generators of the rate one-third code. This commonality yields multi-rate code implementations with minimum logic. The focus is nonlinear convolutional codes that achieve Heller-Griesmer bound on maximum free distance.
  • Keywords
    Galois fields; convolutional codes; nonlinear codes; Heller-Griesmer bound; binary Galois field; common nonlinear generating functions; feedforward coding equation; memory order four; multirate convolutional codes; nonlinear codes; rate one-fourth code; rate one-half code; rate one-third code; Code standards; Convolutional codes; Encoding; Error correction codes; Feeds; Galois fields; Maximum likelihood decoding; NASA; Nonlinear equations; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Aerospace conference, 2009 IEEE
  • Conference_Location
    Big Sky, MT
  • Print_ISBN
    978-1-4244-2621-8
  • Electronic_ISBN
    978-1-4244-2622-5
  • Type

    conf

  • DOI
    10.1109/AERO.2009.4839400
  • Filename
    4839400