The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Nous présentons une manière systématique et efficace de gérer la mémoire des métriques de chemin et de simplifier son réseau de connexion à l'unité add_compare_select (ACSU) pour la conception du décodeur Viterbi (VD). En utilisant les équations dérivées pour la partition de mémoire et l'arrangement d'ajout-comparaison-sélection (ACS) ainsi que le schéma de planification étendu sur place proposé dans ce travail, nous pouvons augmenter la bande passante mémoire pour des accès aux métriques de chemin sans conflit avec une interconnexion câblée entre le chemin. mémoire métrique et ACSU. Par rapport aux travaux existants, l'architecture développée possède les avantages suivants : (1) Chaque banque de mémoire partitionnée peut être traitée comme une mémoire locale d'un élément de traitement spécifique, à l'intérieur de l'ACSU, avec une interconnexion câblée, de sorte que la complexité de l'interconnexion soit considérablement réduite. . (2) Les banques de mémoire partitionnées peuvent être fusionnées en seulement deux pseudo-banques quel que soit le nombre d'éléments de traitement ACS adoptés. Cela simplifie non seulement grandement la conception de l'unité de génération d'adresses, mais réduit également la taille physique de la mémoire requise. (3) La mise en œuvre peut être réalisée de manière systématique avec des circuits de commande réguliers et simples. Les résultats expérimentaux démontrent l'efficacité de l'architecture développée et les bénéfices seront plus évidents pour les codes convolutifs avec un ordre mémoire important.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Ming-Der SHIEH, Tai-Ping WANG, Chien-Ming WU, "Reducing Interconnect Complexity for Efficient Path Metric Memory Management in Viterbi Decoders" in IEICE TRANSACTIONS on Information,
vol. E91-D, no. 9, pp. 2300-2311, September 2008, doi: 10.1093/ietisy/e91-d.9.2300.
Abstract: We present a systematic and efficient way of managing the path metric memory and simplifying its connection network to the add_compare_select unit (ACSU) for Viterbi decoder (VD) design. Using the derived equations for memory partition and add-compare-select (ACS) arrangement together with the extended in-place scheduling scheme proposed in this work, we can increase the memory bandwidth for conflict-free path metric accesses with hardwired interconnection between the path metric memory and ACSU. Compared with the existing work, the developed architecture possesses the following advantages: (1) Each partitioned memory bank can be treated as a local memory of a specific processing element, inside the ACSU, with hardwired interconnection, so that the interconnect complexity is reduced significantly. (2) The partitioned memory banks can be merged into only two pseudo-banks regardless of the number of adopted ACS processing elements. This not only greatly simplifies the design of address generation unit, but also makes smaller the physical size of required memory. (3) The implementation can be accomplished in a systematic way with regular and simple controlling circuitry. Experimental results demonstrate the effectiveness of the developed architecture and the benefit will be more apparent for convolutional codes with large memory order.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e91-d.9.2300/_p
Copier
@ARTICLE{e91-d_9_2300,
author={Ming-Der SHIEH, Tai-Ping WANG, Chien-Ming WU, },
journal={IEICE TRANSACTIONS on Information},
title={Reducing Interconnect Complexity for Efficient Path Metric Memory Management in Viterbi Decoders},
year={2008},
volume={E91-D},
number={9},
pages={2300-2311},
abstract={We present a systematic and efficient way of managing the path metric memory and simplifying its connection network to the add_compare_select unit (ACSU) for Viterbi decoder (VD) design. Using the derived equations for memory partition and add-compare-select (ACS) arrangement together with the extended in-place scheduling scheme proposed in this work, we can increase the memory bandwidth for conflict-free path metric accesses with hardwired interconnection between the path metric memory and ACSU. Compared with the existing work, the developed architecture possesses the following advantages: (1) Each partitioned memory bank can be treated as a local memory of a specific processing element, inside the ACSU, with hardwired interconnection, so that the interconnect complexity is reduced significantly. (2) The partitioned memory banks can be merged into only two pseudo-banks regardless of the number of adopted ACS processing elements. This not only greatly simplifies the design of address generation unit, but also makes smaller the physical size of required memory. (3) The implementation can be accomplished in a systematic way with regular and simple controlling circuitry. Experimental results demonstrate the effectiveness of the developed architecture and the benefit will be more apparent for convolutional codes with large memory order.},
keywords={},
doi={10.1093/ietisy/e91-d.9.2300},
ISSN={1745-1361},
month={September},}
Copier
TY - JOUR
TI - Reducing Interconnect Complexity for Efficient Path Metric Memory Management in Viterbi Decoders
T2 - IEICE TRANSACTIONS on Information
SP - 2300
EP - 2311
AU - Ming-Der SHIEH
AU - Tai-Ping WANG
AU - Chien-Ming WU
PY - 2008
DO - 10.1093/ietisy/e91-d.9.2300
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E91-D
IS - 9
JA - IEICE TRANSACTIONS on Information
Y1 - September 2008
AB - We present a systematic and efficient way of managing the path metric memory and simplifying its connection network to the add_compare_select unit (ACSU) for Viterbi decoder (VD) design. Using the derived equations for memory partition and add-compare-select (ACS) arrangement together with the extended in-place scheduling scheme proposed in this work, we can increase the memory bandwidth for conflict-free path metric accesses with hardwired interconnection between the path metric memory and ACSU. Compared with the existing work, the developed architecture possesses the following advantages: (1) Each partitioned memory bank can be treated as a local memory of a specific processing element, inside the ACSU, with hardwired interconnection, so that the interconnect complexity is reduced significantly. (2) The partitioned memory banks can be merged into only two pseudo-banks regardless of the number of adopted ACS processing elements. This not only greatly simplifies the design of address generation unit, but also makes smaller the physical size of required memory. (3) The implementation can be accomplished in a systematic way with regular and simple controlling circuitry. Experimental results demonstrate the effectiveness of the developed architecture and the benefit will be more apparent for convolutional codes with large memory order.
ER -