Scribd
Upload
19 views46 pages

Digital Unit-2 Basic Gates

Digital and fundamental unit 2 basic gates

Uploaded by

senthilsenthil0715
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
19 views46 pages

Digital Unit-2 Basic Gates

Digital and fundamental unit 2 basic gates

Uploaded by

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

Basic Gates

Logic Gates
• Logic gates are the fundamental components of all digital
circuits and systems.
• A logic gate is basically an electronic circuit designed by using
components like diodes, transistors, resistors, capacitors,
etc., and capable of performing logical operations.
• A logic gate can take two or more inputs but only produce one
output.
• The output of a logic gate depends on the combination of
inputs and the logical operation that the logic gate performs.
• In digital electronics, there are seven main types of logic
gates used to perform various logical operations.
• Logic gates, use logic to determine whether or
not to pass a signal.
• Logic gates, on the other hand, govern the
flow of information based on a set of rules.
Types of Logical Gates
• 1. Basic Logic Gates
• There are three basic logic gates:
• AND Gate
• OR Gate
• NOT Gate
• 2. Universal Logic Gates
• In digital electronics, the following two logic gates are considered as universal
logic gates:
• NOR Gate
• NAND Gate
• 3. Derived Logic Gates
• The following two are the derived logic gates used in digital systems:
• XOR Gate
• XNOR Gate
AND Gate
OR GATE
NOT GATE
NOT GATE
NOR GATE
BOOLEAN ALGEBRA
• Boolean algebra can be considered as an
algebra that deals with binary variables and
logic operations.
• A mathematician, named George Boole had
developed this algebra in 1854.
• Boolean Algebra is used to analyze and
simplify the digital (logic) circuits.
• It uses only the binary numbers i.e. 0 and 1. It
is also called as Binary Algebra or logical
Algebra.
• The variables used in this algebra are also
called as Boolean variables.
• The range of voltages corresponding to Logic
‘High’ is represented with ‘1’ and the range of
voltages corresponding to logic ‘Low’ is
represented with ‘0’.
• The Boolean algebraic functions are mostly
expressed with binary variables, logic
operation symbols, parentheses, and equal
sign.
• Example: F = x + y'z
Boolean Algebra Laws
Rules for product operation: (or)
AND law

These laws use the AND operation.

Therefore they are called as AND laws.


Rules for Sum operation: (or)
OR law
These laws use the OR operation.

Therefore they are called as OR laws.


NOT operation
OR operation
AND operation
Commutative law
• Commutative Law states that the interchanging
of the order of operands in a Boolean equation
does not change its result.
OR operator → A + B = B + A
AND operator → A * B = B * A
• If any logical operation of two Boolean
variables give the same result irrespective of
the order of those two variables, then that
logical operation is said to be Commutative.
Associative Law

• If a logical operation of any two Boolean


variables is performed first and then the same
operation is performed with the remaining
variable gives the same result, then that
logical operation is said to be Associative.
Distributive Law

• Distributive Law states that the multiplication


of two variables and adding the result with a
variable will result in the same value as
multiplication of addition of the variable with
individual variables.
Double Inverse Theorem (or) Inversion law
Here are some of the main steps used to solve
the duality theorem in boolean algebra:
• Change each AND operation to an OR
operation.
• Change each OR operation to an AND
operation.
• Replace 0 with 1.
• Replace 1 with 0.
De Morgan's Theorem

• De Morgan's Law is also known as De Morgan's


theorem, works depending on the concept of
Duality. Duality states that interchanging the
operators and variables in a function, such as
replacing 0 with 1 and 1 with 0, AND operator with
OR operator and OR operator with AND operator.
First Theorem
• "The negation of
disjunction is the
conjunction of the
negations", which
means that compliment
of the sum of two
variables is equal to the
product of the
complement of each
variable.
Second Theorem
• "The negation of a
conjunction is the
disjunction of the
negations", which
means that the
complement of the
product of 2 variables is
equal to the sum of the
compliments of
individual variables.

You might also like