Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Raouf Senhadji-Navarro"'
Publikováno v:
Design Automation for Embedded Systems. 26:83-103
Finite State Machines with Input Multiplexing (FSMIMs) were proposed in previous work as a technique for efficient mapping Finite State Machines (FSMs) into ROM memory. In this paper, we present new contributions to the optimization process involved
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b4650ca0ce29b0325a7cc3a84b00cfc3
https://doi.org/10.1007/s10617-022-09259-z
https://doi.org/10.1007/s10617-022-09259-z
Publikováno v:
Electronics; Volume 12; Issue 3; Pages: 502
This paper proposes a new technique for implementing Finite State Machines (FSMs) in Field Programmable Gate Arrays (FPGAs). The proposed approach extends the called column compaction in two ways. First, it is applied to the state-encoding bits in ad
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::30ef8499058568005299ee89045e016f
Publikováno v:
idUS: Depósito de Investigación de la Universidad de Sevilla
Universidad de Sevilla (US)
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
Universidad de Sevilla (US)
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
This brief explores the optimization of distributed-ROM-based Finite State Machine (FSM) implementations as an alternative to conventional implementations based on Look-Up Tables (LUTs). In distributed-ROM implementations, LUTs with constant output v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f926e4b004613f8a88465cbaa727da94
https://doi.org/10.1109/tcad.2020.3039913
https://doi.org/10.1109/tcad.2020.3039913
Publikováno v:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 37:796-805
A binary-tree-based finite state machine (BT-FSM) is a state machine with a 1-bit input signal whose state transition graph is a binary tree. BT-FSMs are useful in those application areas where searching in a binary tree is required, such as computer
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::294ad093d7bcc648f1998d7f27cf8c4c
https://doi.org/10.1109/tcad.2017.2731678
https://doi.org/10.1109/tcad.2017.2731678
Publikováno v:
IEEE Latin America Transactions. 14:1115-1121
Prototyping boards based on modern Field Programmable Gate Array (FPGA) are ideal for teaching practice in digital design. The use of these prototyping boards in schools of engineering and technology allows the development of complex digital systems
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a26a085e496597ef2fceb5a69005227
https://doi.org/10.1109/tla.2016.7459587
https://doi.org/10.1109/tla.2016.7459587
Publikováno v:
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
instname
This paper discusses the problem of minimizing the reconfiguration cost of some types of reconfigurable systems. A formal definition of the problem and a proof of its NP-completeness are provided. In addition, an Integer Linear Programming formulatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cb20b49e5becdfde10968b487921ae28
https://doi.org/10.1007/s11590-015-0887-2
https://doi.org/10.1007/s11590-015-0887-2
Publikováno v:
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
instname
Finite state machines with input multiplexing (FSMIMs) have been proposed in previous works as a technique for efficient mapping FSMs into ROM memory. In this paper, we propose a new architecture for implementing FSMIMs, called FSMIM with state-based
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::99b7adfd4404e48a49ffa502de1fef60
Publikováno v:
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
instname
In this paper, we introduce a new problem related to bipartite graphs called minimum maximal k-partial-matching (MMKPM) which has been modelled by using a relaxation of the concept of matching in a graph. The MMKPM problem can be viewed as a generali
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d72ca0bbe73f8ccdc8231065e3cc97a2
Publikováno v:
ICECS
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
This paper presents a study of performance of RAM-based implementations in FPGAs of Finite State Machines (FSMs). The influence of the FSM characteristics on speed and area has been studied, taking into account the particular features of different FP
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ba540ec510a8b0e3b05904b8eced3ba3
https://doi.org/10.1109/icecs.2012.6463760
https://doi.org/10.1109/icecs.2012.6463760
Publikováno v:
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
instname
This letter proposes a new model of state machine called Finite Virtual State Machine (FVSM). A memory-based architecture and a procedure for generating FVSM implementations from Finite State Machines (FSMs) are presented. FVSM implementations provid
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d9b520b97f048d1ad91ed52febdf4b49
https://idus.us.es/xmlui/handle/11441/57681
https://idus.us.es/xmlui/handle/11441/57681