• DocumentCode
    3598037
  • Title

    A new Viterbi Decoder design for code rate K/N

  • Author

    Li, Hsiang-Iing ; Chakrabarti, Chaitali

  • Author_Institution
    Dept. of Electr. Eng., Arizona State Univ., Tempe, AZ, USA
  • Volume
    1
  • fYear
    1995
  • Firstpage
    549
  • Abstract
    A novel VLSI architecture is proposed for implementing a long constraint length Viterbi Decoder (VD) for code rate k/n. This architecture is based on the encoding structure where k input bits are shifted into k shift registers in each cycle. The architecture is designed in a hierarchical manner by breaking the system into several levels and designing each level independently. At each level, the number of computation units, the interconnection between the units as well as allocation and scheduling issues have been determined. In-place storage of accumulated path metrics and trace back implementation of the survivor memory have also been addressed. The resulting architecture is regular, flexible and achieves a better than linear tradeoff between hardware complexity and computation time
  • Keywords
    VLSI; Viterbi decoding; VLSI; Viterbi Decoder; accumulated path metrics; allocation; computation time; computation units; constraint length; hardware complexity; hierarchical architecture; in-place storage; interconnection; scheduling; shift registers; survivor memory; trace back; Computer architecture; Convolutional codes; Encoding; Hardware; Maximum likelihood decoding; Processor scheduling; Shift registers; Topology; Very large scale integration; Viterbi algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1995. ISCAS '95., 1995 IEEE International Symposium on
  • Print_ISBN
    0-7803-2570-2
  • Type

    conf

  • DOI
    10.1109/ISCAS.1995.521572
  • Filename
    521572