Scribd
Upload
98 views11 pages

Logic Gates and Boolean Algebra-Outline

Logic gates (AND, OR, NOT, NAND, NOR, XOR, XNOR) and Boolean algebra are used in digital circuits and systems. Boolean algebra uses rules like commutative, associative, and distributive laws to simplify logical statements. Logic gates are the basic building blocks and can be combined using these Boolean operations to perform operations on binary inputs and outputs.

Uploaded by

Siddharajsinh Gohil
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 DOCX, PDF, TXT or read online on Scribd
98 views11 pages

Logic Gates and Boolean Algebra-Outline

Logic gates (AND, OR, NOT, NAND, NOR, XOR, XNOR) and Boolean algebra are used in digital circuits and systems. Boolean algebra uses rules like commutative, associative, and distributive laws to simplify logical statements. Logic gates are the basic building blocks and can be combined using these Boolean operations to perform operations on binary inputs and outputs.

Uploaded by

Siddharajsinh Gohil
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 DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 11

LOGIC GATES AND BOOLEAN ALGEBRA

Logic Gates and Boolean Algebra-Outline


• Logic Gates: AND , OR, NOT(Inverter),NOR, NAND,
XOR & XNOR
• Boolean Theorem: Commutative, Associative,
Distributive Laws & Basic Rules

Logic Gates
• Computers are developed using bi-stable devices
such as transistors.
• They can be in only 2 states either ON or OFF.
• A simple switch is an example for such a device
which can either be ON or OFF.
• Electronic gates require a power supply.
• Gate INPUTS are driven by voltages having two
nominal values, e.g. 0V and 5V representing logic 0
and logic 1 respectively.
• The OUTPUT of a gate provides two nominal values
of voltage only, e.g. 0V and 5V representing logic 0
and logic 1 respectively. In general, there is only one
output to a logic gate except in some special cases.

Switch Bulb
Fundamental logic gates
0 0
1. AND are all 1 1
inputs are true?
2. OR is at least one input is true?
3. NOT flip the truth value

Truth Tables
Truth tables are used to help show the function of a logic
gate.

Logic Gates
Digital systems are said to be constructed by using logic
gates.
These gates are the AND, OR, NOT, NAND, NOR, EXOR
and EXNOR gates.
The basic operations are described below with the aid of
truth tables.

(1) AND gate


The AND gate is an electronic circuit that gives a high
output (1) only if all its inputs are high.  A dot (.) is used to
show the AND operation i.e. A.B
 

(2) OR gate
The OR gate is an electronic circuit that gives a high
output (1) if one or more of its inputs are high.  A plus (+)
is used to show the OR operation.

(3) NOT gate


The NOT gate is an electronic circuit that produces an
inverted version of the input at its output.  It is also known
as an inverter. If the input
variable is A, the inverted output is known as NOT A.  This
is also shown as A', or A with a bar over the top, as shown
at the outputs
(4) NAND gate
This is a NOT-AND gate which is equal to an AND gate
followed by a NOT gate.  The outputs of all NAND gates
are high if any of the inputs are low. The symbol is an
AND gate with a small circle on the output. The small
circle represents inversion.

 
(5) NOR gate
This is a NOT-OR gate which is equal to an OR gate
followed by a NOT gate.  The outputs of all NOR gates are
low if any of the inputs are high.
The symbol is an OR gate with a small circle on the
output. The small circle represents inversion.
 

(6) EXOR gate


The 'Exclusive-OR' gate is a circuit which will give a high
output if either, but not both, of its two inputs are high.
An encircled plus sign ( ) is used to show the EOR
operation.

(7) EXNOR gate


The 'Exclusive-NOR' gate circuit does the opposite to the
EOR gate. It will give a low output if either, but not both,
of its two inputs are high. The symbol is an EXOR gate
with a small circle on the output. The small circle
represents inversion.
 

Boolean algebra
• George Boole (1815-1864) developed an algebra
know an as the Boolean algebra

• Boolean functions may be practically implemented by


using electronic gates.

• To examine a given set of propositions (statements)


with a view to checking their logical consistency &
simplifying them by removing redundant statements
or clauses.

• Example: Kamal is a clever student and he passes


exams well

Kamal is a clever student He passes exams well


0 (FALSE) 0 (FALSE)
1 (TRUE) 1 (TRUE)

Some Boolean Algebraic Rules


Boolean addition
 
 0+0 = 0
 0+1 = 1
 1+0 = 1
 1+1 = 1

Boolean multiplication
 
 0.0 = 0
 0.1 = 0
 1.0 = 0
 1.1 = 1

Boolean Theorem
• Commutative Law: In terms of the result, the order in
which variables are ORed or ANDed makes no
difference.
• Associative Law: When ORing or ANDing more than
two variables, the result are the same regardless of
the grouping of the variables.

• Distributive Law: A common variable can be


factored from an expression just as in ordinary
algebra.

• Basic Rules

AB + AC = A(B+ C)
11. A + AB = A + B

Universal Gates

• NAND and NOR gates are known as Universal gates


because all logic gates can be represented by NAND
and NOR
• NAND and NOR are the cheapest and smallest to
manufacture in Integrated Circuits compared to AND
and OR
• Therefore NAND and NOR are almost always used in
practical circuit design

You might also like