Professional Documents
Culture Documents
Circuitos combinacionales
Adaptado de:
Digital Design and Computer Architecture, 2nd Edition
David Money Harris and Sarah L. Harris
Chapter 2 <1>
Chapter 2 :: Topics
Introduction
Boolean Equations
Boolean Algebra
From Logic to Gates
Multilevel Combinational Logic
Xs and Zs, Oh My
Karnaugh Maps
Combinational Building Blocks
Timing
Chapter 2 <2>
Introduction
A logic circuit is composed of:
Inputs
Outputs
Functional specification
Timing specification
inputs
functional spec
timing spec
outputs
Chapter 2 <3>
Circuits
Nodes
Inputs: A, B, C
Outputs: Y, Z
Internal: n1
Circuit elements
E1
n1
E3
B
E2
E1, E2, E3
Each a circuit
Chapter 2 <4>
Y
Z
Sequential Logic
Has memory
Outputs determined by previous and current values
of inputs
inputs
functional spec
timing spec
outputs
Chapter 2 <5>
Chapter 2 <6>
Boolean Equations
Functional specification of outputs in terms
of inputs
Example: S = F(A, B, Cin)
Cout = F(A, B, Cin)
A
B
Cin
C
CLL
S
Cout
S
= A B Cin
Cout = AB + ACin + BCin
Chapter 2 <7>
Some Definitions
Complement: variable with a bar over it
A, B, C
Literal: variable or its complement
A, A, B, B, C, C
Implicant: product of literals
ABC, AC, BC
Minterm: product that includes all input
variables
ABC, ABC, ABC
Maxterm: sum that includes all input variables
(A+B+C), (A+B+C), (A+B+C)
Chapter 2 <8>
B
0
1
0
1
Y
0
1
0
1
minterm
minterm name
A B
m0
m1
A B
m2
A B
m3
A B
Y = F(A, B) =
Chapter 2 <9>
B
0
1
0
1
Y
0
1
0
1
minterm
minterm name
A B
m0
m1
A B
m2
A B
m3
A B
Y = F(A, B) =
Chapter 2 <10>
B
0
1
0
1
Y
0
1
0
1
minterm
minterm name
A B
m0
m1
A B
m2
A B
m3
A B
Y = F(A, B) = AB + AB = (1, 3)
Chapter 2 <11>
B
0
1
0
1
Y
0
1
0
1
maxterm
maxterm name
A
A
A
A
+
+
+
+
B
B
B
B
M0
M1
M2
M3
C
0
1
0
1
Chapter 2 <13>
C
0
1
0
1
E
0
0
1
0
Chapter 2 <14>
C
0
1
0
1
minterm
O C
O C
O C
O C
POS product-of-sums
O
0
0
1
1
C
0
1
0
1
maxterm
O
O
O
O
+
+
+
+
C
C
C
C
Chapter 2 <15>
C
0
1
0
1
E
0
0
1
0
minterm
O C
O C
O C
O C
Y = OC
= (2)
POS product-of-sums
O
0
0
1
1
C
0
1
0
1
E
0
0
1
0
maxterm
O
O
O
O
+
+
+
+
C
C
C
C
Y = (O + C)(O + C)(O + C)
= (0, 1, 3)
Chapter 2 <16>
Boolean Algebra
Axioms and theorems to simplify Boolean
equations
Like regular algebra, but simpler: variables
have only two values (1 or 0)
Duality in axioms and theorems:
ANDs and ORs, 0s and 1s interchanged
Chapter 2 <17>
Boolean Axioms
Chapter 2 <18>
Chapter 2 <19>
B
0
Chapter 2 <20>
Chapter 2 <21>
B
1
Chapter 2 <22>
Chapter 2 <23>
B
B
Chapter 2 <24>
Chapter 2 <25>
Chapter 2 <26>
Chapter 2 <27>
B
B
Chapter 2 <28>
Chapter 2 <29>
Chapter 2 <30>
Chapter 2 <31>
T8
T5
T1
Chapter 2 <32>
Chapter 2 <33>
T8
T2
T1
T7
T3
Chapter 2 <34>
DeMorgans Theorem
Y = AB = A + B
Y=A+B=A B
A
B
A
B
A
B
A
B
Chapter 2 <35>
Bubble Pushing
Backward:
Body changes
Adds bubbles to inputs
A
B
A
B
A
B
Forward:
Body changes
Adds bubble to output
A
B
Chapter 2 <36>
Bubble Pushing
What is the Boolean expression for this
circuit?
A
B
Y
C
D
Chapter 2 <37>
Bubble Pushing
What is the Boolean expression for this
circuit?
A
B
Y
C
D
Y = AB + CD
Chapter 2 <38>
Chapter 2 <39>
Chapter 2 <40>
no output
bubble
Y
Chapter 2 <41>
no output
bubble
A
B
C
bubble on
input and output
Y
Chapter 2 <42>
A
B
C
A
B
bubble on
input and output
A
B
no bubble on
input and output
D
Y = ABC + D
Chapter 2 <43>
C
minterm: ABC
minterm: ABC
minterm: ABC
Chapter 2 <44>