Chapter 6 - Revision history

Fonggr at 06:00, 25 March 2010

2010-03-25T06:00:17Z

← Older revision		Revision as of 23:00, 24 March 2010
Line 25:		Line 25:
	\|OR\|\|<math>A+B</math>\|\|<math>\overline{(\overline{A} \, \overline{B})}</math>		\|OR\|\|<math>A+B</math>\|\|<math>\overline{(\overline{A} \, \overline{B})}</math>
	\|}		\|}

			===CMOS Inverter===
			*Zero static power consumption
			*<math>KP_p=\frac{1}{2}KP_n</math>, thus <math>\frac{W}{L}_p=2\frac{W}{L}_n</math> to maintain symmetric transfer characteristics.

	===Questions===		===Questions===
	*p.365: Why even have R_on?		*p.365: Why even have R_on?
	*p.377: What problems are there with the NMOS pull-up?		*p.377: What problems are there with the NMOS pull-up?
			*p.382: For CMOS, are the transistors in Triode or Saturation when they're in the "ON" state? How can we tell?

	===References===		===References===
	<references/>		<references/>

Fonggr: /* Questions */

2010-03-24T22:15:47Z

Questions

← Older revision		Revision as of 15:15, 24 March 2010
Line 28:		Line 28:
	===Questions===		===Questions===
	*p.365: Why even have R_on?		*p.365: Why even have R_on?
			*p.377: What problems are there with the NMOS pull-up?

	===References===		===References===
	<references/>		<references/>

Fonggr at 05:48, 24 March 2010

2010-03-24T05:48:11Z

← Older revision		Revision as of 22:48, 23 March 2010
Line 26:		Line 26:
	\|}		\|}

			===Questions===
			*p.365: Why even have R_on?
	===References===		===References===
	<references/>		<references/>

Fonggr at 03:33, 24 March 2010

2010-03-24T03:33:09Z

← Older revision		Revision as of 20:33, 23 March 2010
Line 16:		Line 16:
	*"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>		*"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		*It is possible to create any combinatorial logic function with solely NAND (or NOR) gates
	:*Inv: <math>\overline{A}=\overline{AA}</math>		{\| class="wikitable" border="1" style="text-align:center"
	:*AND: <math>AB=\overline{(\overline{A}+\overline{B})}</math>		!Gate!!Symbol!!NAND equivalent
	:*OR: <math>A+B=\overline{(\overline{A} \, \overline{B})}</math>		\|-
			\|Inverter\|\|<math>\overline{A}</math>\|\|<math>\overline{AA}</math>
			\|-
			\|AND\|\|<math>AB</math>\|\|<math>\overline{(\overline{A}+\overline{B})}</math>
			\|-
			\|OR\|\|<math>A+B</math>\|\|<math>\overline{(\overline{A} \, \overline{B})}</math>
			\|}

	===References===		===References===
	<references/>		<references/>

Fonggr: /* Digital Logic */

2010-03-24T03:28:10Z

Digital Logic

← Older revision		Revision as of 20:28, 23 March 2010
Line 1:		Line 1:
	===Digital Logic===		===Digital Logic Gates===
	{\| class="wikitable" border="1" style="text-align:center"		{\| class="wikitable" border="1" style="text-align:center"
	\|+Boolean Algebra		\|+Boolean Algebra
Line 13:		Line 13:
	\|}		\|}

	*'''NAND Equivalent Gates~~'''~~		===De Morgan Laws & NAND Equivalent Gates===
	:*Inv: <math>\overline{AA}=\overline{A}</math>~~, Nand with the inputs tied together~~		*"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>
	:*AND: <math>\overline{(\overline{AB})}</math>~~, NAND followed by and Inv~~		*It is possible to create any combinatorial logic function with solely NAND (or NOR) gates
	:*OR: <math>\overline{(\overline{A} \, \overline{B})}~~=A+B~~</math>		:*Inv: <math>\overline{A}=\overline{AA}</math>
	*De Morgan Laws		:*AND: <math>AB=\overline{(\overline{A}+\overline{B})}</math>
	:*		:*OR: <math>A+B=\overline{(\overline{A} \, \overline{B})}</math>
	:*
			===References===
			<references/>

Fonggr: /* Digital Logic */

2010-03-24T03:10:11Z

Digital Logic

← Older revision		Revision as of 20:10, 23 March 2010
Line 13:		Line 13:
	\|}		\|}

	*'''Basic Gates'''
	~~:*NAND: <math>\overline{AB}</math>~~
	~~:*NOR: <math>\overline{A+B}</math>~~
	~~:*XOR: <math>A\oplus B</math>~~
	*'''NAND Equivalent Gates'''		*'''NAND Equivalent Gates'''
	:*Inv: <math>\overline{AA}=\overline{A}</math>, Nand with the inputs tied together		:*Inv: <math>\overline{AA}=\overline{A}</math>, Nand with the inputs tied together

Fonggr at 03:09, 24 March 2010

2010-03-24T03:09:48Z

← Older revision		Revision as of 20:09, 23 March 2010
Line 2:		Line 2:
	{\| class="wikitable" border="1" style="text-align:center"		{\| class="wikitable" border="1" style="text-align:center"
	\|+Boolean Algebra		\|+Boolean Algebra
	!A!!B!!NAND!!NOR!!XOR		!A!!B!!NAND<br><math>\overline{AB}</math>!!NOR<br><math>\overline{A+B}</math>!!XOR<br><math>A\oplus B</math>
	\|-		\|-
	\|0\|\|0\|\|1 \|\|1 \|\|0		\|0\|\|0\|\|1\|\|1\|\|0
	\|-		\|-
	\|0\|\|1\|\|1 \|\|0 \|\|1		\|0\|\|1\|\|1\|\|0\|\|1
	\|-		\|-
	\|1\|\|0\|\|1 \|\|0 \|\|1		\|1\|\|0\|\|1\|\|0\|\|1
	\|-		\|-
	\|1\|\|1\|\|0 \|\|0 \|\|0		\|1\|\|1\|\|0\|\|0\|\|0
	\|}		\|}

			*'''Basic Gates'''
			:*NAND: <math>\overline{AB}</math>
			:*NOR: <math>\overline{A+B}</math>
			:*XOR: <math>A\oplus B</math>
			*'''NAND Equivalent Gates'''
			:*Inv: <math>\overline{AA}=\overline{A}</math>, Nand with the inputs tied together
			:*AND: <math>\overline{(\overline{AB})}</math>, NAND followed by and Inv
			:*OR: <math>\overline{(\overline{A} \, \overline{B})}=A+B</math>
			*De Morgan Laws
			:*
			:*

Fonggr: New page: ===Digital Logic=== {| class="wikitable" border="1" style="text-align:center" |+Boolean Algebra !A!!B!!NAND!!NOR!!XOR |- |0||0||1 ||1 ||0 |- |0||1||1 ||0 ||1 |- |1||0||1 ||0 ||1 ...

2010-03-24T02:51:06Z

New page: ===Digital Logic=== {| class="wikitable" border="1" style="text-align:center" |+Boolean Algebra !A!!B!!NAND!!NOR!!XOR |- |0||0||1 ||1 ||0 |- |0||1||1 ||0 ||1 |- |1||0||1 ||0 ||1 ...

New page

===Digital Logic===
{| class="wikitable" border="1" style="text-align:center"
|+Boolean Algebra
!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
|}