Description Introduction to Logic Design by Alan Marcovitz is intended for the first course in logic design, taken by computer science, computer engineering, and electrical engineering students. As with the previous editions, this edition has a clear presentation of fundamentals and an exceptional collection of examples, solved problems and exercises.
The text integrates laboratory experiences, both hardware and computer simulation, while not making them mandatory for following the main flow of the chapters. Design is emphasized throughout, and switching algebra is developed as a tool for analyzing and implementing digital systems. The presentation includes excellent coverage of minimization of combinational circuits, including multiple output ones, using the Karnaugh map and iterated consensus. There are a number of examples of the design of larger systems, both combinational and sequential, using medium scale integrated circuits and programmable logic devices.
The third edition features two chapters on sequential systems. The first chapter covers analysis of sequential systems and the second covers design. Complete coverage of the analysis and design of synchronous sequential systems adds to the comprehensive nature of the text. The derivation of state tables from word problems further emphasizes the practical implementation of the material being presented.
All of the K-Map (Karnaugh map) coverage is presented in one chapter (chapter 3) instead of coverage appearing in two chapters.
For the third edition, Chapter 9 will be posted on the website. This allows for additional coverage of other topics without increasing the length of the text.
Additional experiments have been added to Appendix D to allow students the opportunity to perform a variety of experiments.
New Appendix A (Relating the Algebra to the Karnaugh Map) ties algebra coverage and K-Map coverage together.
New problems have been added in Appendix E for both combinational and sequential systems which go from word problem to circuit all in one place.
An extensive set of examples, well integrated into the body of the text as well as at the end of each chapter in sections of solved problems, gives students multiple opportunities to understand the topics being presented.
A feature of this text is the Solved Problems. Each chapter has a large number of problems, illustrating the techniques developed in the body of the text, followed by a detailed solution of each problem.
Each chapter contains a large set of exercises. Answers to a selection of these are contained in Appendix B. Solutions are made available to instructors on the website.
Iterated Consensus and Quine-McCluskey coverage is included in the third edition.
The third edition features two chapters on sequential systems. The first chapter covers analysis of sequential systems and the second covers design. Complete coverage of the analysis and design of synchronous sequential systems adds to the comprehensive nature of the text.
A clear and well-paced writing style makes this text especially well-suited for students who might otherwise find this course area particularly challenging.
The text integrates practical circuits with theory by presenting two types of laboratory experiments. Traditional hands-on hardware experiments as well as simulation laboratory exercises using popular software packages are tied closely to the text material to allow students to implement the concepts they are learning.
Use of the Karnaugh map helps students understand the principles of switching algebra.
A thorough discussion of the minimization of switching functions using Karnaugh maps, including 6-variable maps and multiple output problems, gives students something to sink their teeth into and doesn't leave them wondering about the unusual or boundary case.
Coupling of gate implementation with the algebra helps extend the students' range of understanding.
Color is used as a pedagogical aid.
The derivation of state tables from word problems further emphasizes the practical implementation of the material being presented.
Table of Contents 1 Introduction 2 Combinational Systems 3 The Karnaugh Map 4 Function Minimization Algorithms 5 Designing Combinational Systems 6 Analysis of Sequential Systems 7 The Design of Sequential Systems 8 Solving Larger Sequential Problems 9 Simplification of Sequential Circuits Appendix A Relating the Algebra to the Karnaugh Map Appendix B Answers to Selected Exercises Appendix C Chapter Tests Answers Appendix D Laboratory Experiments Appendix E Complete Examples