Family Logic Gates [edit]

1. 2. 3. 4. Fundamental Digital Gates Combinational Gates Basic Logic Gates Summary Logic NAND

Digital Gates [edit]

Digital gate is a Digital Device used to perform the logic operation on the input(s) to produce an equivalent logic in the output. The output produced from the inputs are listed in a table called a Truth table. The relation between output and inputs can also be represented by a mathematic equation . There are 5 basic digital gates used to perform Logic Operation namely Buffer, NOT, AND, OR, XOR

Basic Digital Gates [edit]

Basic Logic Gates Buffer Symbol Mathmatical Formula Q=A Truth Table AQ 00 11 AQ 01 10 ABQ 000 010 100 111 ABQ 000

NOT

Q = NOT A

AND

Q=A.B

OR

Q=A+B

XOR

Q=A+B

011 101 111 ABQ 000 011 101 110

Retrieved from "http://en.wikibooks.org/w/index.php?title=Digital_Electronics/Logic_Gates/Fundamental_Digit al_Gates&oldid=2238169" Category: Digital Electronics *************

Combination gates [edit]

More than one logic gates can be connected to produce new logic gates
Buffer [edit] Basic Logic Gates Combinational Gates Symbol Mathmatical Formula Truth Table AB 00 11

Buffer

Y = is NOT NOT A Y=A

NOT Gate [edit] Digital Gate Combinational Gates Symbol Mathematical Expression Truth Table AB 01 10

NOT Gate

Y = is NOT A

NAND Gate [edit] Digital Gate Combinational Gate Symbol Mathematical Expression Truth Table AB 01 10

Buffer

Y = is NOT A

NOR Gate [edit] Digital Gate Combinational Gate Symbol Mathematical Expression Truth Table AB 01 10

NOT

Y = is NOT A

XNOR Gate [edit] Basic Gates Combinational Gate Symbol Mathematical Formula Truth Table AB 01 10

NOT Gate

Y = is NOT A

Logic Gates Summary [edit]

The table below summarize all the Basic Digital Gates and their characteristics Basic Logic Gates Buffer Symbol Mathmatical Formula Q=A Truth Table AQ 00 11 AQ 01 10 ABQ 000 010

NOT

Q = NOT A

AND

Q=A.B

NAND

Q=A.B

OR

Q=A+B

NOR

Q=A+B

XOR

Q=A+B

XNOR

Q=A+B

100 111 ABQ 000 010 100 111 ABQ 000 011 101 111 ABQ 000 011 101 111 ABQ 000 011 101 110 ABQ 000 011 101 110

Digital Electronics/Logic Gates/Logic NAND

Logic NAND [edit]

NAND gates are one of the two basic logic gates (the other being NOR logic) from which any other logic gates can be built. Due to this property, NAND and NOR gates are sometimes called "universal gates". However, modern integrated circuits are not constructed exclusively from a single type of gate. Instead, EDA tools are used to convert the description of a logical circuit to a netlist of complex gates (standard cells) or transistors (full custo] approach).

NOT [edit]
A NOT gate is made by joining the inputs of a NAND gate. Since a NAND gate is equivalent to an AND gate followed by a NOT gate, joining the inputs of a NAND gate leaves only the NOT part.

Desired Gate

NAND Construction

Truth Table Input A Output Q 0 1 1 0

AND [edit]
An AND gate is made by following a NAND gate with a NOT gate as shown below. This gives a NOT NAND, i.e. AND. Desired Gate NAND Construction

Truth Table Input A Input B Output Q 0 0 0 0 1 0 1 0 0 1 1 1

OR [edit]
If the truth table for a NAND gate is examined or by applying De Morgan's Laws, it can be seen that if any of the inputs are 0, then the output will be 1. However to be an OR gate, if any input is 1, the output must also be 1. Therefore, if the inputs are inverted, any high input will trigger a high output. Desired Gate NAND Construction

Truth Table Input A Input B Output Q

0 0 1 1

0 1 0 1

0 1 1 1

NOR [edit]
A NOR gate is simply an OR gate with an inverted output: Desired Gate NAND Construction

Truth Table Input A Input B Output Q 0 0 1 0 1 0 1 0 0 1 1 0

XOR [edit]
An XOR gate is constructed similarly to an OR gate, except with an additional NAND gate inserted such that if both inputs are high, the inputs to the final NAND gate will also be high, and the output will be low. This effectively represents the formula: "(A NAND (A NAND B)) NAND (B NAND (A NAND B))". Desired Gate NAND Construction

Truth Table Input A Input B Output Q 0 0 0 0 1 1

1 1

0 1

1 0

XNOR [edit]
An XNOR gate is simply an XOR gate with an inverted output: Desired Gate NAND Construction

Truth Table Input A Input B Output Q 0 0 1 0 1 0 1 0 0 1 1 1