Skip to main content Accessibility help
Digital Logic Design
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 5
  • Cited by
    This book has been cited by the following publications. This list is generated based on data provided by CrossRef.

    2018. Computational Psychoanalysis and Formal Bi-Logic Frameworks. p. 38.

    2018. Computational Psychoanalysis and Formal Bi-Logic Frameworks. p. 136.

    2018. Computational Psychoanalysis and Formal Bi-Logic Frameworks. p. 206.

    2018. Computational Psychoanalysis and Formal Bi-Logic Frameworks. p. 222.

    Melendy, Robert 2014. A Proposed Exercise to Reinforce Abstract Thinking for Upper-Division Computer and Electrical Engineering Students: Modeling a High-Speed Inverter Using Cognitive Representations and Abstract Algebra. World Journal of Engineering and Technology, Vol. 02, Issue. 04, p. 298.


Book description

This textbook, based on the authors' fifteen years of teaching, is a complete teaching tool for turning students into logic designers in one semester. Each chapter describes new concepts, giving extensive applications and examples. Assuming no prior knowledge of discrete mathematics, the authors introduce all background in propositional logic, asymptotics, graphs, hardware and electronics. Important features of the presentation are:• All material is presented in full detail. 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 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 ( includes teaching slides, links to Logisim and a DLX assembly simulator.


'I highly recommend this book for academic courses on digital design.'

Vladimir Botchev Source: Computing Reviews

'… a very useful textbook … Throughout the book, the mathematical approach, the gradually presented notions and the very rigorous proofs are remarkable.'

Source: Zentralblatt MATH

Refine List
Actions for selected content:
Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Send to Kindle
  • Send to Dropbox
  • Send to Google Drive
  • Send content to

    To send content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about sending content to .

    To send content items to your Kindle, first ensure is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.

    Note you can select to send to either the or variations. ‘’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

    Find out more about the Kindle Personal Document Service.

    Please be advised that item(s) you selected are not available.
    You are about to send

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.

Page 1 of 2

Page 1 of 2

Cohen, D.On holy wars and a plea for peace. Computer, 14(10):48–54, 1981.
Ercegovac, M.D., and T., Lang. Digital arithmetic. Morgan Kaufmann, 2003.
Ercegovac, M.D., J.H., Moreno, and T., Lang. Introduction to digital systems. John Wiley, New York, 1998.
Hopcroft, J.E., R., Motwani, and J.D., Ullman. Introduction to automata theory, languages, and computation. Vol. 3. Addison-Wesley, Reading, MA, 1979.
Howson, C.Logic with trees: Introduction to symbolic logic. Routledge, 1997.
Karnaugh, M.The map method for synthesis of combinational logic circuits. Transactions of the AIEE. I, 72(9):593–599, 1953.
Litman, A.Lecture notes in digital design (in Hebrew). Faculty of Computer Science, Technion, 2003.
Mattson, H.F.Discrete mathematics with applications. John Wiley, New York, 1993.
McCluskey, E.J.Minimization of Boolean functions. Bell Systems Technical Journal, 35(5):1417–1444, 1956.
McEliece, R.J., C., Ash, and R.B., Ash. Introduction to discrete mathematics. Random House, New York, 1989.
Müller, S.M., and W.J., Paul. The complexity of simple computer architectures. Springer Lecture Notes in Computer Science, Vol. 995. Springer, New York, 1996.
Patterson, D.A., and J.L., Hennessy. Computer organization and design: The hardware/software interface. Morgan Kaufmann, 1994.
Quine, W.V.The problem of simplifying truth functions. American Mathematical Monthly, 59(8):521–531, 1952.
Quine, W.V.A way to simplify truth functions. American Mathematical Monthly, 62(9):627–631, 1955.
Savage, J.E.Models of computation: Exploring the power of computing. Addison-Wesley Longman, Boston, 1997.
Ward, S.A., and R.H., Halstead. Computation structures. MIT Press, Cambridge, MA, 1990.


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Book summary page views

Total views: 0 *
Loading metrics...

* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

Usage data cannot currently be displayed