BOOLEAN ALGEBRA

DISCRETE MATHEMATHICS
DEFINITION
 Boolean Algebra is the mathematics we use to analyze digital gates and
circuits. We can use these “Laws of Boolean” to both reduce and simplify a
complex Boolean expression in an attempt to reduce the number of logic
gates required. Boolean Algebra is therefore 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.
 Boolean Algebra uses a set of Laws and Rules to define the operation of a
digital logic circuit.
 As well as the logic symbols “0” and “1” being used to represent a digital
input or output, we can also use them as constants for a permanently
“Open” or “Closed” circuit or contact respectively.
 A set of rules or Laws of Boolean Algebra expressions have been invented
to help reduce the number of logic gates needed to perform a particular
logic operation resulting in a list of functions or theorems known
commonly as the Laws of Boolean Algebra.
LOGIC GATES
 A logic gate is an elementary building block of a digital circuit. Most logic
gates have two inputs and one output. At any given moment, every
terminal is in one of the two binary conditions low (0) or high (1),
represented by different voltage levels. The logic state of a terminal can,
and generally does, change often, as the circuit processes data. In most
logic gates, the low state is approximately zero volts (0 V), while the high
state is approximately five volts positive (+5 V).
The AND gate
 is so named because, if 0 is called "false" and 1 is called "true," the gate
acts in the same way as the logical "and" operator. The following
illustration and table show the circuit symbol and logic combinations for
an AND gate. (In the symbol, the input terminals are at left and the output
terminal is at right.) The output is "true" when both inputs are "truZe."
Otherwise, the output is "false."

Input 1 Input 2 Output

0   0 0 
0 1  0
1  0  0
1 1 1
The OR gate
 The OR gate gets its name from the fact that it behaves after the fashion
of the logical inclusive "or." The output is "true" if either or both of the
inputs are "true." If both inputs are "false," then the output is "false."The
OR gate gets its name from the fact that it behaves after the fashion of
the logical inclusive "or." The output is "true" if either or both of the inputs
are "true." If both inputs are "false," then the output is "false."

Input 1 Input 2 Output

0   0 0 
0 1  1
1  0  1
1 1 1
The XOR ( exclusive-OR ) gate
 The XOR ( exclusive-OR ) gate acts in the same way as the logical
"either/or." The output is "true" if either, but not both, of the inputs are
"true." The output is "false" if both inputs are "false" or if both inputs are
"true." Another way of looking at this circuit is to observe that the output
is 1 if the inputs are different, but 0 if the inputs are the same. The XOR
( exclusive-OR ) gate acts in the same way as the logical "either/or." The
output is "true" if either, but not both, of the inputs are "true." The output
is "false" if both inputs are "false" or if both inputs are "true." Another way
of looking at this circuit is to observe that the output is 1 if the inputs are
different, but 0 if the inputs are the same.
Input 1 Input 2 Output
0   0 0 
0 1  1
1  0  1
1 1 0
The NOT gate
 A logical inverter , sometimes called a NOT gate to differentiate it from
other types of electronic inverter devices, has only one input. It reverses
the logic state.

Input 1 Input 2
1 0
0 1
The NAND gate
 The NAND gate operates as an AND gate followed by a NOT gate. It acts in
the manner of the logical operation "and" followed by negation. The
output is "false" if both inputs are "true." Otherwise, the output is "true."

Input 1 Input 2 Output

0  0 1 
0 1  1
1 0  1
1 1 0
The NOR gate
 The NOR gate is a combination OR gate followed by an inverter. Its output
is "true" if both inputs are "false." Otherwise, the output is "false."

Input 1 Input 2 Output

0  0 1 
0 1  0
1 0  0
1 1 0
The XNOR (exclusive-NOR) gate
 The XNOR (exclusive-NOR) gate is a combination XOR gate followed by an
inverter. Its output is "true" if the inputs are the same, and"false" if the
inputs are different.

Input 1 Input 2 Output

0  0 1 
0 1  0
1 0  0
1 1 1
The following table gives a list of the common logic functions and their equivalent
Boolean notation.
EXAMPLE #1
EXAMPLE #1
First observations tell us that the circuit consists of a 2-input NAND gate, a 2-input EX-
OR gate and finally a 2-input EX-NOR gate at the output. As there are only 2 inputs to
the circuit labelled A and B, there can only be 4 possible combinations of the input
( 22 ) and these are: 0-0, 0-1, 1-0 and finally 1-1. Plotting the logical functions from
each gate in tabular form will give us the following truth table for the whole of the
logic circuit below.
 SAMPLE
 WHERE:
 A=1
 B=0
FIND: 1 or 0
D=1
E=0
F=1
FIND: Boolean Notation
D=A+B
E=A.B
F = (A + B) . (A . B)
 SAMPLE
 WHERE:
 A=1
 B=0
FIND: 1 or 0
D=1
E=0
F=1
FIND: Boolean Notation
D=A+B
E=A.B
F=A+B+A.B
SAMPLE PROBLEM
 WHERE:
 A=1
 B=0

FIND: 1 or 0
C=0

Boolean Notation:
C=A+B
  WHERE:
 A=1
 B=0

Identify what FIND: 7- 11 (Boolean Notation) 12- 20

are the 6 logic
 C=?  C=?
gates on the
given  D=?  D=?
problems? 1-6  E=?
 E=?
OR, NOT, XOR,  F = ? 3 pts
 F=?
AND, NAND,
XNOR  G=?  G = ? 3 pts