Skip to main content Accessibility help
×
  • Cited by 5
Publisher:
Cambridge University Press
Online publication date:
November 2012
Print publication year:
2012
Online ISBN:
9781139226455

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 analyzedAlgorithmic solutions are offered for logical simulation, computation of propagation delay and minimum clock periodConnections are drawn from the physical analog world to the digital abstractionThe language of graphs is used to describe formulas and circuitsHundreds of figures, examples and exercises enhance understanding.The extensive website (http://www.eng.tau.ac.il/~guy/Even-Medina/) includes teaching slides, links to Logisim and a DLX assembly simulator.

Reviews

'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)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

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.
×

Contents


Page 1 of 2



Page 1 of 2


Bibliography
Bibliography
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.

Metrics

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.