Scribd
Upload
3 views

ppt boolean expression

The document discusses Boolean algebra and its application in electronic circuits, specifically logic gates. It outlines the three basic laws of Boolean algebra, presents truth tables for various operations, and explains the design of half and full adders for binary addition. Additionally, it covers De Morgan's theorems and provides examples of simplifying Boolean expressions using logic gates.

Uploaded by

Nirmala Y N
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
3 views

ppt boolean expression

The document discusses Boolean algebra and its application in electronic circuits, specifically logic gates. It outlines the three basic laws of Boolean algebra, presents truth tables for various operations, and explains the design of half and full adders for binary addition. Additionally, it covers De Morgan's theorems and provides examples of simplifying Boolean expressions using logic gates.

Uploaded by

Nirmala Y N
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/ 21

Boolean algebra

Boolean Algebra applied in computers electronic


circuits. These circuits perform Boolean operations and
these are called logic circuits or logic gates.

Three basic laws of Boolean Algebra

• Commutative law
• Associative law
• Distributive law
Boolean algebra

A B A+B
0 0 0
0 1 1
1 0 1
1 1 1

A B AB
0 0 0
0 1 0
1 0 0
1 1 1
A B C (A+B)+C A B C A(BC)
0 0 0 0 0 0 0 0
0 0 1 1 0 0 1 0
0 1 0 1 0 1 0 0
0 1 1 1 0 1 1 0
1 0 0 1 1 0 0 0
1 0 1 1 1 0 1 0
1 1 0 1 1 1 0 0
1 1 1 1 1 1 1 1
A B C B+C A(B+C) A B C AB AC AB+AC
0 0 0 0 0 0 0 0 0 0 0
0 0 1 1 0 0 0 1 0 0 0
0 1 0 1 0 0 1 0 0 0 0
0 1 1 1 0 0 1 1 0 0 0
1 0 0 0 0 1 0 0 0 0 0
1 0 1 1 1 1 0 1 0 1 1
1 1 0 1 1 1 1 0 1 0 1
1 1 1 1 1 1 1 1 1 1 1
DE-MORGAN’S theorems
Logic diagram

Truth table
• Example1: Realize the Boolean Expression BC + A + (A +
C) using AOI logic.
• Solution: To realize this using the AOI logic gates, we will use the
reverse approach.
Step 1: Our expression BC + A + (A+C) is the summation of three
terms BC, A and, (A+C), thus a 3-input OR Gate must have been
used to obtain the expression as given :0
• Find out the Boolean Expression for Logic Diagram given below
and simplify the output in the minimal expression, also implement
the simplified expression using the AOI logic.

• Following the forward propagation approach, we see that gate G1 is a 2-input AND
Gate having inputs A and B. So, output of G1 will be AB. Similarly, G2 is an OR Gate,
so output of G2 will be (B+C). Also, G3 is an AND Gate and its output will be AB.
• Now, gate G4 is a 2-input OR Gate which has one of its inputs as A and the other one
is the output of gate G1, thus the output of gate G4 will be (A + AB). Similarly,
output for gate G5 and G6 will be (B + BC) and (C + AB) respectively. Now, gate G7
is a 3-input AND Gate, therefore output (Y) of G7 will be equal to (A+AB). (B+BC).
(C+AB)
Therefore, (A+AB). (B+BC). (C+AB)
= A (1 + B). B (1 +C). (C+AB)
= A. B. (C+AB)
= ABC+AB.AB
= ABC+AB
= AB(C+1)
= AB
[Since, 1+B =1 and 1+C =1]
How to add binary numbers
 Consider adding two 1-bit binary numbers A and B
 0+0 = 0
 0+1 = 1
 1+0 = 1 A B Carry Sum
 1+1 = 10
0 0 0 0
0 1 0 1
1 0 0 1
 Carry is A AND B 1 1 1 0
 Sum is A XOR B
 The circuit to compute this is called a half-adder
Half ADDER
• It is a combinational circuit that performs the
addition of two bits,
this circuit needs two binary inputs and two binary
outputs.
s (sum)

c (carry)

x y s c
1 1 0 1
1 0 1 0
0 1 1 0
0 0 0 0
FULL ADDER USING 2 HALF ADDER
THE FULL ADDER
 The full circuitry of the full adder

c
s

x
y
c

19
Full Adder
• It is a combinational circuit that performs the addition of three bits
(two significant bits and previous carry).
• It consists of three inputs and two outputs, two inputs are the bits to be added,
the third input represents the carry form the previous position.

Truth table for the full adder

You might also like