Digital Logic Design - A Rigorous Approach

This introductory textbook, based on the authors' 15 years experience in teaching logic design, is a complete teaching tool for turning students into logic designers in one semester. It covers combinational circuits, basic, computer arithmetic, synchronous circuits, finite state machines, logical simulation, and an implementation of a simple RISC processor and its machine language. Each chapter first describes new concepts and then gives extensive applications and examples of these new ideas. Assuming no prior knowledge of discrete mathematics, the authors introduce all the necessary background in propositional logic, asymptotics, graphs, hardware and electronics. Important features of the presentation are: Every designed circuit is formally specified and implemented; the correctness of the implementation is proved, and the cost and delay are analyzed Algorithmic solutions are offered for tasks such as logical simulation, computation of propagation delay, and minimum clock period Connections are drawn from the physical analog world to the digital abstraction The language of graphs is used to describe formulas and circuits Hundreds of figures, examples and exercises enhance understanding The extensive website http://www.eng.tau.ac.il/~guy/Even-Medina/ includes teaching slides and links to Logisim and a DLX assembly simulator.

[1]  Robert J. McEliece,et al.  Introduction to Discrete Mathematics , 1989 .

[2]  Danny Cohen On Holy Wars and a Plea for Peace , 1981, Computer.

[3]  M. Karnaugh The map method for synthesis of combinational logic circuits , 1953, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[4]  Willard Van Orman Quine,et al.  The Problem of Simplifying Truth Functions , 1952 .

[5]  Willard Van Orman Quine,et al.  A Way to Simplify Truth Functions , 1955 .

[6]  Colin Howson Logic with trees : an introduction to symbolic logic , 2005 .

[7]  Milos D. Ercegovac,et al.  Digital Arithmetic , 2003, Wiley Encyclopedia of Computer Science and Engineering.

[8]  John E. Savage,et al.  Models of computation - exploring the power of computing , 1998 .

[9]  Donald J. Patterson,et al.  Computer organization and design: the hardware-software interface (appendix a , 1993 .

[10]  M. W. Shields An Introduction to Automata Theory , 1988 .

[11]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[12]  Tomás Lang,et al.  Introduction to Digital Systems , 1998 .

[13]  E. McCluskey Minimization of Boolean functions , 1956 .

[14]  Wolfgang J. Paul,et al.  The Complexity of Simple Computer Architectures , 1995, Lecture Notes in Computer Science.

[15]  Robert H. Halstead,et al.  Computation structures , 1990, MIT electrical engineering and computer science series.

[16]  Guy Even On Teaching Fast Adder Designs: Revisiting Ladner & Fischer , 2006, Essays in Memory of Shimon Even.

[17]  Sanjeev Saxena,et al.  On Parallel Prefix Computation , 1994, Parallel Process. Lett..