Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
53 views

Lecture 3: Boolean Algebra: Logistics Last Lecture - Numbers

The document summarizes a lecture on Boolean algebra. It introduces Boolean algebra and explains that it covers operations that can be done with 0s and 1s, like computers perform. It discusses axioms, laws, and theorems that define how 0s and 1s can be operated on. Examples are provided of using Boolean algebra to represent logic functions with truth tables and simplify Boolean expressions. Key concepts like duality, De Morgan's theorems, and techniques for proving theorems are also outlined.

Uploaded by

Beverly Paman
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
53 views

Lecture 3: Boolean Algebra: Logistics Last Lecture - Numbers

The document summarizes a lecture on Boolean algebra. It introduces Boolean algebra and explains that it covers operations that can be done with 0s and 1s, like computers perform. It discusses axioms, laws, and theorems that define how 0s and 1s can be operated on. Examples are provided of using Boolean algebra to represent logic functions with truth tables and simplify Boolean expressions. Key concepts like duality, De Morgan's theorems, and techniques for proving theorems are also outlined.

Uploaded by

Beverly Paman
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 15

Lecture 3: Boolean Algebra

Logistics
Last lecture --- Numbers
Binary numbers
Base conversion
Number systems for negative numbers
A/D and D/A conversion
Todays lecture
Boolean algebra
Axioms
Useful laws and theorems
Examples

CSE370, Lecture 3

The WHY slide


Boolean Algebra
When we learned numbers like 1, 2, 3, we also then
learned how to add, multiply, etc. with them. Boolean
Algebra covers operations that we can do with 0s and
1s. Computers do these operations ALL THE TIME
and they are basic building blocks of computation
inside your computer program.
Axioms, laws, theorems
We need to know some rules about how those 0s and
1s can be operated on together. There are similar
axioms to decimal number algebra, and there are
some laws and theorems that are good for you to use
to simplify your operation.
CSE370, Lecture 3

How does Boolean Algebra fit into


the big picture?
It is part of the Combinational Logic topics

(memoryless)

Different from the Sequential logic topics (can store


information)

Learning Axioms and theorems of Boolean

algebra
Allows you to design logic functions
Allows you to know how to combine different logic gates
Allows you to simplify or optimize on the complex
operations
CSE370, Lecture 3

