Decomposition-Based Methods for FSM Implementation
Mariusz Rawski , Piotr Wojciech Szotkowski , Paweł Tomaszewicz
AbstractDesigning a complex digital system requires an effective method for modeling the sequential part of the system. One of the methods is the Finite State Machine based modeling. The implementation efficiency of the sequential part of the designed system has usually a great impact on the processing performance of the whole digital system . Petri nets , which are another method of modeling the sequential part of systems, can also be transformed into FSM -based models. Thus, development of effective synthesis methods for FSM implementation is very important. Digital systems are often implemented in FPGA architectures. Because of their specific structure, the most efficient synthesis methods are based on functional decomposition . This chapter discusses decomposition-based methods for FSM implementation targeting programmable structures.
|Publication size in sheets||1.3|
|Book||Karatkevich Andrei, Bukowiec Arkadiusz, Doligalski Michał, Tkacz Jacek (eds.): Design of Reconfigurable Logic Controllers, vol. 45, 2016, Springer, ISBN 978-3-319-26723-4, [978-3-319-26725-8], 181 p., DOI:10.1007/978-3-319-26725-8|
|Keywords in English||FSM, Symbolic function decomposition, Logic synthesis|
|project||The Develpment of Digital Communicatios. Project leader: Siuzdak Jerzy,
, Phone: +48 22 234-7232, start date 27-04-2015, end date 31-12-2016, IT/2015/statut, Completed
|Score||= 0.0, 27-03-2017, BookChapterNotSeriesMainLanguages|
|Citation count*||0 (2016-03-06)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.