![](/img/trans.png)
[英]Converting logic gates to a purely NAND implementation, how come this is valid?
[英]How to write a logic expression with only NAND gates
我想将逻辑表达式转换为仅具有NAND门。 我知道NAND写为¬(A⋀B)
。
我有以下表达式 : (A⋁(¬B))⋀C
如何仅使用NAND编写此表达式?
Y = (A ⋁ (¬B)) ⋀ C
= ¬¬{(A ⋁ (¬B)) ⋀ C} //Double negation
= ¬{¬(A V (¬B) V ¬C} //De-Morgan law
= ¬{(¬A ⋀ B) V ¬C} //Reverse De-Morgan law
= ¬{(¬A V ¬C) ⋀ (B V ¬C)} //Distributive law
= ¬{¬(A ⋀ C) ⋀ ¬(¬B ⋀ C)} //Apply reverse De-Morgan law
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.