Scribd
Upload
7 views

ECE352_BooleanAlgebra

The document covers the fundamentals of Boolean Algebra, including Boolean functions, functional waveforms, and basic identities. It explains how Boolean functions can be represented by truth tables and implemented using logic gates, emphasizing the importance of logic minimization. Additionally, it discusses algebraic manipulations, the duality principle, and the significance of simplifying Boolean expressions for efficient circuit design.

Uploaded by

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

ECE352_BooleanAlgebra

The document covers the fundamentals of Boolean Algebra, including Boolean functions, functional waveforms, and basic identities. It explains how Boolean functions can be represented by truth tables and implemented using logic gates, emphasizing the importance of logic minimization. Additionally, it discusses algebraic manipulations, the duality principle, and the significance of simplifying Boolean expressions for efficient circuit design.

Uploaded by

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

ECE 352

Digital System
Fundamentals
Boolean Algebra

Boolean Algebra

1
Topics
• Boolean Algebra
– Boolean Functions
– Functional Waveforms
– Boolean Identities and Manipulations
Boolean Algebra

2
Boolean Function
• Defined by a truth table, which is a
complete representation of a Boolean
function
• Same truth table can be implemented using
Boolean Algebra

different Boolean functions!


– If functions have identical truth tables, they are
by definition functionally equivalent
– Different functions with the same truth table may
differ in complexity – this is why we use “logic
minimization”

• Can also express the behavior of a Boolean


function (or logic circuit) in response to
different input values using a waveform…
3
Functional Waveforms
• Express signal/circuit behavior over time
– 1 is “high” and 0 is “low”
• Given a set of input signals and their values
over time, determine resulting output
Boolean Algebra

behavior
– Inputs may not occur in all possible combinations
– Input combinations may repeat
– Not definitive like a truth table!
F = AB + C
A
• Can complete from B
left to right, but don’t C
have to if the function
is combinational
F
4
Circuits From Boolean
Functions
•Functions are implemented using logic gates
– The circuit inputs are the function variables
– A literal is a single variable within a term (that
may or may not be complemented)
Boolean Algebra

– The circuit output is the “result”


• Each Boolean function can be directly
translated to a gate diagram that produces
an output
– Think how you would read the function out loud...
– You would use the names of logic functions that
each correspond to a gate!
• If we need more than one output, can create
separate functions, separate circuits
5
– May be able to share a subset of circuitry…
Boolean Algebra
• An algebra to work with Boolean values
– Similar to “regular” algebra except Boolean
variables can only be 0 or 1; constants are only 0
or 1…
Boolean Algebra

– Has operators, parentheses for precedence, etc.


• This allows us to manipulate Boolean
functions
– Circuit/logic minimization
– Identify shared sub-functions (shared circuitry)
– Verify functionality
– Transform to use other types of gates or
structures
– …etc…
6
Basic Boolean Identities
X+1=1 X+0=X X·1 = X X·0 = 0
X+X=X X+ =1 X·X = X X· = 0
=X
Boolean Algebra

Commutative:
X+Y=Y+X X·Y = Y·X
Associative:
X+(Y+Z) = (X+Y)+Z X·(Y·Z) = (X·Y)·Z
Distributive:
X·(Y+Z) = X·Y + X·Z X + Y·Z = (X+Y)(X+Z)
De Morgan’s:

7
More Algebraic Manipulation
• Duality Principle:
– Dual of a circuit/equation: change ANDs to
ORs, and change ORs to ANDs
Boolean Algebra

– Taking the dual of both sides of a Boolean


equation results in a valid equation

• Consensus Theorem:
– Provides a way to identify and remove a
redundant term algebraically

8
Consensus Theorem
Boolean Algebra

9
Why Simplify?
• More complex
equation describes
more complex
B circuit
Boolean Algebra

– More area
A – More delay
C – More power and heat
– More work to create

A
10
C
Complement of a Function
• The complement of a function is one that
has the “opposite” truth table
– In the output column, change 0s to 1s and 1s to
0s
Boolean Algebra

• Use De Morgan’s Law


– BEWARE operator precedence and grouping
– Add parentheses if necessary!
– Can test if correct by comparing truth tables

11
Complement of a Function
Boolean Algebra

=
12
ECE 352
Digital System
Fundamentals
Boolean Algebra

Boolean Algebra

13

You might also like