Lect 5

Date: 8th August

Topics:
Basic Logic Operations
Boolean Expressions
Boolean Algebra
Properties of Boolean algebra

14 August 2012
Basic Logic Operations

EEE/CS/ECE F215
2
Basic Logic Operations

EEE/CS/ECE F215
Basic Logic Operations
Timing diagram:

EEE/CS/ECE F215
Boolean Expressions
 Boolean Expressions

Boolean expressions are composed of

Literals / variables and their complements

Logical operations

Examples

F = A.B'.C + A'.B.C' + A.B.C + A'.B'.C'
literals logic operations

F = (A+B+C').(A'+B'+C).(A+B+C)

F = A.B'.C' + A.(B.C' + B'.C)
EEE/CS/ECE F215
6
Boolean Expressions

F = A.B'.C' + A.(B.C' + B'.C)

Can you evaluate the function for A = 0, B= 1 and
C=1?
Order of Precedence

1. Parentheses
2. NOT
3. AND
4. OR

Can you make a truth table for the following

function?

F = A.B'.C' + A.C
EEE/CS/ECE F215
Truth Table

1. TT describe the functional behavior of a

Boolean expression and/or Logic circuit.

2. For n input variables, there are 2^n rows.

3. Output of the logic function is defined for

each row.

F = A.B'.C' + A.C

TT?

EEE/CS/ECE F215
Boolean Algebra
 Boolean Algebra

George Boole developed an algebraic description for
processes involving logical thought and reasoning.
− Became known as Boolean Algebra

Claude Shannon later demonstrated that Boolean
Algebra could be used to describe switching circuits.
− Switching circuits are circuits built from devices that
switch between two states (e.g. 0 and 1).
− Switching Algebra is a special case of Boolean
Algebra in which all variables take on just two
distinct values

Boolean Algebra is a powerful tool for analyzing and
designing logic circuits.EEE/CS/ECE F215
10
 Properties of Boolean Algebra
A+A=A

A.A=A

A + A' = 1
Can you simplify following to three variable function?
F = ABC'D + ABCD
F = ABD.(C' + C)
F = ABD

A . A' = 0
Can you prove this using TT?
11

EEE/CS/ECE F215
Properties of Boolean Algebra

A.(B + C) = AB + AC

A + (B.C) = (A + B).(A + C)

A + AB = A

A.(A + B) = A

A + A'B = A + B

A.(A' + B) = A . B

EEE/CS/ECE F215
Properties of Boolean Algebra

A.B + A.B' = A

(A + B).(A + B') = A

EX:
Using Boolean Algebra, simplify the following
Boolean expression.

F(A,B,C) = A'.B.C + A.B'.C + A.B.C

EEE/CS/ECE F215
 Postulates and theorems of Boolean Algebra

Duality property: Every algebraic expression deducible from the

postulates of Boolean algebra remains valid if the operator and
the identity elements are interchanged.

14 August 2012 EEE/CS/ECE F215 14

 Standard Forms for
Boolean Expressions

14 August 2012 EEE/CS/ECE F215 15

Standard Forms for Boolean Expressions
Minterm is a product of literals, in which each input variable appears once. A
minterm is true for exactly one combination of inputs.

Maxterm is a sum of literals, in which each input variable appears once. A

maxterm is false for exactly one combination of inputs.

14 August 2012 EEE/CS/ECE F215 16

Standard Forms for Boolean Expressions

Sum-of-Products (SOP)
− Derived from the Truth table for a function by
considering those rows for which F = 1.
− The logical sum (OR) of product (AND) terms or
minterms.
− Realized using an AND-OR circuit.
Can you write f in terms of minterms?

This is SOP form.

Can you write f’ in terms of minterms?

F’ contains all minterms not in f.

14 August 2012 EEE/CS/ECE F215 17

Standard Forms for Boolean Expressions

Product-of-Sums (POS)
− Derived from the Truth table for a function by
considering those rows for which F = 0.
− The logical product (AND) of sum (OR) terms.
− Realized using an OR-AND circuit.

Can you write f in terms

of maxterms?

Can you write f’ in terms of maxterms?

14 August 2012 EEE/CS/ECE F215 18

14 August 2012 EEE/CS/ECE F215 19
EX:
Using Boolean Algebra, simplify the following
Boolean expression.

F(A,B,C) = A'.B.C + A.B'.C + A.B.C

=A'.B.C + A.B.C + A.B'.C + A.B.C
=B.C(A’+A)+A.C(B’+B)
=B.C+A.C
Can you implement this using only NAND gates?
F = ((B.C+A.C)’)’ = ((B.C)’ . (A.C)’)’

14 August 2012 EEE/CS/ECE F215 20