Modern Digital Design And Switching Theory

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.

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.

Covers the principles of designing digital electronic circuits and presents realistic applications using integrated circuit devices. The book also discusses ways to utilize programmable logic device software and hardware.

"The book 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."--Publisher's description.