Scribd
Upload
17 views21 pages

4.2logic Gates Boolean Algebra and Truth Table Notes

Uploaded by

gesterros
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views21 pages

4.2logic Gates Boolean Algebra and Truth Table Notes

Uploaded by

gesterros
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 21

Digital Logic, Boolean

Algebra, Truth Table


Joseph F. Morco
https://www.electronics-tutorials.ws/boolean/bool_1.html
Laws of Boolean Algebra

A set of rules or Laws of Boolean Algebra


expressions
 Invented to help reduce the number of
logic gates needed to perform a particular
logic operation.
George Boole

 In 1854, George Boole performed an


investigation into the “laws of thought”
which were based around a simplified
version of the “group” or “set” theory, adn
from this Boolean Algebra was developed.
Boolean Algebra

 Isthe mathematics we use to analyse


digital gates and circuits.
A system of mathematics based on logic
that has its own set of rules or laws which
are used to define and reduce Boolean
expressions.
Variables

 Variablesused in Boolean Algebra only have


one of two possible values, a logic “0” and
a logic “1”
Expression

 Anexpression can have an infinite number


of variables all labelled individually to
represent inputs to the expression.
Boolean Algebra Truth Tables
2-input AND Gate

Symbol Truth Table

A B Q

0 0 0

0 1 0

1 0 0

1 1 1

Boolean Expression Q = A.B Read as A AND B gives Q


2-input AND Gate

 The output Q is true if BOTH input A “AND”


input B are both true.
 Boolean expression of: (Q = A.B) or (Q = AB)
2-input OR (Inclusive OR) Gate

Symbol Truth Table

A B Q

0 0 0

0 1 1

1 0 1

1 1 1

Boolean Expression Q = A+B Read as A OR B gives Q


2-input OR (Inclusive OR) Gate

 The output Q is true if EITHER input A “OR”


input B is true.
 Boolean expression of: (Q = A+B)
NOT Gate(Inverter)

Symbol Truth Table

A Q

0 1

1 0

Boolean Expression Q = NOT A or A Read as inversion of A gives Q


NOT Gate(Inverter)

 Theoutput Q is ONLY true when the input is


“NOT” true, the output is the inverse
complement of the input.
 Boolean expression of: (Q = NOT A)
2-input NAND (Not AND) Gate

Symbol Truth Table

A B Q

0 0 1

0 1 1

1 0 1

1 1 0

Boolean Expression Q = A .B Read as A AND B gives NOT-Q


2-input NAND (Not AND) Gate

 The output Q is true if BOTH input A and B


are NOT true.
 Boolean expression of: (Q = not(A AND B)
2-input NOR (Not OR) Gate

Symbol Truth Table

A B Q

0 0 1

0 1 0

1 0 0

1 1 0

Boolean Expression Q = A+B Read as A OR B gives NOT-Q


2-input NOR (Not OR) Gate

 The output Q is true if EITHER input A and B


are NOT true.
 Boolean expression of: (Q = not(A OR B)
Two Special Types of Logic Gates
(Universal Gates)

 Exclusive-OR Gate
 Exclusive-NOR Gate
 The
boolean expression to indicate is the
symbol with a plus sigh inside a circle ( ⊕ )
2-input EX-OR (Exclusive OR) Gate

Symbol Truth Table

A B Q

0 0 0

0 1 1

1 0 1

1 1 0

Boolean Expression Q = A ⊕ B
2-input EX-NOR (Exclusive NOR) Gate

Symbol Truth Table

A B Q

0 0 1

0 1 0

1 0 0

1 1 1

Boolean Expression Q = A ⊕ B
Summary of 2-input Logic Gates

Inputs Truth Table Outputs For Each Gate

A B AND NAND OR NOR EX-OR EX-NOR

0 0 0 1 0 1 0 1

0 1 0 1 1 0 1 0

1 0 0 1 1 0 1 0

1 1 1 0 1 0 0 1

You might also like