This comprehensive text on switching theory and logic design is designed for the undergraduate students of electronics and communication engineering, electrical and electronics engineering, electronics and instrumentation engineering, telecommunication engineering, computer science and engineering, and information technology. It will also be useful to AMIE, IETE and diploma students. Written in a student-friendly style, this book, now in its Second Edition, provides an in-depth knowledge of switching theory and the design techniques of digital circuits. Striking a balance between theory and practice, it covers topics ranging from number systems, binary codes, logic gates and Boolean algebra to minimization using K-maps and tabular method, design of combinational logic circuits, synchronous and asynchronous sequential circuits, and algorithmic state machines. The book discusses threshold gates and programmable logic devices (PLDs). In addition, it elaborates on flip-flops and shift registers. Each chapter includes several fully worked-out examples so that the students get a thorough grounding in related design concepts. Short questions with answers, review questions, fill in the blanks, multiple choice questions and problems are provided at the end of each chapter. These help the students test their level of understanding of the subject and prepare for examinations confidently. NEW TO THIS EDITION • VHDL programs at the end of each chapter • Complete answers with figures • Several new problems with answers

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.

This comprehensive text fulfills the course requirement on the subject of Switching Theory and Digital Circuit Design for B. Tech. degree course in Electronics, Computer Science and Technology, Electronic & Communication, Electronic & Electrical, Electronic & Instrumentation, Electronic Instrumentation & Control, Instrumentation & Control Engineering of U.P. Technical University, Lucknow and other Technical Universities of India. It will also serve as a useful reference book for competitive examinations. All the topics are illustrated with clear diagram and simple language is used throughout the text to facilitate easy understanding of the concepts. There is no special pre-requisite before starting this book. Each chapter of the book starts with simple facts and concepts, and traverse through the examples and figures.

Modern Digital Design and Switching Theory is an important text that focuses on promoting an understanding of digital logic and the computer programs used in the minimization of logic expressions. Several computer approaches are explained at an elementary level, including the Quine-McCluskey method as applied to single and multiple output functions, the Shannon expansion approach to multilevel logic, the Directed Search Algorithm, and the method of Consensus. Chapters 9 and 10 offer an introduction to current research in field programmable devices and multilevel logic synthesis. Chapter 9 covers more advanced topics in programmed logic devices, including techniques for input decoding and Field-Programmable Gate Arrays (FPGAs). Chapter 10 includes a discussion of boolean division, kernels and factoring, boolean tree structures, rectangle covering, binary decision diagrams, and if-then-else operators. Computer algorithms covered in these two chapters include weak division, iterative weak division, and kernel extraction by tabular methods and by rectangle covering theory. Modern Digital Design and Switching Theory is an excellent textbook for electrical and computer engineering students, in addition to a worthwhile reference for professionals working with integrated circuits.

Switching Theory and Logic Design is for a first-level introductory course on digital logic design. This book illustrates the usefulness of switching theory and its applications, with examples to acquaint the student with the necessary background. This book has been designed as a prerequisite to many other courses like Digital Integrated Circuits, Computer Organisation, Digital Instrumentation, Digital Control, Digital Communications and Hardware Description Languages.

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.