1 / 18

22C:19 Discrete Math Boolean Algebra & Digital Logic

22C:19 Discrete Math Boolean Algebra & Digital Logic. Fall 2010 Sukumar Ghosh. Boolean Algebra. In 1938, Shannon showed how the basic rules of logic first given by George Boole in his 1854 publication The Laws of Thought , can be used to design circuits

kristy
Télécharger la présentation

22C:19 Discrete Math Boolean Algebra & Digital Logic

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 22C:19 Discrete MathBoolean Algebra & Digital Logic Fall 2010 Sukumar Ghosh

  2. Boolean Algebra In 1938, Shannon showed how the basic rules of logic first given by George Boole in his 1854 publication The Laws of Thought, can be used to design circuits that enables computer hardware to perform various arithmetic and logical operation. These rules form the basis of Boolean Algebra. These rules involve two Symbols 1 and 0 (synonymous with true and false) and the operators AND, OR, NOT.

  3. Boolean Algebra

  4. Basic Logic Gates

  5. Circuits to Equations

  6. Circuits to Equations

  7. Equations to Circuits

  8. Implementing XOR

  9. Boolean function An n-variable Boolean function f : {0.1}n⟶ {0,1} It can be expressed as a truth table.

  10. Boolean Algebra

  11. Sum-of-product form minterm

  12. Examples of simplification A . B’ + A . B = A. (B’ + B) = A.1 = A (A + B).(A + B’) = (A + B.B’) = A + 0 = A In the reverse way, you can expand a expression, Like X.Y = X.Y.1 = X.Y (Z + Z’) = X.Y.Z + X.Y.Z’

  13. NAND and NOR gates Alternative notations: A | B = A NAND B A ↓ B = A NOR B

  14. Binary addition

  15. Half-adder

  16. Is half-adder enough? Can we add two binary numbers using half adders only? There is a problem here

  17. Is half-adder enough?

More Related