门电路入门
1.基本门电路
非门 ’
与门 •>或门 +
“异或门” ⊕
注意:这个门并不是基本的门,可以由前者组合而来
A ⊕ B = A • B’ + A’ • B
2.有用的公式
Operations with 0 and 1 | |
1. X • 1 = X | 1D. X + 0 = X |
2. X • 0 = 0 | 2D. X + 1 = 1 |
Idempotent Law | |
3. X • X = X | 3D. X + X = X |
Involution Law | |
4. (X')' = X | |
Laws of Complementarity | |
5. X • X' = 0 | 5D. X + X' = 1 |
Commutative Law | |
6. X • Y = Y • X | 6D. X + Y = Y + X |
Associative Laws | |
7. (X • Y) • Z = X • (Y • Z) = X • Y • Z | 7D. (X + Y) • Z = X + (Y + Z) = X + Y + Z |
Distributive Laws: | |
8. X • (Y+ Z) = (X • Y) + (X • Z) | 8D. X + (Y• Z) = (X + Y) • (X + Z) |
Simplification Theorems | |
9.X •(X+Y)=X | 9D.X+(X•Y)=X |
10.X•Y)+(X •Y')=X | 10D.(X+Y)•(X +Y')=X |
11.(X +Y')•Y=X•Y | 11D.(X •Y')+Y=X+Y |
DeMorgan's Law: | |
12. (X • Y • Z • ...)' = X' + Y' + Z' + ... | 12D. (X + Y + Z + ...)' = X' • Y' • Z' • ... |
3.公式推导演示
推导一
简化合并
推到二
添1“复杂化”
上面的两种方法分别运用了逻辑处理时代表性的两种方法
4.表示形式
Truth table
Canonical SOP Forms
Standard “shorthand” notation here 再简单一点
左边输入值做二进制运算,100->4,记为m4
看起来相比于ABC,m1 m2更加简单?
所以canonical form ≠ minimal form
5.结语
之后我们会见到更复杂的组合电路~