Scribd
Upload
6 views

Boolean Algebra and Hardware

Uploaded by

debanjan.gupta1994
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
6 views

Boolean Algebra and Hardware

Uploaded by

debanjan.gupta1994
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

© Copyright Reserved by Debanjan Gupta

BOOLEAN ALGEBRA AND HARDWARE (LOGIC GATES)

BOOLEAN VARIABLE:
A Boolean variable is same as any other variable used in algebra, the only difference is that it
will either have a value 0 or 1.

LOGICAL OPERATORS:
Boolean Algebra deals with only three types of logical operators namely: AND, OR and NOT
LOGICAL NOT:
This operator provides a complement to a given boolean value. It converts 0 to 1 and 1 to 0.

A A’
0 1
1 0

LOGICAL OR:
This operator results in logical Addition of two binary values. it is represented with (+) sign.

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

LOGICAL AND:
This operator results in product of two binary values. It is represented with (.) sign.

A B A.B
0 0 0
0 1 0
1 0 0
1 1 1
© Copyright Reserved by Debanjan Gupta

REPRESENTING BOOLEAN EXPRESSION WITH A TRUTH TABLE:


Lets consider a Boolean Expression A + (AB +C )’, it can be represented using a truth table as
follows:

A B C AB AB+C (AB+C)’ A+(AB+C)’


0 0 0 0 0 1 1
0 0 1 0 1 0 0
0 1 0 0 0 1 1
0 1 1 0 1 0 0
1 0 0 0 0 1 1
1 0 1 0 1 0 1
1 1 0 1 1 0 1
1 1 1 1 1 0 1

LAWS OF BOOLEAN ALGEBRA:


Just like Mathematical Algebra, Boolean Algebra also uses postulates and laws, in order to
simplify expressions. The postulates are as follows:
a) PROPERTIES OF 0 AND 1
A+1=1 A+0=A

A .0=0 A. 1=A

b) COMPLEMENTARY LAW
A + A’ = 1
A . A’ = 0

c) IDEMTOPENT LAW
A+A=A
A .A=A

d) INVOLUTION LAW
(A’)’ =A

e) COMMUTATIVE LAW
A+B=B+A
A. B=B . A

f) DISTRIBUTIVE LAW
A(B+C) = AB + AC
A+(BC) = (A+B) (A+C)

g) ASSOCIATIVE LAW
A+(B+C)=(A+B)+C A(BC)=(AB)C
© Copyright Reserved by Debanjan Gupta

h) ABSORPTION LAW
A+AB=A
A(A+B)=A

i) DE-MORGAN’S THEOREM
(A+B)’=A’B’
(A.B)’=A’+B’

PRINCIPLE OF DUALITY:
De-Morgan’s theorem supports changing of signs n Boolean expression. Hence, from a given
Boolean Expression one can obtain another Boolean Expression by replacing each (+) with
a (.) and each (.) with a (+), and each 1 with 0, and each 0 with 1. The variables must
remain same during the process. The expression thus obtained is known as a Dual
Expression, and the principle applied is known as Principle of Duality.
Ex:
A+0 = A
Dual : A.1=A

A(A+B)=A
Dual: A+(A.B)=A

COMPUTER HARDWARE
LOGIC GATE:
A logic gate is an integrated circuit which is used to perform logical operations of Boolean
Functions. It accepts two or more input signals and provides only one output signal based on
certain logical operations.

FUNDAMENTAL OF BASIC GATES:

NOT Gate or Inverter:


A logic gate which uses only one input signal and provides a single output signal, which is the
complement of the input signal is known as NOT gate.
© Copyright Reserved by Debanjan Gupta

OR Gate
A logic gate which requires two or more input signals and results in one output signal, which
is the sum of all input signals is termed as an OR gate.

AND Gate
An AND gate produces a single output from a number of input signals which the product of
all the input signals.

DERIVED LOGIC GATES:


These Gates are combinations of Two or more Fundamental Logic Gates.
NOR Gate
This Gate is a combination of OR and NOT gate. It accepts two or more input signals and
gives the complemented sum of the signals as output.
It is also known as an Inverted OR gate.
© Copyright Reserved by Debanjan Gupta

NAND Gate
This Gate is a combination of AND and NOT gate. It accepts two or more signals and gives
the complemented product of the two signals as output. It is also known as Inverted AND
gate.

EXCLUSIVE-OR (XOR) Gate


This gate is the combination of all the three fundamental Gates (AND, OR and NOT). It
results in 0 if the input bit pattern contains even number of 1, and produces 1 if the input
bit contains odd number of 1.
A XOR gate works on the following expression:

A ⊕ B = A’B + AB’
© Copyright Reserved by Debanjan Gupta

EXCLUSIVE NOR- (XNOR) Gate


This is a combination of all the three fundamental logic gates (AND, OR and NOT). It is the
complement of XOR gate.

(A ⊕ B)’ =( A’B + AB’ )’

ADDERS
An Adder is a logical circuit that is used to add two binary digits or binary numbers.
Different types of adders can be designed to add input bits having various bit patterns. The
Adders are basically of two types:
© Copyright Reserved by Debanjan Gupta

HALF ADDER:
Half Adder is a Logic circuit used to add two binary digits. The logic circuit designed for half
adder contains two outputs, one for sum and one for carry.

It is evident from the table, that Sum of the inputs A and B can be obtained by a XOR gate
and carry using a AND gate.

FULL ADDER:
A full adder is a logical circuit used to add three binary digits. It results in sum and carry.

Expression of Sum = A ⊕ B ⊕ C
Expression for Carry = AB + (A⊕B) C

xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx

You might also like