Reducing the use of resources in the FPGA circuit of a Moore FSM

DOI10.1007/S10559-013-9586-0zbMATH Open1316.94134OpenAlexW2018313747MaRDI QIDQ466444FDOQ466444

Authors: L. A. Tytarenko, R. V. Malcheva, K. A. Soldatov, Alexander Barkalov 

Publication date: 27 October 2014

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-013-9586-0

Recommendations

• Joint use of methods of structural decomposition for optimizing the circuit of Moore FSM
• A method for minimizing Moore finite-state machines by merging two states
• Hardware reduction for LUT-based Mealy FSMs
• scientific article; zbMATH DE number 1751919
• Minimization of Mealy finite-state machines by using the values of the output variables for state assignment

zbMATH Keywords

FPGAflowgraph of an algorithmMoore finite-state machinepseudoequivalent state

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Logic synthesis for compositional microprogram control units
• Principles of logic optimization for a Moore microprogrammed automaton

Cited In (10)

• Title not available (Why is that?)
• Improving characteristics of LUT-based mealy FSMs
• Title not available (Why is that?)
• Joint use of methods of structural decomposition for optimizing the circuit of Moore FSM
• Sequential algorithm for low-power encoding internal states of finite state machines
• Mixed encoding of collections of microoperations for a microprogram finite-state machine
• Hardware reduction for LUT-based Mealy FSMs
• Reconfigurable finite state machines with shared memory
• Title not available (Why is that?)
• Improvement of FSM synthesis using the transition matrix representation

This page was built for publication: Reducing the use of resources in the FPGA circuit of a Moore FSM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q466444)