In three main divisions the book covers combinational circuits, latches, and asynchrous sequential circuits. Combinational circuits have memorising ability, while sequential circuits have such an ability to various degrees. Latches are the simplest sequential circuits, ones with the shortest memory. The presentation is decidedly n-standard. The design of combinational circuits is discussed in an orthodox manner using rmal forms and in an urthodox manner using set-theoretical evaluation formulas relying heavily on Karnaugh maps. The latter approach allows for a new design technique called composition. Latches are covered very extensively. Their memory functions are expressed mathematically in a time-independent manner allowing the use of (rmal, n-temporal) Boolean logic in their calculation. The theory of latches is then used as the basis for calculating asynchrous circuits. Asynchrous circuits are specified in a tree-representation, each internal de of the tree representing an internal latch of the circuit, the latches specified by the tree itself. The tree specification allows solutions of formidable problems such as algorithmic state assignment, finding equivalent states n-recursively, and verifying asynchrous circuits.
Shimon Peter Vingron
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Date of Publication
Computing: Professional & Programming
Place of Publication
Country of Publication
Springer-Verlag Berlin and Heidelberg GmbH & Co. K