0% found this document useful (0 votes)
226 views5 pages

Inverter Logic Gates Overview

The document discusses various logic gates - inverters, AND, OR, NAND, NOR, XOR, and XNOR gates. It defines each gate, provides their truth tables, and logic expressions for their outputs. The number of possible input combinations for a gate is determined by 2^n, where n is the number of inputs.
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
226 views5 pages

Inverter Logic Gates Overview

The document discusses various logic gates - inverters, AND, OR, NAND, NOR, XOR, and XNOR gates. It defines each gate, provides their truth tables, and logic expressions for their outputs. The number of possible input combinations for a gate is determined by 2^n, where n is the number of inputs.
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

The Inverter

Logic Gates

The inverter (NOT circuit) performs the operation called inversion or complementation. Standard logic symbols:
1 input output input 1 output

11 !"#$%! 2555
1 2

Inverter Truth Table & Logic Expression


Input LOW (0) Output
0 1

The AND Gate & Its Operation


!

The AND gate is composed of two or more inputs and a single output.
A A X B & X

HIGH (1)
1 0
!

HIGH (1)

LOW (0)

For a 2-input AND gate:


"

Output X is HIGH only when inputs A and B are HIGH X is LOW when either A or B is LOW, or when both A and B are LOW.
4

X=A

"

AND Gate Truth Table


INPUTS A 0 0 1 1
!

A B

AND Gate Logic Expressions


!

OUTPUT B 0 1 0 1 X 0 0 0 1

Use either:
" "

X = A ! B ,or X = AB

A B

If there are more than 2 inputs, do as below:


A B C

The total number of possible combinations of binary inputs to a gate is determined by:
! ! N= 2n

X= ABC

Therefore:
" " "

2 bits (n=2) = 4 combinations 3 bits = 8 combinations 4 bits = 16 combinations


5

A B C D

X= ABCD

The OR Gate
!

OR Gate Truth Table


A B X

Like AND gate, an OR gate has two or more inputs and one output.
A B X B A "1 X

INPUTS A 0 B 0 1 0 1

OUTPUT X 0 1 1 1

For a 2-input OR gate:


"

0 1 1

output X is HIGH when either input A or input B is HIGH, or when both A and B are HIGH. X is LOW only when both A and B are LOW.
7

"

OR Gate Logic Expressions


!

The NAND Gate


!

Use the operator + for OR operation


" "

X=A+B If there are more than 2 inputs, do as below:


A B

NAND = NOT-AND
X A B

A
X

&

A B C

X= A+B+C

For a 2-input NAND gate:


"

Output X is LOW only when inputs A and B are HIGH X is HIGH when either A or B is LOW, or when both A and B are LOW

A B C D

X= A+B+C+D

"

10

NAND Gate Truth Table & Logic Expression


A B X

Negative-OR Equivalent Op of a NAND


!

INPUTS A 0 0 1 1
!

OUTPUT B 0 1 0 1 X 1 1 1 0

For a 2-input NAND gate performing a negative-OR operation


"

Output X is HIGH when either input A or input B is LOW or when both A and B are LOW

The Boolean expression for the output of a 2-input NAND gate is ! ! ! X = AB


11

NAND

Negative-OR

! !

12

The NOR Gate


!

NOR Gate Truth Table & Logic Expression


A B X

NOR = NOT-OR
A B X A B

A
X

INPUTS
"1 X

OUTPUT B 0 1 0 1 X 1 0 0 0

A 0 0 1 1

For a 2-input NOR gate:


"

Output X is LOW when either input A or input B is HIGH, or when both A and B are HIGH X is HIGH only when both A and B are LOW

"

The Boolean expression for the output of a 2-input NOR gate is ! ! ! X = A+B
14

! !
13

Negative-AND Equivalent Op of a NOR


!

The XOR and XNOR Gates


Exclusive-OR and Exclusive-NOR gates are formed by a combination of other gates already discussed. Because of their fundamental importance in many applications, these gates are often treated as basic logic elements with their own unique symbols.

For a 2-input NOR gate performing a negative-AND operation


"

Output X is HIGH only when both inputs A and B are LOW

NOR

Negative-AND

15

16

The XOR Gate


A X B B A =1 X

XOR Gate Truth Table & Logic Expression


A B X

INPUTS A B 0 1 0 1 0 0 1 1
!

OUTPUT X 0 1 1 0

For a 2-input exclusive-OR gate:


"

Output X is HIGH when input A is LOW and input B is HIGH, or when input A is HIGH and input B is LOW X is LOW when A and B are both HIGH and both LOW

"

The Boolean expression for the output of a 2-input XOR gate is ! ! ! X = A+B
18

! !
17

The XNOR Gate


A X B B A =1 X

XNOR Gate Truth Table & Logic Expression


A B X

INPUTS A B 0 1 0 1 0 0 1 1
!

OUTPUT X 1 0 0 1

For a 2-input exclusive-NOR gate:


"

Output X is LOW when input A is LOW and input B is HIGH, or when input A is HIGH and input B is LOW X is HIGH when A and B are both HIGH and both LOW

"

The Boolean expression for the output of a 2-input XNOR gate is ! ! ! X = A+B
20

! !
19

You might also like