• DocumentCode
    2833047
  • Title

    Application of VLSI technology to the Z-J stack algorithm

  • Author

    Gould, T.M. ; Harris, J.H.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., San Diego State Univ., CA, USA
  • fYear
    1991
  • fDate
    11-14 Jun 1991
  • Firstpage
    2208
  • Abstract
    The Z-J algorithm given by A.J. Viterbi (1967) and K. Zigangirov (1966) is a bit-error correcting algorithm for long constraint length convolutional codes. The feasibility of implementing the algorithm in a single VLSI chip to obtain bit error correction for systems with input data rates approaching on-chip clock rates, which currently range up to hundreds of megabits/s, is described. Simulations of the algorithm under VLSI constraints demonstrate potential error correction performance superior to available maximum likelihood decoders, which operate at shorter constraint length, at noise levels below decoding limits for sequential decoders. Stack dimensions required to achieve the result are on the order of 250×100 bits
  • Keywords
    VLSI; application specific integrated circuits; digital signal processing chips; error correction; Z-J stack algorithm; bit error correction; bit-error correcting algorithm; error correction performance; feasibility; input data rates; long constraint length convolutional codes; noise levels; single VLSI chip; stack dimensions; Bit error rate; Convolutional codes; Error correction; Maximum likelihood decoding; Maximum likelihood detection; Maximum likelihood estimation; Signal generators; State estimation; Very large scale integration; Viterbi algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1991., IEEE International Sympoisum on
  • Print_ISBN
    0-7803-0050-5
  • Type

    conf

  • DOI
    10.1109/ISCAS.1991.176737
  • Filename
    176737