From WikiChip
Editing logic gate

Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.

This page supports semantic in-text annotations (e.g. "[[Is specified as::World Heritage Site]]") to build structured and queryable content provided by Semantic MediaWiki. For a comprehensive description on how to use annotations or the #ask parser function, please have a look at the getting started, in-text annotation, or inline queries help pages.

Latest revision Your text
Line 20: Line 20:
 
| 0 || 0
 
| 0 || 0
 
|-
 
|-
| 1 || 1
+
| 0 || 0
 
|}
 
|}
 
{{main|buffer gate|l1=Buffer}}
 
{{main|buffer gate|l1=Buffer}}
Line 26: Line 26:
  
 
This gate implements the following Boolean function: <math>Q = A</math>
 
This gate implements the following Boolean function: <math>Q = A</math>
{{clear}}
 
 
 
===Tri-state Buffer===
 
===Tri-state Buffer===
 
{| class="wikitable" style="float: right;"
 
{| class="wikitable" style="float: right;"
Line 39: Line 37:
 
{{main|tri-state buffer gate|l1=Tri-state Buffer}}
 
{{main|tri-state buffer gate|l1=Tri-state Buffer}}
 
[[File:tri-state buffer gate (ansi).svg|100px]] A '''Tri-state Buffer''' is a gate that outputs the very same input it is given only when the control signal allows it. When the control signal is off, the output is at [[high impedance]]. This gate forms the basis for [[buses]], by controlling which devices is allow to generate output to a shared [[bus]].
 
[[File:tri-state buffer gate (ansi).svg|100px]] A '''Tri-state Buffer''' is a gate that outputs the very same input it is given only when the control signal allows it. When the control signal is off, the output is at [[high impedance]]. This gate forms the basis for [[buses]], by controlling which devices is allow to generate output to a shared [[bus]].
{{clear}}
 
 
===NOT Gate===
 
===NOT Gate===
 
{| class="wikitable" style="float: right;"
 
{| class="wikitable" style="float: right;"
Line 53: Line 50:
  
 
This gate implements the following Boolean function: <math>Q = \bar{A} = \neg A</math>
 
This gate implements the following Boolean function: <math>Q = \bar{A} = \neg A</math>
{{clear}}
 
 
===AND Gate===
 
===AND Gate===
 
{| class="wikitable" style="float: right;"
 
{| class="wikitable" style="float: right;"
Line 70: Line 66:
 
[[File:and gate (ansi).svg|100px]] An '''AND gate''' outputs a HIGH only when both inputs are HIGH, otherwise it outputs a LOW. The Boolean AND operation is equivalent to the Boolean multiplication operation.
 
[[File:and gate (ansi).svg|100px]] An '''AND gate''' outputs a HIGH only when both inputs are HIGH, otherwise it outputs a LOW. The Boolean AND operation is equivalent to the Boolean multiplication operation.
  
The AND gate implements the following Boolean function: <math>Q = AB = A \and B = A \& B = A \cdot B</math>
+
The AND gate implements the following boolean function: <math>Q = AB = A \and B = A \& B = A \cdot B</math>
{{clear}}
 
 
===OR Gate===
 
===OR Gate===
{| class="wikitable" style="float: right;"
 
|-
 
! A !! B !! Q
 
|-
 
| 0 || 0 || 0
 
|-
 
| 0 || 1 || 1
 
|-
 
| 1 || 0 || 1
 
|-
 
| 1 || 1 || 1
 
|}
 
 
{{main|OR gate}}
 
{{main|OR gate}}
[[File:or gate (ansi).svg|100px]] The '''OR gate''' outputs a HIGH if any of its inputs are HIGH, otherwise it outputs a LOW. This function is equivalent to the Boolean addition function.
 
 
The OR gate implements the following Boolean function: <math>Q = A + B = A \or B</math>
 
{{clear}}
 
 
===XOR Gate===
 
===XOR Gate===
{| class="wikitable" style="float: right;"
 
|-
 
! A !! B !! Q
 
|-
 
| 0 || 0 || 0
 
|-
 
| 0 || 1 || 1
 
|-
 
| 1 || 0 || 1
 
|-
 
| 1 || 1 || 0
 
|}
 
 
{{main|XOR gate}}
 
{{main|XOR gate}}
[[File:xor gate (ansi).svg|100px]] The '''XOR gate''' ('''Exclusive-OR gate''') outputs a HIGH when both inputs differ, otherwise it outputs a LOW. That is, the output is HIGH when one of the inputs are HIGH exclusively.
 
 
The XOR gate implements the following Boolean function: <math>Q = A \underline{\lor} B = A \oplus B = (A \neq B)</math>
 
{{clear}}
 
 
===NAND Gate===
 
===NAND Gate===
{| class="wikitable" style="float: right;"
 
|-
 
! A !! B !! Q
 
|-
 
| 0 || 0 || 1
 
|-
 
| 0 || 1 || 1
 
|-
 
| 1 || 0 || 1
 
|-
 
| 1 || 1 || 0
 
|}
 
 
{{main|NAND gate}}
 
{{main|NAND gate}}
[[File:nand gate (ansi).svg|100px]] The '''NAND gate''' (NOT AND) outputs a HIGH so long both inputs are not HIGH, otherwise it outputs a LOW.
 
 
This gate implements the following Boolean function: <math>Q = \overline{A \wedge B} = A \overline{\wedge} B = \overline{A\,B} = A|B</math>
 
{{clear}}
 
 
===NOR Gate===
 
===NOR Gate===
{| class="wikitable" style="float: right;"
 
|-
 
! A !! B !! Q
 
|-
 
| 0 || 0 || 1
 
|-
 
| 0 || 1 || 0
 
|-
 
| 1 || 0 || 0
 
|-
 
| 1 || 1 || 0
 
|}
 
 
{{main|NOR gate}}
 
{{main|NOR gate}}
[[File:nor gate (ansi).svg|100px]] The '''NOR gate''' outputs a HIGH only when both inputs are LOW, otherwise it outputs a LOW.
 
 
This gate implements the following Boolean function: <math>Y = \overline{A \vee B} = A \overline{\vee} B = \overline{A + B} = A - B</math>
 
{{clear}}
 
 
 
===XNOR Gate===
 
===XNOR Gate===
{| class="wikitable" style="float: right;"
 
|-
 
! A !! B !! Q
 
|-
 
| 0 || 0 || 1
 
|-
 
| 0 || 1 || 0
 
|-
 
| 1 || 0 || 0
 
|-
 
| 1 || 1 || 1
 
|}
 
 
{{main|XNOR gate}}
 
{{main|XNOR gate}}
[[File:xnor gate (ansi).svg|100px]] The '''XNOR gate''' (Exclusive-NOR") outputs a HIGH when both inputs are the same, otherwise it outputs a LOW.
 
 
This gate implements the following Boolean function: <math>Y = \overline{A \underline{\lor} B} = A \overline{\underline{\lor}} B = \overline{A \oplus B} = A \odot B</math>
 
{{clear}}
 
  
== See also ==
 
* [[compound logic gate]]s
 
  
 +
{{stub}}
 
[[Category:logic gates]]
 
[[Category:logic gates]]

Please note that all contributions to WikiChip may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see WikiChip:Copyrights for details). Do not submit copyrighted work without permission!

Cancel | Editing help (opens in new window)