Improvement of FSM synthesis using the transition matrix representation

MaRDI QIDQ5420937zbMATH OpenFDO

Authors Alexandru Valachi, Mihai Timiş, Alexandru Barleanu, Andrei Stan

Publication date 13 June 2014

zbMATH Keywords

Boolean functionsfinite state machineLSI multifunctional circuitsMSItransition matrix

Mathematics Subject Classification ID

Recommendations

• Publication:4332902
• Structural decomposition as a tool for the optimization of an FPGA-based implementation of a Mealy FSM
• Synthesis of finite state machines for CPLDs
• Reducing the use of resources in the FPGA circuit of a Moore FSM
• Improving characteristics of LUT-based mealy FSMs

Cited in

(2)

• Improving the LUT count for mealy FSMS with transformation of output collections
• A matrix method for detecting formal solutions to the problem of algebraic synthesis of a finite-state machine with a datapath of transitions

This page was built for publication: Improvement of FSM synthesis using the transition matrix representation

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