Logic Gates & Types of Logic Gates:

Logic Gate & Types of Logic Gates:

A Logic gates is a circuit that has one or more input voltages however only one output voltage.

logic gates are basic building blocks of the digital system.OR, NOT,  &  AND Gates are the fundamental kinds of gates. The interrelationship of gates to perform a type of logical works is called logic design.

Pin diagram of a Logic gates.

Logic Gate & Types of Logic Gates:

Types of Logic Gates:

NOT GATE:

A NOT gate creates an output which is the fulfillment of the input and It has only one input signal.

It creates a 1 output when the input is 0. and

It creates a 0 output when the input is 1.

The four generally used methods of displaying the NOT operation as shown in the figure.

In the English language (Output Y is the complement of Input A)
 Boolean expression Y=Ā (“-” indicates NOT symbol)
 symbol Logic Gates
 truth table
input A Output Y
Closed On
Open Off

The diagram shows the idea of the NOT gate using a switch. The lamp (Y) will glow when the switch (A) is on. The lamp (Y) will not glow when the switch (A) is off.

Logic Gate & Types of Logic Gates:Logic Gates

The two possible switch position is shown below. The truth table shows that NOT gate of the switch and lamp circuit. The output of the NOT Gate circuit will be enabled when the input switch is ON.

Input  A Output  Y
Closed Off
Open On

OR GATE:

An OR gate is infrequent called the “ all gate”. OR gate has two or additional input signals.

  • It creates a 1 output of any or all inputs are 1.
  • It creates a 0 output when all inputs are 0.

An OR gate simulars to the action of parallel switches for the input.

The below table shows the four generally used methods for expressing the OR operation.

In the English language Inputs( A is ORed with  B) to yield output Y
Boolean expression A + B = Y  (‘+’ Indicates OR symbol)
 symbol Logic Gates
 truth table
Input A Input B Output Y
0 0 0
1 0 1
0 1 1
1 1 1

The diagram shows the idea of the OR gates using switches.

  • The lamp (Y) will glow when either switch A, B or switch C is closed.
  • The lamp will also glow when switches A, B, and C are closed.
  • The lamp will not glow when switches A, B, and C are open.

Logic Gate & Types of Logic Gates:

AND GATE:

An AND gate is infrequent called the “all or nothing gate”. It has two or additional input signals.

  • It creates a 1 output only when all inputs are 1. Otherwise,
  • It creates a 0 output (nothing).
  • In other words, it creates a 0 output when any input is 0.
An AND gate simulars to the action of series switches for the input.

The below table shows the four commonly used methods for expressing the AND operation.

In the English language Inputs( A is ANed with  B) to yield output Y
 Boolean expression A.B = Y  (‘.’ Indicates AND symbol)
 Symbol Image result for and gate symbol
 Truth table
A B Y
0 0 0
1 0 0
0 1 0
1 1 1

 

It shows the example of the AND gate using switches.

The lamp (Y) will glow only when both input switches (A and B) are off.

Logic Gate & Types of Logic Gates:Logic Gate & Types of Logic Gates:

All other possible groups for switches A and B are shown in the below table.

Switch Combination:

Input switches Output Light
A B Y
1 1 Off
1 0 Off
0 1 Off
0 0 On

NOR GATE:

” A NOR gates show an OR gates followed by an inverter”. NOR Gate has two or additional input signals.

  • It creates a 1 when all the inputs are 0.
  • It creates a 0 output when any or all of the inputs are 1.
  • It so also works as a negative (bubbled) AND gate.

The table the four generally used methods for expressing the NAND operation is the given below.

In the English language Inputs( A is NORed with  B) to yield output Y
Boolean expression A + B = Y  (‘+’ Indicates OR symbol)
 Symbol Image result for or gate symbol
 Truth table
A B Y
0 0 1
1 0 0
0 1 0
1 1 0

NAND GATE:

(“A NAND gate current an AND gates followed by an inverter”). NAND gate has two or additional input signals.

  • It creates a 0 output only when all the inputs are 1.
  • It creates a 1 output when any of the inputs is 0.

De Mergon’s second theorem says that the NAND function is equivalent to a negative (bubbled) OR gate.

The table the four generally used methods for expressing the NAND operation is given below

In the English language Inputs( A is Nanded with  B) to yield output Y
Boolean expression
 Symbol Logic Gates
Truth table
A B Y
0 0 ON
0 1 ON
1 0 ON
1 1 Off

Please click here:

Be the first to comment

Leave a Reply

Your email address will not be published.


*