• DocumentCode
    3427383
  • Title

    Viterbi decoder architecture for interleaved convolutional code

  • Author

    Kong, Jun Jin ; Parhi, Keshab K.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Minnesota Univ., USA
  • Volume
    2
  • fYear
    2002
  • fDate
    3-6 Nov. 2002
  • Firstpage
    1934
  • Abstract
    Sn area efficient high speed Veterbi decoder architecture, which is based on the state-parallel architecture with register exchange path memory structure, for interleaved convolutional code is proposed By replacing each delay (or storage) element in state metrics memory (or path metrics memory) and path memory (or survival memory) with I delays, interleaved Viterbi decoder is obtained. The decoding speed of this decoder architecture is as fast as the operating clock speed. The latency of proposed interleaved Viterbi decoder is "decoding depth (DD) /spl times/ interleaving degree (I)\´, which is linearly increased with the interleaving degree I.
  • Keywords
    Viterbi decoding; convolutional codes; interleaved codes; memory architecture; parallel architectures; area efficient Viterbi decoder architecture; decoding depth; decoding speed; delay element; high speed Viterbi decoder architecture; interleaved Viterbi decoder; interleaved convolutional code; interleaving degree; operating clock speed; path metrics memory; register exchange path memory structure; state metrics memory; state-parallel architecture; storage element; survival memory; Asynchronous transfer mode; Computer architecture; Convolutional codes; Decoding; Delay; Encoding; Interleaved codes; Polynomials; Registers; Viterbi algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signals, Systems and Computers, 2002. Conference Record of the Thirty-Sixth Asilomar Conference on
  • Conference_Location
    Pacific Grove, CA, USA
  • ISSN
    1058-6393
  • Print_ISBN
    0-7803-7576-9
  • Type

    conf

  • DOI
    10.1109/ACSSC.2002.1197117
  • Filename
    1197117