Scribd
Upload
76 views

Boolean Logic & Logic Circuit

This document provides an introduction to Boolean logic and logic circuits. It defines binary decisions and logical statements that can be determined as true or false. Truth tables are introduced as a way to represent all possible values and results of logical variables or statements. The basic logical operations of AND, OR, and NOT are explained along with their truth tables. Boolean algebra laws and theorems like DeMorgan's law and distributive law are discussed. Finally, common logic gates like AND, OR, NOT, XOR, NAND are described and how logic circuits can be built to perform complex logical functions.

Uploaded by

8D Audio Tune
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
76 views

Boolean Logic & Logic Circuit

This document provides an introduction to Boolean logic and logic circuits. It defines binary decisions and logical statements that can be determined as true or false. Truth tables are introduced as a way to represent all possible values and results of logical variables or statements. The basic logical operations of AND, OR, and NOT are explained along with their truth tables. Boolean algebra laws and theorems like DeMorgan's law and distributive law are discussed. Finally, common logic gates like AND, OR, NOT, XOR, NAND are described and how logic circuits can be built to perform complex logical functions.

Uploaded by

8D Audio Tune
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 36

BOOLEAN LOGIC & LOGIC CIRCUIT

Objectives
• Introduction to Boolean
Logic

• Truth Table

• Logic gates.
• Logic circuits
Introduction to Boolean Logic
Everyday we have to make logical decision:
• Should I carry the book or not?
• Should I use the calculator or not
• Should I miss TV programme or not
Each of thee questions requires a YES or NO answer
as there are only one possible answers.
Therefore each of the above mentioned is a Binary
decision.

Definition: The decision which result into either YES


(TRUE) or No (FALSE) is called Binary Decision.
Binary decisions making also applies to formal logic
For example:
1. Indira Gandhi was the only woman PM of India
2. 13-2=11
3. Delhi is the biggest state in India
4. What do you say?
5. What did I tell you yesterday?

1st and 2nd sentences are TRUE but 3rd is FALSE , 4th and 5th are
question which can not be answered in TRUE or FALSE.

Thus sentences which can be determined to be true or false


are called Logical statements or truth function and the result
TRUE or FALSE are called truth values.

The variable which can store these truth values are called
logical variables.
What is Truth Table

A Truth Table is a table which


represents all the possible values
of logical variable / statement
along with all the possible
results of the given
combinations of values.
Example

Truth Table for logical AND operation.

Input Input Output


A B C
0 0 0
0 1 0
1 0 0
1 1 1
Basic concepts of Boolean Logic

 It deals with the binary number system


(0,1).

 The three basic logical operations are:


I.AND

II.OR

III.NOT
AND Operation

AND operation is use for logical multiplication.


The dot symbol (“.”) used for representing AND
operation. AND operator has an output 1 if all the
inputs are 1 otherwise the output is 0.

Input Input Output


A B C
0 0 0
0 1 0
1 0 0
1 1 1

Truth Table for logical AND operation.


OR Operation

OR operation is use for logical addition. The


symbol (“+”) used for represent OR operation. OR
operator has an output 1 if any of the inputs are 1
otherwise the output is 0.

Input Input Output


A B C
0 0 0
0 1 1
1 0 1
1 1 1

Truth Table for logical OR operation.


NOT Operation

NOT operation is use for complementation.


The over bar symbol (“¯”) used for represent NOT
operation. NOT operator has an output 1 if input
is 0 or output 0 if the the input is 1.

Input Output
_
A A

0 1
1 0

Truth Table for logical NOT operation.


Boolean Theorems

Basic Theorems:- Other Theorems:-


