Difference between revisions of "Chapter 6"
From Class Wiki
(→Digital Logic) 
(→Digital Logic) 

Line 1:  Line 1:  
−  ===Digital Logic=== 
+  ===Digital Logic Gates=== 
{ class="wikitable" border="1" style="textalign:center" 
{ class="wikitable" border="1" style="textalign:center" 

+Boolean Algebra 
+Boolean Algebra 

Line 13:  Line 13:  
} 
} 

−  +  ===De Morgan Laws & NAND Equivalent Gates=== 

−  +  *"If the variables in a logic expression are replaced by their inverses, and if the AND operation is replaced by OR, the OR operation is replaced by AND, and the expression is inverted, the resulting logic expression yields the same values as before the changes."<ref>Electronics p.353</ref> 

−  +  *It is possible to create any combinatorial logic function with solely NAND (or NOR) gates 

−  :* 
+  :*Inv: <math>\overline{A}=\overline{AA}</math> 
−  * 
+  :*AND: <math>AB=\overline{(\overline{A}+\overline{B})}</math> 
−  :* 
+  :*OR: <math>A+B=\overline{(\overline{A} \, \overline{B})}</math> 
−  +  
+  ===References=== 

+  <references/> 
Revision as of 20:28, 23 March 2010
Digital Logic Gates
A  B  NAND 
NOR 
XOR 

0  0  1  1  0 
0  1  1  0  1 
1  0  1  0  1 
1  1  0  0  0 
De Morgan Laws & NAND Equivalent Gates
 "If the variables in a logic expression are replaced by their inverses, and if the AND operation is replaced by OR, the OR operation is replaced by AND, and the expression is inverted, the resulting logic expression yields the same values as before the changes."<ref>Electronics p.353</ref>
 It is possible to create any combinatorial logic function with solely NAND (or NOR) gates
 Inv:
 AND:
 OR:
References
<references/>