Abstract
For hardware realization of computer programs (for the realization of software as hardware) it is very important to represent, to transform and to synthesize very complex Finite State Machines (FSM). This work contains the first report about CAD system Synthesis 1 for design of FSMs with hardly any constraints on their size, that is, the number of inputs, outputs and states. Synthesis 1 implements automatically various transformations of an Algorithmic State Machine (minimization, composition, decomposition etc.) and synthesis of FSM's logic circuit as (a) multilevel circuit with gates from a predefined library; (b) with standard LSI and VLSI circuits without memory, such as PLA(s,t,q) — programmable logic arrays with s inputs, t outputs and q horizontals; (c) with standard LSI and VLSI circuits with memory, such as PLAM(s,t,q,r) — programmable logic arrays with s inputs, t outputs, q horizontals and r memory elements; (d) matrices circuits on the chip with a minimization of the chip area; (e) with LUTs (Look-Up-Tables) for FPGA technology.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baranov, S.: Logic Synthesis for Control Automata. Kluwer Academic Publishers, Boston — London — Dordrecht, (1994)
Jozwiak, L., Kolsteren, J.: An efficient method for the decomposition of sequential machines. Microprocessing and Microprogramming. 32, (1991) 657–664
Baranov, S., Bregman, L.: Synthesis of automata from elements with given constraints on their complexity. Journal of Microcomputer Applications. 17, (1994) 227–237
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baranov, S. (1998). CAD system for ASM and FSM synthesis. In: Hartenstein, R.W., Keevallik, A. (eds) Field-Programmable Logic and Applications From FPGAs to Computing Paradigm. FPL 1998. Lecture Notes in Computer Science, vol 1482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055239
Download citation
DOI: https://doi.org/10.1007/BFb0055239
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64948-9
Online ISBN: 978-3-540-68066-6
eBook Packages: Springer Book Archive