Scribd
Upload
19 views24 pages

BooleanAlgebra 01

Boolean algebra is a mathematical system used to represent binary variables and logical operations on those variables. It defines operators like AND, OR, and NOT and their truth tables. Boolean functions take binary inputs and produce binary outputs. Simplifying Boolean functions reduces the complexity of digital circuits. DeMorgan's laws allow transforming functions between AND-OR form and vice versa by inverting variables and swapping operators.

Uploaded by

Ali
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
19 views24 pages

BooleanAlgebra 01

Boolean algebra is a mathematical system used to represent binary variables and logical operations on those variables. It defines operators like AND, OR, and NOT and their truth tables. Boolean functions take binary inputs and produce binary outputs. Simplifying Boolean functions reduces the complexity of digital circuits. DeMorgan's laws allow transforming functions between AND-OR form and vice versa by inverting variables and swapping operators.

Uploaded by

Ali
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/ 24

Boolean Algebra

Dr. Muhammad Hanif


What is an algebra?
Mathematical system consisting of

» Set of elements (example: N= {1,2,3,4,…})


» Set of operators (+, -,×,÷)
» Axioms or postulates (associativity, distributive, closure, identity
elements, etc.)

Why is it important?
Defines rules of “calculations”

Note: operators with two inputs are called Binary


Does not mean they are restricted to binary numbers!
Operator(s) with one input are called Unary
Boolean Algebra
Boolean algebra is a mathematical system for the manipulation of
variables that can have one of two values.
In formal logic, these values are “true” and “false.”
In digital systems, these values are “on” and “off,” 1 and 0, or “high” and “low.”
Boolean expressions are created by performing operations on
Boolean variables.
Common Boolean operators include AND, OR, and NOT.
Boolean Algebra

• A Boolean operator can be completely described


using a truth table.
• The truth table for the Boolean operators AND
and OR are shown at the right.
• The AND operator is also known as a Boolean
product.
• The OR operator is the Boolean sum.
Boolean Algebra

• The truth table for the Boolean NOT


operator is shown at the right.
• The NOT operation is most often
designated by an overbar.
• It is sometimes indicated by a prime mark
( ‘ ) or an “elbow” ().
Boolean Algebra
• A Boolean function has:
• At least one Boolean variable,
• At least one Boolean operator, and
• At least one input from the set {0,1}.
• It produces an output that is also a member of
the set {0,1}.
Boolean Algebra

• Some examples
• F = AB + CD + BD’
• Y = CD + A’B’
• SUM = AB + A Cin + B Cin
• P = A0A1A2A3A4B0B1B2B3B4 + …

• Equations can be very complex


• Usually desire a minimal expression
Boolean Algebra
• For the basic gates/functions
• AND
• Z=AB
• X=CDE 3 input gate
• Y=FGHK 4 input gate
• OR
• Z=A+B
• Y = F + G + H + K 4 input gate
• NOT
• Z=A
Two Level Logic
• Consider the following logic equation
• Z(A,B,C,D) = A B + C D
• The Z(A,B,C,D) means that the output is a function of the
four variables within the ().
• The AB and CD are terms of the expression.
• This form of representing the function is an algebraic
expression.
• For this function to be True, either both A AND B are True
OR both C AND D are True.
Basic Identities of Boolean Algebra
• X·1=X
• X+0=X

•X·0=0
•X+1=1
• X·X=X
• X+X=X
• X + X’ = 1 • X · X’ = 0

• (X’)’ = X
Truth table expression

• Just like we had the truth tables


for the basic functions, we can
also construct truth tables for
any function.
Boolean Algebra

• The truth table for the Boolean function:

is shown at the right.


• To make evaluation of the Boolean function
easier, the truth table contains extra
(shaded) columns to hold evaluations of
subparts of the function.
Boolean Algebra
• As with common arithmetic, Boolean
operations have rules of precedence.
• The NOT operator has highest priority,
followed by AND and then OR.
• This is how we chose the (shaded)
function subparts in our table.
Boolean Algebra: Aim
• Digital computers contain circuits that implement Boolean functions.
• The simpler that we can make a Boolean function, the smaller the
circuit that will result.
• Simpler circuits are cheaper to build, consume less power, and run faster
than complex circuits.
• With this in mind, we always want to reduce our Boolean functions
to their simplest form.
• There are a number of Boolean identities that help us to do this.
Boolean Algebra: Basic Laws
OR form AND form
• Commutative • Commutative
• X+Y=Y+X • X·Y=Y·X
• Associative • Associative
• X+(Y+Z)=(X+Y)+Z • X(YZ) = (XY)Z
• Distributive • Distributive
• X(Y+Z) =XY+XZ • X+YZ=(X+Y)(X+Z)
• AND distributes over OR • OR distributes over AND
Boolean Algebra: Basic Laws
• DeMorgan’s Theorem
• Very important in simplifying equations
• (X + Y)’ = X’ · Y’
• (XY)’ = X’ + Y’
Boolean Algebra: Basic Laws
• Summary:
Boolean Algebra
DeMorgan’s Theorems: Inverting the output of any gate results in the same
function as the opposite type of gate (AND vs. OR) with inverted inputs:
Boolean Algebra
• Sometimes it is more economical to build a circuit using the
complement of a function (and complementing its result) than it
is to implement the function directly.
• DeMorgan’s law provides an easy way of finding the
complement of a Boolean function.
Boolean Algebra
• DeMorgan’s law can be extended to any number of variables.
• Replace each variable by its complement and change all ANDs
to ORs and all ORs to ANDs.
• Example: The complement of:

is
Boolean Algebra
• These properties (Laws and Theorems) can be used to
simplify equations to their simplest form.
• Simplify F = X’YZ + X’YZ’ + XZ

Using X(Y+Z) = XY + XZ

Using X + X’ = 1

Using X · 1 = X
Boolean Algebra
• F = X’YZ + X’YZ’ + XZ

• Reduces to F = X’Y + XZ
Boolean Algebra
• We can use Boolean identities to simplify the function:

as follows:

You might also like