Introduction to Switching Theory and Logical Design


Book Description

Provides the knowledge and skills that are basic to all digital system design. Solid foundation of theory permits development of systematic design procedures. Presents classical methods, such as Karnaugh maps. Quine-McCluskey minimization. Mealy and Moore circuits, state-table minimization, hazard-free asynchronous designs, etc. This edition features design with MSI circuits, including PLA's, and register transfer (state machine) approaches to sequential system design.










Computer Methods for Analysis of Mixed-Mode Switching Circuits


Book Description

Computer Methods for Analysis of Mixed-Mode Switching Circuits provides an in-depth treatment of the principles and implementation details of computer methods and numerical algorithms for analysis of mixed-mode switching circuits. Major topics include: -Computer-oriented formulation of mixed-mode switching circuits, -Network functions of linear and nonlinear time-varying systems, -Numerical Laplace inversion based integration algorithms and inconsistent initial conditions, -Time domain analysis of periodically switched linear and nonlinear circuits including response, sensitivity, noise, clock jitter, and statistical quantities, -Time domain analysis of circuits with internally controlled switches and over-sampled sigma-delta modulators, -Tellegen's theorem, frequency reversal theorem, and transfer function theorem of periodically switched linear circuits and their applications, -Frequency domain analysis of periodically switched linear and nonlinear circuits including response, sensitivity, group delay, noise, and statistical quantities.







Switching Theory for Logic Synthesis


Book Description

Switching Theory for Logic Synthesis covers the basic topics of switching theory and logic synthesis in fourteen chapters. Chapters 1 through 5 provide the mathematical foundation. Chapters 6 through 8 include an introduction to sequential circuits, optimization of sequential machines and asynchronous sequential circuits. Chapters 9 through 14 are the main feature of the book. These chapters introduce and explain various topics that make up the subject of logic synthesis: multi-valued input two-valued output function, logic design for PLDs/FPGAs, EXOR-based design, and complexity theories of logic networks. An appendix providing a history of switching theory is included. The reference list consists of over four hundred entries. Switching Theory for Logic Synthesis is based on the author's lectures at Kyushu Institute of Technology as well as seminars for CAD engineers from various Japanese technology companies. Switching Theory for Logic Synthesis will be of interest to CAD professionals and students at the advanced level. It is also useful as a textbook, as each chapter contains examples, illustrations, and exercises.







Modeling Digital Switching Circuits with Linear Algebra


Book Description

Modeling Digital Switching Circuits with Linear Algebra describes an approach for modeling digital information and circuitry that is an alternative to Boolean algebra. While the Boolean algebraic model has been wildly successful and is responsible for many advances in modern information technology, the approach described in this book offers new insight and different ways of solving problems. Modeling the bit as a vector instead of a scalar value in the set {0, 1} allows digital circuits to be characterized with transfer functions in the form of a linear transformation matrix. The use of transfer functions is ubiquitous in many areas of engineering and their rich background in linear systems theory and signal processing is easily applied to digital switching circuits with this model. The common tasks of circuit simulation and justification are specific examples of the application of the linear algebraic model and are described in detail. The advantages offered by the new model as compared to traditional methods are emphasized throughout the book. Furthermore, the new approach is easily generalized to other types of information processing circuits such as those based upon multiple-valued or quantum logic; thus providing a unifying mathematical framework common to each of these areas. Modeling Digital Switching Circuits with Linear Algebra provides a blend of theoretical concepts and practical issues involved in implementing the method for circuit design tasks. Data structures are described and are shown to not require any more resources for representing the underlying matrices and vectors than those currently used in modern electronic design automation (EDA) tools based on the Boolean model. Algorithms are described that perform simulation, justification, and other common EDA tasks in an efficient manner that are competitive with conventional design tools. The linear algebraic model can be used to implement common EDA tasks directly upon a structural netlist thus avoiding the intermediate step of transforming a circuit description into a representation of a set of switching functions as is commonly the case when conventional Boolean techniques are used. Implementation results are provided that empirically demonstrate the practicality of the linear algebraic model.