Shimon P. Vingron – författare
Visar alla böcker från författaren Shimon P. Vingron. Handla med fri frakt och snabb leverans.
4 produkter
4 produkter
1 596 kr
Skickas inom 10-15 vardagar
The topics selected are an in-depth presentation of switching algebra, a theory of memory circuits (sometimes called flop flops), a new approach to asynchronous circuits, and a newly added part presenting a unique programming technique (or language) for programmable logic controllers (PLCs).
1 598 kr
Skickas inom 10-15 vardagar
The topics selected are an in-depth presentation of switching algebra, a theory of memory circuits (sometimes called flop flops), a new approach to asynchronous circuits, and a newly added part presenting a unique programming technique (or language) for programmable logic controllers (PLCs).
1 813 kr
Kommande
This 3rd edition emphasizes applications by introducing three new chapters which guide readers meticulously through the design of feedback latches, the design of latches by composition, and an instructive, higher-order asynchronous circuit problem. This book serves as a wakeup call in the stagnant and dormant field of switching algebra and logic circuit design. It presents the material in a concise but thorough way. The topics presented are an in-depth presentation of switching algebra, a theory of elementary memory circuits (emphasizing fail-safe designs), compositional design of (combinational and memory) circuits, a new tree-approach to specifying and evaluating asynchronous sequential circuits, and finally an excursion into the field of industrial automation by presenting a unique programming technique (or language) for programmable logic controllers (PLCs). Be ready for the unorthodox and controversial.
1 401 kr
Skickas inom 5-8 vardagar
In three main divisions the book covers combinational circuits, latches, and asynchronous sequential circuits. Combinational circuits have no 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 non-standard. The design of combinational circuits is discussed in an orthodox manner using normal forms and in an unorthodox 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 (normal, non-temporal) Boolean logic in their calculation. The theory of latches is then used as the basis for calculating asynchronous circuits. Asynchronous circuits are specified in a tree-representation, each internal node 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 non-recursively, and verifying asynchronous circuits.