Scribd
Upload
10 views23 pages

Logic Gates and Booleean Algebra

Uploaded by

G mux Gaming
Copyright
© © All Rights Reserved
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
10 views23 pages

Logic Gates and Booleean Algebra

Uploaded by

G mux Gaming
Copyright
© © All Rights Reserved
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
You are on page 1/ 23

Lecture: 4.

Logic Gates and Boolean algebra


Logic gates
Logic gates are the basic building blocks of any digital system. It is an electronic circuit having
one or more than one input and only one output. The relationship between the input and the
output is based on a certain logic. The most basic logic Circuits are OR gates, AND gates, and
invertors or NOT gates. Other logic gates are NAND, NOR, EX-OR, EX-NOR.
Inverter or NOT logic gate

Logic function is the algebraic relationship between the input variables and the output
variable.
A truth table is a table of all possible combinations of the variables, showing the relation
between the values that the variables may take and the result of the operation.
• OR Logic gate

• AND logic gate


• NAND Logic gate

• NOR Logic gate


• EX-OR Logic gate

• EX-NOR Logic gate


Universal Logic gates
• NAND and NOR are known as universal logic gates.
• We can use a NAND and NOR gates to implement all three of the basic operations
(AND,OR,NOT).
• Both NAND and NOR gates are very valuable as any design can be realized using either
one.
• It is easier to build digital circuits using all NAND or NOR gates than to combine AND,OR,
and NOT gates.
• NAND/NOR gates are typically faster and cheaper to produce.
Implementation of other logic gates from NAND
Implementation of other logic gates from NAND
Implementation of other logic gates from NOR
Implementation of other logic gates from NOR
Logic Circuit
• When logic gates are interconnected to form a logic network or circuit, the Boolean algebra
expression for a given logic circuit can be derived by systematically progressing from input
to output on the gates.
Example:

Boolean expression of the output of the circuit is


• Again if a Boolean expression is given, you can implement the expression in a logic circuit
using logic gates.
• Example: Implement the Boolean expression Z= 𝐴ҧ 𝐴 + 𝐵 + (A + B)
Boolean Algebra
• Boolean algebra is the mathematics of digital systems.
• A basic knowledge of Boolean algebra is indispensable to the study and analysis of logic
circuits.
• As in other area of mathematics, there are certain well-defined rules and laws that must
be followed in order to properly apply Boolean algebra.
• Variable, complement and literal are terms used in Boolean algebra.
Example: A Bഥ +(C + B D
ഥ)+AഥB ഥ
Variables: A, B, C, D
Complements: A ഥ ,B
ഥ, D
ഥ (a complement can also be expressed as 𝐵′ )
ഥ, B
Literals: A, B, C, A ഥ,D
ഥ
Laws of Boolean Algebra
The basic Laws of Boolean Algebra can be stated as follows:

• Commutative Law:
(i) OR operator → A + B = B + A
(ii) AND operator → A * B = B * A

• Associative Law:
(i) A * (B * C) = (A * B) * C
(ii) A + (B + C) = (A + B) + C

• Distributive Law:
(i) A + BC = (A + B) (A + C).
(ii) A * (B + C) = (A * B) + (A * C)
Rules of Boolean Algebra

10. A+ AB 11. A+ 𝐴ഥ B 12. (A+ B)(A+ C)


= A(1+B) = (A+ 𝐴ഥ )(A+ B) = AA + AC + AB + BC
=A = A+ B = A + AC + AB + BC = A+BC
De Morgan’s Theorems
De Morgan’s Theorems is important to Boolean logic. They allow us to exchange OR
operation with AND operation and vice versa. Applying these theorems, we can also simplify
Boolean expression in many cases. The two De Morgan’s theorems are

ഥ+B
1. A. B = A ഥ
ഥ .B
2. A + B = A ഥ
The above two theorem can be verified using truth tables
Examples: Apply DeMorgan’s theorems to the following Boolean expressions.

1. 2.

Ans:
For your practice,

1.

2.
Simplification of Boolean function using Boolean Algebra

Example:
1. Simplify

Ans:
2. Use the Rules of Boolean Algebra and simply the Boolean functions
F1(A,B,C) = A’BC’+ A’BC+ AB’C’+ AB’C+ ABC’+ ABC

Ans: F1= A’BC’+ A’BC+ AB’C’+ AB’C+ ABC’+ ABC


= A’B(C’+C) + AB’(C+C’) + AB(C’+C) (C+C’=1)
= A’B +AB’+AB
= A’B + A(B’+B)
= A+A’B
3. F2(A,B,C)= ( AB’ (C + BD) + A’B’ ) C

Ans: ( AB’ (C + BD) + A’B’ ) C


= ( AB’C +AB’BD + A’B’ ) C
= (AB’C +0 + A’B’ ) C as B’B=0
= (AB’C + A’B’ ) C
= AB’CC + A’B’C
= AB’C + A’B’C as CC= C
= (A+A’)B’C
= B’C as A+A’=1
4. Simplify the following Boolean expression using Boolean algebra,

Ans:
Logic Circuit
Logic gates are interconnected to form a logic network or circuit.
Example:

Boolean expression of the output of the circuit is

You might also like