Chapter 11 - Digital Logic
Chapter 11 - Digital Logic
Is a convenient tool:
Analysis
It is an economical way of describing the function of digital
circuitry
Design
Given a desired function, Boolean algebra can be applied to
develop a simplified implementation of that function
+ Boolean Algebra
Investigated Set:
B = { False, True } = { F, T} = {0,1}
Basic Operator: AND (.), OR (+), NOT
Other operators: NAND (Not And), NOR
(Not Or), XOR ( Exclusive OR)
Representation:
+
Boolean Variables and Operations
Makes use of variables and operations
Are logical
A variable may take on the value 1 (TRUE) or 0 (FALSE)
Basic logical operations are AND, OR, and NOT
AND
Yields true (binary value 1) if and only if both of its operands are true
In the absence of parentheses the AND operation takes precedence
over the OR operation
When no ambiguity will occur the AND operation is represented by
simple concatenation instead of the dot operator
OR
Yields true if either or both of its operands are true
NOT
Inverts the value of its operand
Table 11.1- Boolean Operators
Table 11.2: Basic Identities of
Boolean Algebra
+
11.2- Basic
Logic Gates
Uses of
NOR Gates
11.3- Combinational
An interconnected set of
gates whose output at any
time is a function only of the
Circuit input at that time
Karnaugh Map
Quine-McCluskey Method
Algebraic Simplification
+
Karnaugh Map
Karnaugh
Maps
+
good Overlapping
No good
Groups
+
+ Table 11.4- Truth Table for the One-Digit
Packed Decimal Incrementer
Figure
11.10
+
Table 11.5: First Stage of
Quine-McCluskey Method
0001
0101
0110
1100
0111
1011
1101
1111
Boolean Algebra
Gates
Combinational Circuit
Algebraic Simplification
Karnaugh Map
Quine-McCluskey Method