NAND Implementation
Consider the following sum-of-products
expression:
f = bd + a’cd ‘
A 2-level AND-OR circuit can be converted
easily to a 2-level NAND-NAND implementation
17, 2024
January 23, 2021 Dr. Al-Amin Bhuiyan [email protected] 1
January 17, 2021 Dr. Al-Amin Bhuiyan [email protected] 2
January 17, 2021 Dr. Al-Amin Bhuiyan [email protected] 3
Simplifying Logic Circuits
= AB · (A + BC)
= AB · (A · BC) [DeMorgan’s]
= AB · (A · BC) [cancel double inversions]
= AB · (A · [B + [DeMorgan’s]
C)]
17, 2024
January 23, 2021 Dr. Al-Amin Bhuiyan [email protected] 4
Simplifying Logic Circuits
= AB · (AB + AC) [Multiply]
= AB · AB + AB · AC [Multiply]
= BAC [A · A = A, B · B = 0]
= ABC [reorder]
17, 2024
January 23, 2021 Dr. Al-Amin Bhuiyan [email protected] 5