• DocumentCode
    2552859
  • Title

    Efficient path metric access for reducing interconnect overhead in Viterbi decoders

  • Author

    Shieh, Ming-Der ; Wang, Tai-Ping ; Wu, Chien-Ming ; Huang, Chun-Ming

  • Author_Institution
    Dept. of Electr. Eng., National Cheng Kung Univ.
  • fYear
    2006
  • fDate
    21-24 May 2006
  • Abstract
    Efficient management of the path metric memory and minimization of interconnection networks between the memory and addcompareselect unit (ACSU) are always the key concerns on the design and implementation of Viterbi decoders. In this paper, we derive a set of simple equations to partition the memory into P banks such that the equivalent memory bandwidth can be increased with very simple interconnection networks. Compared with the previous work, our proposed approach reveals the following superiority: (1) Each memory bank can be treated as a local memory of a specific ACS; thus, the interconnection network is simplified. (2) The P memory banks can be merged into only two pseudo-banks regardless of the number of ACS operations. This not only further reduces the hardware requirements of address generation, but also makes smaller the required memory space
  • Keywords
    Viterbi decoding; integrated logic circuits; P memory banks; Viterbi decoders; equivalent memory bandwidth; interconnect overhead reduction; interconnection networks; local memory; path metric access; pseudo banks; specific ACS; Bandwidth; Convolutional codes; Equations; Hardware; Maximum likelihood decoding; Memory management; Multiprocessor interconnection networks; Partitioning algorithms; Read-write memory; Viterbi algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 2006. ISCAS 2006. Proceedings. 2006 IEEE International Symposium on
  • Conference_Location
    Island of Kos
  • Print_ISBN
    0-7803-9389-9
  • Type

    conf

  • DOI
    10.1109/ISCAS.2006.1693708
  • Filename
    1693708