Logic Synthesis for Control Automata provides techniques for logic design of very complex control units with hardly any constraints on their size, i.e. the number of inputs, outputs and states. These techniques cover all stages of control unit design, including: description of control unit behavior by using operator schemes of algorithms (binary decision trees) and various transformations of these descriptions -- composition, decomposition, minimization, etc.; synthesis of a control automaton (finite-state machine); synthesis of an automaton logic circuit: with matrix structure as a part of LSI or VLSI circuits; as multilevel circuit with logic gates; with standard LSI and VLSI circuits with and without memory. Each chapter contains many examples, illustrating the use of the models and methods described. Moreover, the special last chapter demonstrates in detail the whole design methodology presented in the previous chapters, through the examples of the logic design for a control unit. The models, methods and algorithms described in the book can be applied to a broad class of digital system design problems including design of complex controllers, robots, control units of computers and for designing CAD systems of VLSI circuits using FPGA, PLD and SIC technologies. Logic Synthesis for Control Automata is a valuable reference for graduate students, researchers and engineers involved in the design of very complex controllers, VLSI circuits and CAD systems. The inclusion of many examples and problems makes it most suitable for a course on the subject.
Auflage
Softcover reprint of the original 1st ed. 1994
Sprache
Verlagsort
Zielgruppe
Für Beruf und Forschung
Research
Illustrationen
Maße
Höhe: 240 mm
Breite: 160 mm
Dicke: 23 mm
Gewicht
ISBN-13
978-1-4613-6158-9 (9781461361589)
DOI
10.1007/978-1-4615-2692-6
Schweitzer Klassifikation
1 Automata.- 1.1 Abstract automata.- 1.2 Structure automata.- 1.3 Exercises.- 2 Operator Schemes of Algorithms.- 2.1 Control and operational automaton.- 2.2 Graph-scheme of algorithm.- 2.3 Execution of GSA.- 2.4 Flowchart.- 2.5 Transition formulae.- 2.6 Logical scheme of algorithm.- 2.7 Matrix scheme of algorithm.- 2.8 Exercises.- 3 Synthesis of Control Automaton.- 3.1 Synthesis of Mealy control automaton.- 3.2 Synthesis of Moore control automaton.- 3.3 Synthesis of combined control automaton.- 3.4 Synthesis of control automaton logic circuit.- 3.5 Control automaton decomposition.- 3.6 Exercises.- 4 Matrix Realization of Control Automata.- 4.1 Matrix realization of logic circuits.- 4.2 Primitive matrix realization of control automaton.- 4.3 Input variable replacement and state assignment.- 4.4 Microinstruction coding.- 4.5 Six-matrices realization.- 4.6 Matrices decomposition.- 4.7 Automata decomposition and matrix realization.- 4.8 Exercises.- 5 Logic Synthesis of Control Automata with PIA.- 5.1 Automata synthesis with PLA.- 5.2 Automata synthesis with PLAM.- 5.3 Exercises.- 6 Logic Synthesis of Control Automata with Gates.- 6.1 Factoring logic circuits.- 6.2 Term decomposition.- 6.3 Synthesis of automaton logic circuit with gates.- 6.4 Knots in GSA and decomposition of logic circuits.- 6.5 Synthesis of logic circuit by structure table with knots.- 6.6 Exercises.- 7 Transformations of Graph-Schemes of Algorithms.- 7.1 Minimization of conditional vertices in GSA.- 7.2 Minimization of operator vertices in GSA.- 7.3 Combining graph-schemes of algorithms.- 7.4 Decomposition of graph-schemes of algorithms.- 7.5 Exercises.- 8 Examples of Control Units Design.- 8.1 GSA combining.- 8.2 Control automaton synthesis.- 8.3 Matrix realization of control automaton.- 8.4 Synthesis ofcontrol automaton with PLA.- 8.5 Synthesis of control automaton with PLAM.- 8.6 Synthesis of control automaton with logic gates.- References.
