• DocumentCode
    414902
  • Title

    Viterbi decoding of ternary line codes

  • Author

    Ouahada, Khmaies ; Ferreira, Hendrik C.

  • Author_Institution
    Dept. of Electr. & Electron. Eng., Rand Afrikaans Univ., South Africa
  • Volume
    2
  • fYear
    2004
  • fDate
    20-24 June 2004
  • Firstpage
    667
  • Abstract
    The Viterbi decoding algorithm provides maximum likelihood decoding and has found widespread application since its introduction in 1967. It is currently the most widely used technique for the decoding of codes having a state system description, including the class of linear error correcting convolutional codes. Contrary to this, it is still common practice to use combinational logic decoders for ternary line codes. These are non-linear codes frequently used in metallic cable systems due to advantages such as efficient utilization of bandwidth, and a DC free power spectral density function. We investigate in this paper the behaviour of Viterbi decoding for the most important ternary line codes, and the coding gain that can be obtained by applying soft-decision decoding. The simplification of the Viterbi decoding implementation and the reduction in latency by shortening its survivor path length, have also been investigated.
  • Keywords
    Viterbi decoding; bandwidth allocation; convolutional codes; error correction codes; maximum likelihood decoding; nonlinear codes; ternary codes; DC free power spectral density function; Viterbi decoding algorithm; coding gain; combinational logic decoders; linear error correcting convolutional codes; maximum likelihood decoding; metallic cable systems; nonlinear codes; soft-decision decoding; state system description; survivor path length; ternary line codes; Ambient intelligence; Computational modeling; Convolutional codes; DSL; Delay; Gain; Maximum likelihood decoding; Quantization; Testing; Viterbi algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications, 2004 IEEE International Conference on
  • Print_ISBN
    0-7803-8533-0
  • Type

    conf

  • DOI
    10.1109/ICC.2004.1312585
  • Filename
    1312585