畫上 AND OR NOT 的Logic gate
![]() |
| 完成品 按圖變大 |
![]() |
Truth table |
![]() |
| 完成品 按圖變大 |
![]() | |||||||||||||
| Truth table Simplification of Boolean functions: — Boolean algebra is a useful tool for simplifying digital ckts. |
Basic identities of Boolean Algebra:
— X, Y, Z: binary variableDual:
— The dual of an algebraic expression is obtained by
interchanging OR and AND ops and replacing 1’s by 0’s
and 0’s by 1’s (OR ↔ AND, 0 ↔ 1)
— E.g.:
Duality principle:
— A Boolean equation remains valid
if we take the dual of the expressions on both sides of the
equals sign.
— E.g.:
1. X + 0 = X
2. X • 1 = X
以上有些資料是取自 交通大學開放教育推動中心
開放課程總覽 > 資訊學院 > 數位電路設計
第二章 Combinational Logic Circuits









沒有留言:
張貼留言