Boolean Logic & Combinational Circuits
Uploaded by
Alexander TaylorBoolean Logic & Combinational Circuits
Uploaded by
Alexander TaylorLecture 2
Boolean Logic & Combinational Circuits
2.1
Two to Rule Them All
We can represent information using just these two values: {0,1}. Later on, well see how integers and real number plus and alphanumerical data (text) are encoded in binary. Right now, well look into the algebra that is used to manipulate binary information and how it applies to the analysis and design of digital circuits.
2.2
Boolean Algebra
George Boole (1854): basic principles. Variables: TRUE or FALSE, conveniently mapped onto 0 or 1. Operations: A B A B A B A+ B
With these three building blocks, you can define any function.
2.3
Postulates
Relationship
AB = BA
Dual
A+ B = B + A
Property Commutative Distributive Identity Complement
A( B + C ) = AB + AC A + BC = ( A + B )( A + C )
1A = A
AA = 0
0+ A= A
A+ A =1
2.4
Theorems
Zero and one: 0 A = 0 Idempotence: AA = A Associative: Involution:
A( BC ) = ( AB)C
A= A A+ B = A B
1+ A = 1 A+ A = A
A + ( B + C ) = ( A + B) + C
DeMorgans: AB = A + B
What are these two functions called?
2.5
More Logic Functions
A B A B A B
A+ B
A B
Important notes: (1) You can build any logic function from (2) You can build any logic function from (these gates are called universal)
. .
2.6
Transistor Logic
What happens after you present inputs to a circuit?
2.7
Power and Speed
Similarly to a switch, a transistor takes time to change its state from off to on.
potential
+ 5V
V1
V0
In general, the more power you use, the faster the transistor switches. The problem is, the transistor runs hotter and burns more energy.
2.8
time
onoff
off on
switching times
Logic Gates
This is your new graphical alphabet to describe logic functions.
2.9
Synthesizing a Logic Function
1. Understand the function description. (3-bit majority). 2. Construct its truth table.
A 0 0 0 0 1 1 1 1 B 0 0 1 1 0 0 1 1 C 0 1 0 1 0 1 0 1 M 0 0 0 1 0 1 1 1
3. Look at the entries that produce a 1 on the output and construct minterms. Ex. When (A=0, B=1, C=1), we produce a 1 result with: ABC 4. Add up the minterms with an OR: M = ABC + A BC + ABC + ABC
This gives 1 if any of the input combos that produce 1 is presented. This is called Sum of Products (SOP) form, or sum of minterms.
2.10
10
Working with Duality
If none of the input combos that produce a 0 is true, then we have a 1 output.
A 0 0 0 0 1 1 1 1 B 0 0 1 1 0 0 1 1 C 0 1 0 1 0 1 0 1 M 0 0 0 1 0 1 1 1
Option 1. Look at the entries that produce a 0 on the output, construct maxterms then AND them all together. Ex. When (A=0, B=0, C=1), the maxterm is: A+ B+C Option 2. Create the SOP for M. Complement and apply DeMorgans.
M = ( A B C ) + ( A BC ) + ( AB C ) + ( A B C ) M = ( A + B + C )( A + B + C )( A + B + C )( A + B + C )
This is called Product of Sums (POS) form, or product of maxterms.
2.11
11
Canonical Forms
Both SOP and POS forms are called canonical. They both yield two-level circuits. Sometimes it may be easier to compute a function (simpler Boolean equation) using one form rather than the other. Always try both to minimize the gate count. Drawback: This mechanical synthesis procedure doesnt always yield the minimal circuit. We need a procedure for reduction
2.12
12
Reduction of Digital Logic
Methods: Algebraic Reduction (apply properties one at a time) Example: F = ABC + A BC + ABC + ABC F = ABC + ABC + AB(C + C ) F = ABC + ABC + AB(1) F = ABC + A BC + AB Karnaugh Maps (K-Map) Quine-McCluskey (Tabular Method)
2.13
13
