• DocumentCode
    2170861
  • Title

    A variable rate constraint length K=5 Viterbi decoder for 12 Mb/s

  • Author

    Bonek, Peter ; Ivanov, Andre ; Kallel, Samir

  • Author_Institution
    Dept. of Electr. Eng., British Columbia Univ., Vancouver, BC, Canada
  • fYear
    1993
  • fDate
    14-17 Sep 1993
  • Firstpage
    582
  • Abstract
    Describes a fully testable variable rate Viterbi decoder chip capable of decoding convolutional codes ranging from rate 7/8 to 1/4 derived from the same 1/2 rate code. The architecture of the Viterbi decoder is bit-serial node-parallel to save interconnect area but still achieve high speed decoding. Modulo normalization of the surviving path metrics, arranging the memory elements of the path memory as sets of butterflies, and custom layout are the key for reducing the Si area. Newly developed area efficient testing schemes achieve 99.9% single stuck-at-fault coverage, while requiring <5% hardware overhead
  • Keywords
    CMOS integrated circuits; VLSI; application specific integrated circuits; codecs; convolutional codes; decoding; digital signal processing chips; maximum likelihood estimation; memory architecture; parallel architectures; 12 Mbit/s; Si; Si area; architecture; area efficient testing schemes; bit-serial node-parallel; butterflies; convolutional codes; custom layout; decoder chip; interconnect area; memory elements; modulo normalization; path memory; single stuck-at-fault coverage; surviving path metrics; variable rate constraint length K=5 Viterbi decoder; CMOS technology; Convolution; Convolutional codes; Forward error correction; Hardware; Maximum likelihood decoding; Silicon; Testing; Throughput; Viterbi algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Electrical and Computer Engineering, 1993. Canadian Conference on
  • Conference_Location
    Vancouver, BC
  • Print_ISBN
    0-7803-2416-1
  • Type

    conf

  • DOI
    10.1109/CCECE.1993.332358
  • Filename
    332358