Skip to main content

1994 | Buch

Logic Synthesis for Control Automata

verfasst von: Samary Baranov

Verlag: Springer US

insite
SUCHEN

Über dieses Buch

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.

Inhaltsverzeichnis

Frontmatter
Chapter 1. Automata
Abstract
This chapter deals with models for the description of devices whose behavior depends not only on their present inputs, but generally on the prehistory, including the past inputs. In the first section we introduce such a model — an abstract automaton or a finite-state machine and shortly discuss the main automata models — Mealy and Moore automata, their transformations and minimization. In the second section we examine how to realize the behavior, described at the level of an abstract automaton, by means of its logic circuit. We consider the canonical method for the automaton logic synthesis and the synthesis with various memory and logic elements.
Samary Baranov
Chapter 2. Operator Schemes of Algorithms
Abstract
In this chapter, we will consider the use of operator schemes of algorithms for the behavior description of control units. We will discuss various representations of operator schemes of algorithms — a graph-scheme, a logical scheme, a matrix scheme and a system of transition formulae. We will also consider execution of operator schemes of algorithms and transformations between their various representations. In the following chapters we will use operator schemes of algorithms to design control automata with a large number of states, input and output variables and in Chapter 7 we will present techniques for transformations of operator schemes of algorithms — composition, decomposition, minimization etc.
Samary Baranov
Chapter 3. Synthesis of Control Automaton
Abstract
In Section 2.1 we considered a digital system as a composition of control and operational automata (Fig. 2.1). We used graph-schemes of algorithms (GSA) to describe the behavior of such a system. Basic methods for synthesis of a control automaton, realizing GSA will be presented in this chapter. In these methods, there are practically no restrictions on the number of states or on the number of input and output variables.
Samary Baranov
Chapter 4. Matrix Realization of Control Automata
Abstract
Any system of boolean functions y1,…, y N of binary variables x1,…, x L in a sum-of-product form may be realized as two level structure. All different terms e1,…, e H of this system are formed at the first level and the disjunctions y1,…, y N of this terms are formed at the second one.
Samary Baranov
Chapter 5. Logic Synthesis of Control Automata with Programmable Logic Arrays
Abstract
In this chapter we will consider techniques for logic synthesis of control automata from elements with given constraints on their complexity. As an example of such elements, we use programmable logic arrays (PLA) with restrictions on the number of inputs, outputs and terms. The methods considered in this chapter can be easy transformed to synthesis of control automata with LSIs with another internal structure.
Samary Baranov
Chapter 6. Logic Synthesis of Control Automata with Gates
Abstract
In Chapters 4 and 5 we considered the techniques for regular realization of complex control automata on a chip (matrix realization) and for synthesis of their logic circuits with programmable logic arrays with and without memory. In this chapter we concentrate on the multilevel minimization of the control automaton logic circuits with gates. Several simple and straightforward methods for obtaining circuit structure with more than two levels will be considered. In these methods factoring and decomposition procedures, including the use of knots in GSA, will be presented. At the end of the chapter we intend to describe in detail the design procedure for synthesis of control automata with logic gates.
Samary Baranov
Chapter 7. Transformations of Graph-Schemes of Algorithms
Abstract
In Chapter 3 we considered the use of operator schemes of algorithms for a behavior description of control units and discussed various representations of operator schemes of algorithms — graph-schemes, logical schemes, matrix-schemes and systems of transition formulae. In this chapter, we will describe transformations of graph-schemes of algorithms (GSAs) — the minimization of conditional and operator vertices, combining separate GSAs into one common GSA with minimization of its vertices and GSA decomposition into the set of component GSAs with given restrictions on the complexity of these component GSAs.
Samary Baranov
Chapter 8. Examples of Control Units Design
Abstract
In this chapter we will apply the methods described in previous chapters to examples of logic design of a control unit. The behavior of unit is described by separate GSAs, composed into combined GSA (see Chapters 2 and 7). For this combined GSA, the control automaton is synthesized (Chapter 3). Next, the logic circuits of this automaton are designed: (a) in a form of matrix realization as a part of LSI or VLSI circuits (Chapter 4); (b) with programmable logic arrays without memory (Chapter 5); (c) with programmable logic arrays with memory (Chapter 5) and (d) with logic gates (Chapter 6).
Samary Baranov
Backmatter
Metadaten
Titel
Logic Synthesis for Control Automata
verfasst von
Samary Baranov
Copyright-Jahr
1994
Verlag
Springer US
Electronic ISBN
978-1-4615-2692-6
Print ISBN
978-1-4613-6158-9
DOI
https://doi.org/10.1007/978-1-4615-2692-6