Skip to content
exploreroots
  • C language
  • Analog Electronics
  • Digital Electronics
    • Number System
    • Binary Code
    • Boolean Algebra
    • K Maps
    • Combination Circuits
    • Sequential Circuits
    • Timing Circuits
  • Processors
  • Project Basics
  • CONTACT US

Tag: canonical

Boolean Algebra

Canonical Form: Relation between min and max terms

The compliment of the function expressed in terms of sum of min terms can be obtained by taking sum of missing min terms in the original functions e.g.  f= ∑(4, 5, 7) = m7 + m5 + m4   Its compliment is              f’ = ∑(0, 1, 2, 3, 6) = m0 + m1 + m2 + m3 + m6 The compliment […]

Posted on June 2, 2022June 2, 2022 Author admin Comments(52)
Boolean Algebra

Boolean Equations: Different forms

Standard form: In a standard form we don’t have to compulsorily write all the literals in all the terms of an expression. e.g. f = xyz + y + x  f = x’y’z’ + x’yz f= xy + x’y’ Canonical form: In a canonical form we have to compulsorily write all the literals in all the terms […]

Posted on June 2, 2022June 2, 2022 Author admin Comments(1,458)







    Copyright © 2009 exploreroots- All Rights Reserved | Newspaper Lite by themecentury.