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
Este artigo propõe um método para mapear uma máquina de estados finitos (FSM) em um array bidimensional de LUTs, que faz parte de nossa arquitetura de células plásticas (PCA). LSIs baseados no PCA já foram implementados como dispositivos assíncronos. As funções executadas nos LSIs também devem ser assíncronas. Para fazer bom uso dos LSIs, é necessário um sistema que traduza funções em informações de circuito para o PCA. Apresentamos um sistema protótipo que mapeia um FSM assíncrono no PCA. Primeiro, um método básico de mapeamento é considerado e, em seguida, criamos três métodos para minimizar o tamanho do circuito. Alguns conjuntos de benchmark são sintetizados para estimar sua eficiência. Os resultados experimentais mostram que todos os métodos podem mapear um FSM assíncrono no PCA e que os três métodos podem efetivamente reduzir o tamanho do circuito.
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.
Copiar
Minoru INAMORI, Hiroshi NAKADA, Ryusuke KONISHI, Akira NAGOYA, Kiyoshi OGURI, "A Method of Mapping Finite State Machine into PCA Plastic Parts" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 4, pp. 804-810, April 2002, doi: .
Abstract: This paper proposes a method for mapping a finite state machine (FSM) into a two-dimensional array of LUTs, which is a part of our plastic cell architecture (PCA). LSIs based on the PCA have already implemented as asynchronous devices. Functions that run on the LSIs must also be asynchronous. In order to make good use of the LSIs, a system that translates functions into circuit information for the PCA is needed. We introduce a prototype system that maps an asynchronous FSM onto the PCA. First, a basic mapping method is considered, and then we create three methods to minimize circuit size. Some benchmark suites are synthesized to estimate their efficiency. Experimental results show that all the methods can map an asynchronous FSM onto the PCA and that the three methods can effectively reduce circuit size.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_4_804/_p
Copiar
@ARTICLE{e85-a_4_804,
author={Minoru INAMORI, Hiroshi NAKADA, Ryusuke KONISHI, Akira NAGOYA, Kiyoshi OGURI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Method of Mapping Finite State Machine into PCA Plastic Parts},
year={2002},
volume={E85-A},
number={4},
pages={804-810},
abstract={This paper proposes a method for mapping a finite state machine (FSM) into a two-dimensional array of LUTs, which is a part of our plastic cell architecture (PCA). LSIs based on the PCA have already implemented as asynchronous devices. Functions that run on the LSIs must also be asynchronous. In order to make good use of the LSIs, a system that translates functions into circuit information for the PCA is needed. We introduce a prototype system that maps an asynchronous FSM onto the PCA. First, a basic mapping method is considered, and then we create three methods to minimize circuit size. Some benchmark suites are synthesized to estimate their efficiency. Experimental results show that all the methods can map an asynchronous FSM onto the PCA and that the three methods can effectively reduce circuit size.},
keywords={},
doi={},
ISSN={},
month={April},}
Copiar
TY - JOUR
TI - A Method of Mapping Finite State Machine into PCA Plastic Parts
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 804
EP - 810
AU - Minoru INAMORI
AU - Hiroshi NAKADA
AU - Ryusuke KONISHI
AU - Akira NAGOYA
AU - Kiyoshi OGURI
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2002
AB - This paper proposes a method for mapping a finite state machine (FSM) into a two-dimensional array of LUTs, which is a part of our plastic cell architecture (PCA). LSIs based on the PCA have already implemented as asynchronous devices. Functions that run on the LSIs must also be asynchronous. In order to make good use of the LSIs, a system that translates functions into circuit information for the PCA is needed. We introduce a prototype system that maps an asynchronous FSM onto the PCA. First, a basic mapping method is considered, and then we create three methods to minimize circuit size. Some benchmark suites are synthesized to estimate their efficiency. Experimental results show that all the methods can map an asynchronous FSM onto the PCA and that the three methods can effectively reduce circuit size.
ER -