Minterms, Maxterms, Karnaugh Map (K-Map), and Universal Gates

  • Ata Elahi


This chapter covers minterms and maxterms, use of K-map to simplify Boolean function, Boolean function representation in the form of sum of product (SOP) and product of sums (POS), and application of universal gates (NAND and OR).

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  • Ata Elahi
    • 1
  1. 1.Southern Connecticut State UniversityNew HavenUSA

Personalised recommendations