Scribd
Upload
13 views8 pages

Logic Gates

Logic gates are essential components in electronics that perform logical operations on binary inputs to produce a binary output. The basic types of logic gates include OR, AND, NOT, and XOR, with combinations forming additional gates like NAND and NOR. De Morgan's Laws describe the relationships between unions and intersections of sets in Boolean algebra.

Uploaded by

Computer Engineering
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
13 views8 pages

Logic Gates

Logic gates are essential components in electronics that perform logical operations on binary inputs to produce a binary output. The basic types of logic gates include OR, AND, NOT, and XOR, with combinations forming additional gates like NAND and NOR. De Morgan's Laws describe the relationships between unions and intersections of sets in Boolean algebra.

Uploaded by

Computer Engineering
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Logic gates

Logic gates are an important concept if you are studying electronics. These are important digital
devices that are mainly based on the Boolean function. Logic gates are used to carry out logical
operations on single or multiple binary inputs and give one binary output. In simple terms, logic
gates are the electronic circuits in a digital system.

Types of Basic Logic Gates

There are several basic logic gates used in performing operations in digital systems. The
common ones are

 OR Gate
 AND Gate
 NOT Gate
 XOR Gate
Additionally, these gates can also be found in a combination of one or two. Therefore, we get
other gates, such as NAND Gate, NOR Gate, E-XOR Gate and E-XNOR Gate.

OR Gate
OR gate is an electronic circuit which produce high output when one of the input is high
otherwise output will be low.

The Boolean expression of the OR gate is Y = A + B.

Truth table of an OR gate is:

A B Y

0 0 0

0 1 1

1 0 1

1 1 1
AND Gate
AND gate is an electronic circuit which produce the high output when both the input is high
otherwise output will be low.

The Boolean expression of AND gate is Y = A.B

Truth table of an AND gate is:

A B Y

0 0 0

0 1 0

1 0 0

1 1 1

NOT Gate
Not gate is an electronic circuit which produces the high output when the input is low and
produces the low output when the input is high.
The Boolean expression is Y= ¯A

Truth table of an NOT gate is:

A Y

0 1

1 0

NAND Gate

NAND gate is an electronic circuit which produce the low output when all the input is high
otherwise the output will be high. It is the combination of NOT gate and AND gate.

Truth table

A B Y

0 0 1

0 1 1

1 0 1
1 1 0

NOR Gate
NOR gate is the electronic circuit which produce the high output when all the input is low
otherwise the output will be low. It is the combination of OR and NOT gates.

Truth table of an NOR gate is:

A B Y

0 0 1

0 1 0

1 0 0

1 1 0

Exclusive-OR gate (XOR Gate)


XOR gate is the electronic circuit which produce the low output when all the input is same
otherwise the output will be high. It is also known as exclusive –OR gate.
The Boolean expression of the XOR gate is Y=A⨁B

The truth table of an XOR gate is

A B Y

0 0 0

0 1 1

1 0 1

1 1 0

Exclusive-NOR Gate (XNOR Gate)


XNOR gate is an electronic circuit which produce the high output when all the input is same
otherwise the output will be low. It is also known as exclusive –NOR gate.

The Boolean expression of the XNOR gate


The truth table of an XNOR gate is given below

A B Y

0 0 1

0 1 0

1 0 0

1 1 1

First De Morgan’s Law


First De Morgan’s law states that “The complement of the union of two sets is equal to the
intersection of the complements of each set.”
Let A and B be two sets, then mathematically First De Morgan’s Law is given as:
(A . B)’ = A’ + B’
Where
 U represents the Union operation between sets,
 ∩ represents intersection operation between sets, and
 ‘ represents complement operation on a set.
Second De Morgan’s Law in Boolean algebra
Second De Morgan’s law states that “The complement of AND of two or more variables is
equal to the OR of the complement of each variable.”
Let A and B be two variables, then mathematically Second De Morgan’s Law is given as:
(A . B)’ = A’ + B’
Where
 + represents the OR operator between variables,
 . represents AND operator between variables, and
 ‘ represents complement operation on variable.

You might also like