目录
Half Adder – Boolean expression（布尔表达式）
Half Adder – Graphic symbols（图形符号）
Full Adder – Boolean expression
Truth table → K-map → Simplest Boolean expression
minimalist architecture
Inside the processor（处理器内部）
Here there are:
Registers （寄存器）- a store for a single piece of data.
Arithmetic Logic Unit (ALU)（算数逻辑单元） - a very basic calculator (it will also contain registers).
Processor Control Unit (PCU)（处理器控制单元） - to control the processor.
Buses（总线） - to allow data to move from one component to another
Half Adder（半加器）
Binary addition
Consider binary addition (e.g., inside ALU):
0 + 0 = 0
0 + 1 = 1
1 + 0 = 1
1 + 1 = 0 carry 1
Half Adder – Truth Table
| Inputs | Outputs | ||
| A | B | Sum | Carry |
| 0 | 0 | 0 | 0 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 |
Half Adder – Boolean expression（布尔表达式）
The corresponding Boolean expression:
Sum = A XOR B
Carry = AB
Half Adder – Graphic symbols（图形符号）
The corresponding circuit:
Half Subtractors（半减器）
Similar to 1-bit Half Adder for binary additions（二进制加法的1位半加法器）, we have 1-bit Half
Subtractors for binary subtractions too（二进制减法的1位半减法器）. Produce a truth table for a
Half Subtractor based on 1-bit binary subtraction rules（半减法器的真值表）:
| Inputs | Outputs | ||
| A | B | Diff | Borrow |
| 0 | 0 | 0 | 0 |
| 0 | 1 | 1 | 1 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 0 |
The corresponding boolean expression:
Diff = A XOR B
Borrow = A’B
The corresponding circuit:
Full Adder（全加器）
Full Adder – Truth table
Full Adder – Boolean expression
S = A’B’Ci + A’BCi’ + AB’Ci’ + ABCi = (A ⊕ B) ⊕ Ci
Co = A’BCi + AB’Ci + ABCi’ + ABCi = (A ⊕ B) Ci + AB
Full Adder –Graphic symbols
Karnaugh map（卡诺图）
K-map
K-map: a convenient way of representing a Boolean function of a small number (up to four) of variables.（表示少量（最多四个）变量的布尔函数的简便方法）
for the purposes of simplification
The map is an array of 2n squares, representing_all possible combinations of values of n binary
variables.
Construction of K-map
two variables：
| A | B | f(A,B) |
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 1 |
two variables ：four squares, list the combinations in the order 00, 01, 11, 10, the combinations
are customarily written above the squares.(以00、01、11、10的顺序)
two variables ：four squares:
Rules of Simplification
Rules of Simplification 01
No zeros allowed:
Rules of Simplification 02
No diagonals(没有对角线)：
Rules of Simplification 03
Only power of 2 number of cells in each group.（每组的个数是2的幂次）
Rules of Simplification 04
Groups should be as large as possible.（群体应该尽可能的大）
Note that no Boolean laws broken.（请注意，没有任何布尔定律被违反）
Rules of Simplification 05
Every 1 must be in at least one group(每个1个必须至少属于一组)
Rules of Simplification 06
Overlapping allowed.(允许重叠)
Rules of Simplification 07
Wrap around allowed.(包裹允许)
Rules of Simplification 08
Fewest number of groups possible.(尽可能拥有的最少的群体数量。)
Truth table → K-map → Simplest Boolean expression
（真值表→K-map→最简单的布尔表达式）
Apply the K-Map technique and produce a simplest boolean expression (using NOT, AND, OR
operators only) for the below truth table:
| A | B | f(A,B) |
| 0 | 0 | 1 |
| 0 | 1 | 0 |
| 1 | 0 | 1 |
| 1 | 1 | 1 |
The K-Map:
The corresponding boolean expression:
f(A,B) = A + B’
K-Map for Truth Table
Apply the K-Map technique and produce a simplest boolean expression (using NOT, AND, OR operators only) for the below truth table:
K-Map (1)：
K-Map (2)：
The corresponding boolean expression:
f(A,B) = A’B + C
1848
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
