Skip to main content

Combinational Logic

  • Chapter
  • 76 Accesses

Abstract

To express any body of ideas in a meaningful form, some sort of logical framework is required. This book is concerned with digital systems, and the framework used is that based on a mathematical logic developed largely by the English mathematician George Boole. Boole published the basic axioms and rules for a two-valued algebra in 1854, but for the rest of the nineteenth century his work remained firmly in the province of mathematics (see Boole, 1953). Huntington (1904) published a set of postulates for a two-state algebra which forms the basis of our modern approach to boolean algebra. However, it was not until 1938 that this algebra was shown to be a useful tool for the engineer. Shannon (1938) introduced a switching algebra, adapting boolean algebra for use in the analysis of relay switching networks used in telephone systems. The development of digital systems since the 1940s, initially restricted to the digital computer, now extends over a seemingly unlimited range of applications. A grasp of the structure of Boole’s two-state logic is essential to the understanding of switching theory, which is itself fundamental to the design of all digital systems.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Boole, G. (1953). An Investigation of the Laws of Thought, originally published 1854, republished by Dover Publications, New York

    Google Scholar 

  • Evans, F. C. (1969). Use of inverse Karnaugh maps in realization of logic functions, Electronic Letters, 5, No. 21 (October), 670

    Article  Google Scholar 

  • Huntington, E. V. (1904). Postulates for the algebra of logic, Trans. Am. Math. Soc., 5, 288–309

    Article  MathSciNet  MATH  Google Scholar 

  • Karnaugh, M. (1953). The map method for synthesis of combinational logic circuits, Trans. Am. Inst. Elect. Engrs., 72 pt. 1, 593–9

    MathSciNet  Google Scholar 

  • Lewin, D. (1985). Design of Logic Systems, Van Nostrand Reinhold, New York

    Google Scholar 

  • McCluskey, E. J. (1956). Minimisation of boolean functions, Bell Syst. Tech. J., 35, No. 6 (November), 1417–44

    Article  MathSciNet  Google Scholar 

  • Mead, C. and Conway, L. (1980). Introduction to VLSI Systems, Addison-Wesley, Reading, Massachusetts

    Google Scholar 

  • Mukherjee, A. (1986). Introduction to nMOS and CMOS VLSI Systems Design, Prentice-Hall, Englewood Cliffs, New Jersey

    Google Scholar 

  • Muroga, S. (1979). Logic Design and Switching Theory, John Wiley, New York

    MATH  Google Scholar 

  • Quine, W. V. (1955). A way to simplify truth functions, Am. Math. Mon., 62, November, 627–31

    Article  MathSciNet  MATH  Google Scholar 

  • Shannon, C. E. (1938). A symbolic analysis of relay and switching circuits, Trans. Am. Inst. Elect. Engrs., 57, 713–23

    Article  Google Scholar 

  • Veitch, E. W. (1952). A chart method for simplifying truth functions, Proc. Ass. Comput. Mach., May, 127–33

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Copyright information

© 1987 B. R. Bannister and D. G. Whitehead

About this chapter

Cite this chapter

Bannister, B.R., Whitehead, D.G. (1987). Combinational Logic. In: Fundamentals of Modern Digital Systems. Palgrave, London. https://doi.org/10.1007/978-1-349-18858-1_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-349-18858-1_1

  • Publisher Name: Palgrave, London

  • Print ISBN: 978-0-333-44287-6

  • Online ISBN: 978-1-349-18858-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics