• DocumentCode
    2623085
  • Title

    Construction of minimal error-trellises for convolutional codes

  • Author

    Ariel, Meir ; Snyders, Jakov

  • Author_Institution
    Dept. of Electr. Eng.-Syst., Tel-Aviv Univ., Israel
  • fYear
    1994
  • fDate
    27 Jun-1 Jul 1994
  • Firstpage
    16
  • Abstract
    A method is presented to construct minimal error-trellises for convolutional codes over GF(q). The number of states of the error-trellis is qσ, where σ is a modified version of the constraint length of the parity check matrix of the code. In comparison with the Viterbi algorithm, substantial reduction in the computational complexity of maximum likelihood soft decoding is enabled by employing an appropriate error-trellis, in combination with methods for accelerated error-search
  • Keywords
    Galois fields; computational complexity; convolutional codes; matrix algebra; maximum likelihood decoding; Galois fields; Viterbi algorithm; accelerated error search; computational complexity; constraint length; convolutional codes; maximum likelihood soft decoding; minimal error trellises; parity check matrix; Computational complexity; Constraint theory; Convolutional codes; Delay; Maximum likelihood decoding; Maximum likelihood detection; Notice of Violation; Parity check codes; Partitioning algorithms; Viterbi algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
  • Conference_Location
    Trondheim
  • Print_ISBN
    0-7803-2015-8
  • Type

    conf

  • DOI
    10.1109/ISIT.1994.394955
  • Filename
    394955
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2623085