• DocumentCode
    806319
  • Title

    A new architecture for the fast Viterbi algorithm

  • Author

    Lee, Inkyu ; Sonntag, Jeff L.

  • Author_Institution
    Dept. of Commun. Eng., Korea Univ., Seoul, South Korea
  • Volume
    51
  • Issue
    10
  • fYear
    2003
  • Firstpage
    1624
  • Lastpage
    1628
  • Abstract
    A novel architecture design to speed up the Viterbi algorithm is proposed. By increasing the number of states in the trellis, the serial operation of a traditional add-compare-select unit is transformed into a parallel operation, thus achieving a substantial speed increase. The proposed architecture would increase the speed by 33% at the expense of a fairly modest increase in area, thus becoming an attractive approach in high-speed applications. A simple example is shown to illustrate the proposed algorithm in maximum-likelihood sequence detector. A comparative synthesis is made to compare the proposed architecture with other approaches, and synthesis simulations confirm the projection of the throughput gain. Also, the proposed algorithm is extended to the block-processing architecture, and we show that an additional 50% speedup is achieved.
  • Keywords
    Viterbi decoding; maximum likelihood detection; parallel algorithms; trellis codes; Viterbi algorithm; add-compare-select unit; block-processing architecture; high-speed applications; maximum-likelihood sequence detector; parallel operation; serial operation; synthesis simulations; throughput gain; trellis; Algorithm design and analysis; Communication systems; Convolutional codes; Detectors; Helium; Maximum likelihood decoding; Maximum likelihood detection; Maximum likelihood estimation; Throughput; Viterbi algorithm;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/TCOMM.2003.818100
  • Filename
    1237430