De Morgan's Laws in Practice: NAND-Only Circuit Design
TL;DR: De Morgan's two identities — and — let you swap AND for OR (and vice versa) by distributing inversion. The practical payoff: any logic function can be implemented in...
A collection of 4 posts
TL;DR: De Morgan's two identities — and — let you swap AND for OR (and vice versa) by distributing inversion. The practical payoff: any logic function can be implemented in...
TL;DR: The NOR gate outputs 1 only when all inputs are 0 (). Like NAND it is functionally complete — every Boolean function can be built from NOR alone. The...
TL;DR: A NAND gate outputs 1 unless all inputs are 1 (). It is functionally complete — every other Boolean function can be implemented with NAND gates alone. In CMOS...
TL;DR: A truth table lists every possible input combination and the deterministic output a logic gate produces. This reference covers all seven standard gates — AND, OR, NOT, NAND, NOR,...