Boolean algebra
A Boolean algebra comprises...
A set of elements B
Binary operators {+ , }
Boolean
_ sum and
_
product
A unary operation { ' } (or { })
example: A or A
and the following axioms

1. The set B contains at least two elements {a b} with a b


2. Closure:
a+b is in B
ab is in B
3. Commutative: a+b = b+a
ab = ba
4. Associative:
a+(b+c) = (a+b)+c a(bc) = (ab)c
5. Identity:
a+0 = a
a1 = a
6. Distributive:
a+(bc)=(a+b)(a+c)
a(b+c)=(ab)+(ac)
7. Complementarity: a+a' = 1
aa' = 0

CSE370, Lecture 3

Digital (binary) logic is a Boolean


algebra
Substitute
{0, 1} for B
AND for
Boolean Product.
OR for +
Boolean Sum.
NOT for
Complement.

In CSE 321 this was


In CSE 321 this was
In CSE 321 this was

All the axioms hold for binary logic


Definitions
Boolean function
Maps inputs from the set {0,1} to the set {0,1}

Boolean expression
An algebraic statement of Boolean variables and
operators

CSE370, Lecture 3

Logic Gates (AND, OR, Not) & Truth


Table
AND

XY

OR

X+Y

NOT

CSE370, Lecture 3

XY

X
Y

X
Y

X'

X
0
0
1
1

Y
0
1
0
1

Z
0
0
0
1

X
0
0
1
1

Y
0
1
0
1

Z
0
1
1
1

X
0
1

Y
1
0

Logic functions and Boolean algebra


Any logic function that is expressible as a truth table

can be written in Boolean algebra using +, , and '


X
0
0
1
1

Y
0
1
0
1

Z
0
0
0
1

X
0
0
1
1

Y
0
1
0
1

CSE370, Lecture 3

Z=XY

X'
1
1
0
0

Y'
1
0
1
0

X Y X' Y'
0
1
0
0
0
0
1
0

X
0
0
1
1

Z
1
0
0
1

Y
0
1
0
1

X'
1
1
0
0

Z
0
1
0
0

Z=X'Y

Z=(XY)+(X' Y')

Some notation
Priorities: A B + C = ((A) B) + C
Variables and their complements are sometimes

called literals

CSE370, Lecture 3

Two key concepts


Duality (a meta-theorem a theorem about

theorems)

All Boolean expressions have logical duals


Any theorem that can be proved is also proved for its
dual
Replace: with +, + with , 0 with 1, and 1 with 0
Leave the variables unchanged

de Morgans Theorem
Procedure for complementing Boolean functions
Replace: with +, + with , 0 with 1, and 1 with 0
Replace all variables with their complements

CSE370, Lecture 3

Useful laws and theorems


Identity:

X+0=X

Dual: X 1 = X

Null:

X+1=1

Dual: X 0 = 0

Idempotent:

X+X=X

Dual: X X = X

Involution:

(X')' = X

Complementarity: X + X' = 1

Dual: X X' = 0

Commutative:

Dual: X Y = Y X

X+Y=Y+X

Associative:
(X+Y)+Z=X+(Y+Z)
(XY)Z=X(YZ)

Dual:

Distributive:
X(Y+Z)=(XY)+(XZ) Dual: X+
(YZ)=(X+Y)(X+Z)
Uniting:
CSE370, Lecture 3

XY+XY'=X

Dual: (X+Y)(X+Y')=X
10

Useful laws and theorems (cont)


Absorption:

X+XY=X

Absorption (#2):
de Morgan's:
Duality:

(X+Y')Y=XY Dual: (XY')+Y=X+Y

(X+Y+...)'=X'Y'... Dual: (XY...)'=X'+Y'+...


(X+Y+...)D=XY...

Multiplying & factoring:

Consensus:

CSE370, Lecture 3

Dual: X(X+Y)=X

Dual: (XY...)D=X+Y+

(X+Y)(X'+Z)=XZ+X'Y
Dual: XY+X'Z=(X+Z)(X'+Y)

(XY)+(YZ)+(X'Z)= XY+X'Z
Dual: (X+Y)(Y+Z)(X'+Z)=(X+Y)(X'+Z)

11

Proving theorems
Example 1: Prove the uniting theorem--

XY+XY'=X
Distributive
Complementarity
Identity

XY+XY' = X(Y+Y')
= X(1)
=X

Example 2: Prove the absorption theorem--

X+XY=X
Identity
Distributive
Null
Identity
CSE370, Lecture 3

X+XY = (X1)+(XY)
= X(1+Y)
= X(1)
=X
12

Proving theorems
Example 3: Prove the consensus theorem-(XY)+(YZ)+(X'Z)= XY+X'Z

Complementarity
+ X'Z
Distributive

XY+YZ+X'Z = XY+(X+X')YZ
= XYZ+XY+X'YZ+X'Z

Use absorption {AB+A=A} with A=XY and B=Z

= XY+X'YZ+X'Z
Rearrange terms

= XY+X'ZY+X'Z

Use absorption {AB+A=A} with A=X'Z and B=Y

XY+YZ+X'Z = XY+X'Z
CSE370, Lecture 3

13

de Morgans Theorem
Use de Morgans Theorem to find complements
Example: F=(A+B)(A+C), so F=(AB)+(AC)
A
0
0
0
0
1
1
1
1
CSE370, Lecture 3

B
0
0
1
1
0
0
1
1

C
0
1
0
1
0
1
0
1

F
0
0
1
1
0
1
0
1

A
0
0
0
0
1
1
1
1

B
0
0
1
1
0
0
1
1

C
0
1
0
1
0
1
0
1

F
1
1
0
0
1
0
1
0
14

One more example of logic


simplification
Example:
Z

= A'BC + AB'C' + AB'C + ABC' + ABC

= A'BC + AB'(C + C) + AB(C' + C) distributive


= A'BC + AB + AB
complementary
= A'BC + A(B' + B)
distributive
= A'BC + A
complementary
= BC + A

absorption #2 Duality
(X Y')+Y=X+Y with X=BC and

Y=A
CSE370, Lecture 3

15

You might also like