Advertisement

Combinational Logic

  • B. R. Bannister
  • D. G. Whitehead
Chapter

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boole, G. (1953). An Investigation of the Laws of Thought, originally published 1854, republished by Dover Publications, New YorkGoogle Scholar
  2. Evans, F. C. (1969). Use of inverse Karnaugh maps in realization of logic functions, Electronic Letters, 5, No. 21 (October), 670CrossRefGoogle Scholar
  3. Huntington, E. V. (1904). Postulates for the algebra of logic, Trans. Am. Math. Soc., 5, 288–309CrossRefMathSciNetMATHGoogle Scholar
  4. Karnaugh, M. (1953). The map method for synthesis of combinational logic circuits, Trans. Am. Inst. Elect. Engrs., 72 pt. 1, 593–9MathSciNetGoogle Scholar
  5. Lewin, D. (1985). Design of Logic Systems, Van Nostrand Reinhold, New YorkGoogle Scholar
  6. McCluskey, E. J. (1956). Minimisation of boolean functions, Bell Syst. Tech. J., 35, No. 6 (November), 1417–44CrossRefMathSciNetGoogle Scholar
  7. Mead, C. and Conway, L. (1980). Introduction to VLSI Systems, Addison-Wesley, Reading, MassachusettsGoogle Scholar
  8. Mukherjee, A. (1986). Introduction to nMOS and CMOS VLSI Systems Design, Prentice-Hall, Englewood Cliffs, New JerseyGoogle Scholar
  9. Muroga, S. (1979). Logic Design and Switching Theory, John Wiley, New YorkMATHGoogle Scholar
  10. Quine, W. V. (1955). A way to simplify truth functions, Am. Math. Mon., 62, November, 627–31CrossRefMathSciNetMATHGoogle Scholar
  11. Shannon, C. E. (1938). A symbolic analysis of relay and switching circuits, Trans. Am. Inst. Elect. Engrs., 57, 713–23CrossRefGoogle Scholar
  12. Veitch, E. W. (1952). A chart method for simplifying truth functions, Proc. Ass. Comput. Mach., May, 127–33Google Scholar

Copyright information

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

Authors and Affiliations

  • B. R. Bannister
    • 1
  • D. G. Whitehead
    • 2
  1. 1.Microelectronics and Microprocessor Applications LaboratoryUniversity of HullUK
  2. 2.Department of Electronic EngineeringUniversity of HullUK

Personalised recommendations