• DocumentCode
    2731940
  • Title

    A new architecture for the fast Viterbi algorithm

  • Author

    Lee, Inkyu ; Sonntag, Jeff L.

  • Author_Institution
    Lucent Technol. Bell Labs., Murray Hill, NJ, USA
  • Volume
    3
  • fYear
    2000
  • fDate
    2000
  • Firstpage
    1664
  • Abstract
    A novel architecture design to speed up the Viterbi algorithm is proposed. By doubling the number of states in the trellis, the serial operation of a traditional add-compare-select (ACS) unit is transformed into a parallel operation, thus achieving a substantial speed increase. The use of the proposed architecture would increase the speed by 33% at the expense of a fairy modest increase in area, thus removing the Viterbi detector/decoder from the worst case speed bottleneck path in most high-speed applications. A simple example is shown to illustrate the proposed algorithm in a maximum likelihood sequence detector
  • Keywords
    Viterbi decoding; Viterbi detection; digital arithmetic; maximum likelihood detection; parallel processing; MLSD; VLSI chip design; Viterbi detector/decoder; Viterbi processor; add-compare-select unit; architecture design; fast Viterbi algorithm; high-speed applications; maximum likelihood sequence detector; parallel operation; serial operation; trellis states; worst case speed bottleneck path; Clocks; Convolutional codes; Detectors; Maximum likelihood decoding; Maximum likelihood detection; Maximum likelihood estimation; Parallel processing; Samarium; Throughput; Viterbi algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Telecommunications Conference, 2000. GLOBECOM '00. IEEE
  • Conference_Location
    San Francisco, CA
  • Print_ISBN
    0-7803-6451-1
  • Type

    conf

  • DOI
    10.1109/GLOCOM.2000.891920
  • Filename
    891920