Advertisement

Combinational Logic Minimization

  • Dhanasekharan Natarajan
Chapter
  • 35 Downloads
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 623)

Abstract

The general approach for designing combinational logic circuits is illustrated with an example. Logic functions are the output of the design of combinational circuits and they should be simplified before implementation. Algebraic method, Karnaugh mapping and Quine-McCluskey methods for simplifying logic functions are explained and illustrated with examples. Hazards usually exist with the implementation of logic functions. The types of hazards and compensating circuits to eliminate the hazards are explained.

References

  1. 1.
    Doran R (2007) The gray code. J Univ Comput Science 13(11):1573–1597MathSciNetGoogle Scholar
  2. 2.
    Givone D (2003) Digital principles and design. McGraw-Hill Higher EducationGoogle Scholar
  3. 3.
    Shum W, Anderson J (2007) FPGA glitch power analysis and reduction. In: ACM international symposium on low power electronics and design, IEEEGoogle Scholar
  4. 4.
    Flynn M, Mitra S (2017) Edward J. McCluskey 1929–2016. IEEE Des TestGoogle Scholar
  5. 5.
    He J, Turner KJ (2001) Specifying hardware timing with ET-LOTOS. In: Proceedings of 11th conference on Correct Hardware Design and Verification Methods (CHARME 2001), Lecture notes in computer science, vol 2144. Springer, pp 161–166Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Dhanasekharan Natarajan
    • 1
  1. 1.BengaluruIndia

Personalised recommendations