Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
COMBINATIONAL LOGIC
Dynamic Systems
Dynamic behavior
UNIT 3:
COMBINATIONAL LOGIC
BOOLEAN ALGEBRA
George Boole English mathematician (1815-1864)
BOOLEAN ALGEBRA
Algebra dealing with variables that may assume two
(and only two) values.
Typical symbol pairs to represent Boolean values:
0/1
TRUE/FALSE
ON/OFF
OPEN/CLOSE
HI/LO
BOOLEAN ALGEBRA
Expression of numerical values using a base-2 system
(0/1) is called a binary representation.
5
101
BOOLEAN ALGEBRA
NOT ( or
or / )
Truth Table:
0
Map:
BOOLEAN ALGEBRA
AND ( )
Truth Table:
Map:
AND
0
BOOLEAN ALGEBRA
OR ( + )
+
Truth Table:
Map:
OR
0
10
BOOLEAN ALGEBRA
XOR ( ) "Exclusive OR"
Truth Table:
Map:
XOR
0
11
BOOLEAN ALGEBRA
Equations:
Write equations in the normal way
Hierarchy and parentheses usage borrowed from
ordinary algebra
Unlike ordinary algebra, the AND and OR operators are
dual operators if one substitutes 0 for 1, and also
substitutes AND for OR, the result is unchanged
12
BOOLEAN ALGEBRA
Axioms:
Commutativity:
Associativity:
Distributivity:
Existence of 0 and 1:
0
1
Existence of complements:
Jeff Shelton 24 January 2014
0
1
13
BOOLEAN ALGEBRA
Theorems
Can be proven either through algebraic manipulation (as in
ordinary algebra) or by exhaustive substitution.
Useful Theorems:
Idempotent Operators:
Absorption:
Simplification:
DeMorgans Law:
14
COMBINATIONAL LOGIC
DESIGN
Use Boolean algebra to go from design specification to
implementable logic function
Boolean algebra can be used to design systems that
have:
Binary inputs
Binary outputs
No history dependence or memory
15
COMBINATIONAL LOGIC
DESIGN
Example: Electronic Door Lock
The lock has a set of buttons. To enter (open the lock), one must
press down the correct combination of buttons.
Inputs: buttons B1 and B2, Button-IN = 1, Button-OUT = 0
Output: Lock actuator (L), 0 = Lock, 1 = Unlock
Truth Table: (two button lock)
0
0
1
0
16
SUM OF PRODUCTS
Generate an algebraic expression for desired
function from a truth table by creating a
sum-of-products expression:
0
0
1
0
where each
term expresses one of n possible combinations
of the input variables, or their complements, as Boolean
products. Treat ones in the truth table as uncomplimented
variables, and zeros as complimented variables.
Drop terms corresponding to an output of zero in the truth
table.
17
SUM OF PRODUCTS
0
0
1
0
1 2
1 2
1 2
1 2
1 2
1 2
1 2
1 2
18
SUM OF PRODUCTS
0
0
1
0
19
PRODUCT OF SUMS
0
0
1
0
Complementary to Sum-of-Products
All rules are dual
Example: Two button door lock
Form product of sums function:
1
20
GRAPHICAL
MINIMIZATION
Based on the repeated application of
21
GRAPHICAL
MINIMIZATION
Example: A new two button door lock
A two button door lock with two possible combinations:
0
1
0
1
0
1
1 2
1 2
2
22
GRAPHICAL
MINIMIZATION
Non-Reducible Maps
Door Lock example (alternate combination)
1 2
0
1
1 2
1
0
23
GRAY CODE
A counting sequence for which successive values change
by only one bit at a time
Multi-bit changes causes problem if data is accessed while
the changes are in-progress:
Straight binary counting two transitions involve changing
of both bits: 00 01 10 11
!"# $ "%
&#' ()
% *+,"' )!+%,-
or
01 11 10
24
25
01
Reflect
Prefix
00 01 11 10
Concatenate
10
11 10
26
10 11 01 00
110 111 101 100
27
28
ASYNCHRONOUS INPUTS
If non-Gray-code coding scheme is used, asynchronous
input requires a synchronizer (clock) or handshake
must be used
Clocked I/O All registers and memories are updated at
either the rising edge or the falling edge of the clock
signal and are ready to be read at the next transition of
the clock signal
Handshake Devices that are outputting values will
broadcast when the data is ready to be read
29
ASYNCHRONOUS INPUTS
If Gray code is used, input signal can be used with no
synchronizer
Input must go through all intermediate values to get
from one value to another
Reading at any time will give valid result
In value is changing, result will be either the old or the
new value; never a spurious value
30
PSEUDO CIRCUITS
First step in circuit design
Convert Boolean equations into logic block diagrams
Very close to actual circuit elements
Standard symbols:
AND
NAND
NOT
OR
NOR
NAND and NOR are the most common gates which stems from the
transistor structure of the semiconductor gates
./.0
.23
31
DEMORGANS LAW
Converting AND/OR form logic circuits (equations) to
NAND/NOR form logic circuits (equations).
The equivalents for OR and AND are:
32
Image: https://upload.wikimedia.org/wikipedia/commons/2/26/7400.jpg
Jeff Shelton 24 January 2014
33
34
PSEUDO CIRCUIT
Door lock example:
Boolean Equation:
1 2
Pseudo Circuit:
35
CIRCUIT DIAGRAM
36