Reducing the number of LUTs for Mealy FSMS with state transformation
From MaRDI portal
Publication:6567112
DOI10.61822/AMCS-2024-0012MaRDI QIDQ6567112FDOQ6567112
Authors: Alexander Barkalov, Larysa Titarenko, Kamil Mielcarek 
Publication date: 4 July 2024
Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)
Formal languages and automata (68Q45) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Mathematical problems of computer architecture (68M07)
Cites Work
- Functional decomposition with application to FPGA synthesis
- Minimization of mealy finite-state machines by internal states gluing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hardware reduction for LUT-based Mealy FSMs
- Improving characteristics of LUT-based Mealy FSMs
- Embedded System Design
This page was built for publication: Reducing the number of LUTs for Mealy FSMS with state transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567112)