OR AND NOT
Demorgan’s Law
_
A+0=A A.0=0 A+A=1 • (X.Y)' = X' + Y'
_ • (X+Y)' = X' . Y'
A+1=1 A.1=A A . A=0
Distributive Law
A+A=A A . A=A • A+(B+C)=(A+B)+C
_
_
A . A=0
• A+B . C=(A+B).(A+C)
A+A=1
Boolean Logic Law and Rules in Detail
Boolean Boolean Algebra
Boolean Logic Expression Law or Rule
rules A + 1 =1 Properties of 0 and 1
Boolean Algebra is A + 0 =A Properties of 0 and 1
the mathematics we A . 1 =A Properties of 0 and 1
use to analyse digital
A . 0 =0 Properties of 0 and 1
gates and circuits.
A + A =A Idempotent
We can use these
A . A =A Idempotent
“Laws of Boolean” to
both reduce and A + A' = 1 Complement
simplify a complex
A . A' = 0 Complement
Boolean expression
A+B = B+A Commutative
in an attempt to
A.B = B.A Commutative
reduce the number of
(A+B)' = A' . B' de Morgan’s Theorem
logic gates required.
(A.B)' = A' + B' de Morgan’s Theorem
Boolean Function
Boolean function is an expression formed with
binary variable. It is the combination of
Boolean operators such as AND, OR & NOT
operators.

Truth table for Boolean function.


DeMorgan’s Law

1. (X.Y)' = X' + Y'


2. (X+Y)' = X' . Y'
(X.Y)' = X' + Y'

X Y X.Y (X.Y)' X' Y' X' + Y'

0 0 0 1 1 1 1
0 1 0 1 1 0 1
1 0 0 1 0 1 1
1 1 1 0 0 0 0
(X+Y)' = X' . Y'

X Y X+Y (X+Y)' X' Y' X' . Y'

0 0 0 1 1 1 1
0 1 1 0 1 0 0
1 0 1 0 0 1 0
1 1 1 0 0 0 0
Distributive Law

1.X(Y+Z)=XY+XZ

2.X+YZ=(X+Y)(X+Z)
1.X(Y+Z)=XY+XZ
X Y Z Y+Z XY XZ X(Y+Z) XY+XZ
0 0 0 0 0 0 0 0
0 0 1 1 0 0 0 0
0 1 0 1 0 0 0 0
0 1 1 1 0 0 0 0
1 0 0 0 0 0 0 0
1 0 1 1 0 1 1 1
1 1 0 1 1 0 1 1
1 1 1 1 1 1 1 1
Both the columns X(Y+Z) and XY+XZ are identical,
hence it is proved.
2. X+YZ=(X+Y)(X+Z)
X Y Z YZ X+YZ X+Y X+Z (X+Y)(X+Z)
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
Logic Gate
 Computer carries out all operations by the
combination of signals that pass through standard
blocks of built-in circuits.

 Logic gate is an elementary building block of digital


electronic circuits that operates one or more input
signals to produce standard output signal.

 The common use of logic gate elements is to act as


switch.
 In computer logic gates are use to implement
Boolean functions.
Type of Logic Gates
BASIC
GATES

AND
OR
NOT
AND Gate

o AND gate is use for logical multiplication


input signals.

o If the input values for an AND gate are 1 then


the output is 1 otherwise the output is 0.
OR Gate

 OR gate performs the logical addition operation.

 It is an electronic circuit that generates an

output signal 1 if any of the input signal is 1.


NOT Gate

NOT gate performs the logical


complementation operation.

It is an electronic circuit that generates the


reverse of the input signal as output signal.
XOR
NAND Gates
Logic Circuits
An electronic circuit that is consist with a number of
logic gates which is use in computer to perform
logical operation on its two or more input signals
to produce a combined standard output signal.

X X+Y
Y
Z.(X+Y)
Z
Z

Logic circuit for Boolean expression Z.(X+Y)


ANSWER
Q1.Draw the circuit diagram for the
following expression

Y=ab + b'c + c'a'


Output
Q2.Write the equivalent Boolean
Expression for the logical Circuit
Answer

UV' + U'W'
Conclusion

Boolean algebra simplifies logic circuits to increase


work efficiency of digital device.

Logic circuits can be built for any binary electric or


electronic devices.

circuits that perform complex logical functions .

A computer can perform its logical functions along


with proper execution of other commands.

You might also like