BOOLEAN ALGEBRA
I N T R O D U C T I O N
What Is Boolean Algebra ?
Boolean algebra is a mathematical system for the manipulation of variables that can have one of two values. In formal logic, these values are “true” and “false.” In digital systems, these values are “on” and “off,” 1 and 0,or “high” and “low.”
I N V E N T O R
Boolean algebra was introduced by George_Boole in his first book The Mathematical Analysis of Logic (1847), and set forth more fully in his An Investigation of the Laws of Thought (1854)

Rules In Boolean Algebra
Following are the important rules used in Boolean Algebra
Variable used can have only two values. Binary 1 for HIGH and Binary 0 for LOW. Complement of a variable is represented by an overbar −. Thus, complement of variable B is represented as = 0. ORing of the variables is represented by a plus + sign between them.for example ORing of A, B, C is represented as A+B+C . Logical ANDing of the two or more variable is represented by writing a dot between them such as A.B.C. Sometime the dot may be omitted like ABC
.
B O O L E A N L O G I C O P E R A T I O N S
The Basic logical Operations are ;
Logical AND Operations
The Logical AND operations of two Boolean variables A&B, given as Y= A.B, is represented by the following table . The common symbol for this operation is the multiplication sign (.). The Following Truth table Shows
that the Result of the AND operation on the variables A & B is 1(HIGH) when both A & B are 1 (HIGH)
The truth table of Logical AND Operation between two variables( A & B ) is shown below -
Logical OR Operation
The Logical OR operations of two Boolean variables A & B, given as Y= A+B, is represented by the following truth table. The common symbol for this operation is the plus sign (.+). The table shows that the result of the OR operation on the variables A & B is Logical 1(HIGH) when A or B or both are Logical 1(HIGH) .
The truth table of Logical OR Operation between two variables( A & B ) is shown below.
Logical NOT Operation
The Logical NOT operation converts the Logical 1 to the Logical 0 and vice versa. The symbol used for this operation is a bar over the variable. Several notation such as adding asterisk, a star, prime etc. over the variable are used to indicate the NOT operation. NOT A or complement of A is represented by ¯𝐴.
The truth table of Logical NOT Operation is shown below
B O O L E A N L A W S
Commutative law
Any binary operation which satisfies the following expression is referred to as commutative operation .
Commutative law states that changing the sequence of the variables does not have any effect on the output of a logic circuit.
Associative law
This law states that the order in which the logic operations are performed is irrelevant as their effect is the same.
Distributive law
The Boolean multiplication is distributive over Boolean addition , given by
The Boolean addition is distributive over Boolean multiplication , given by
Absorption Laws
Absorption law involves in linking of a pair of binary operations.
i. A+AB = A i ) proof
ii. A(A+B) = A ii ) Proof
iii. A+ĀB = A+B
iv. A.(Ā+B) = AB
Consensus Law


Other Boolean Laws
Principal of Duality
From the above properties and laws of Boolean algebra, it is evident that they are grouped in pairs as (a) and (b). One expression can be obtained from the other in each pair by replacing every 0 with 1, every 1 with 0, every (+) with (.), and every (.) with (+).
Any pair of expression satisfying this property is called dual expression. This characteristic of Boolean algebra is called the principle of duality
.
example – Dual of A.(B+C) = A+(B.C)
A+0=A , A.1=A
DEMORGAN’S THEOREM
Two theorems that are an important part of Boolean algebra were proposed by DeMorgan.
The first theorem states that the complement of a product is equal to the sum of the complements. That is, if the variables are A and B, then,
The second theorem states that, the complement of a sum is equal to the product of the complements. That is:
DeMorgan’s theorem can be proved by algebraic method as follows:
According to the first theorem,
, is the complement of AB.
As we know from Boolean laws:
(A+¯𝑨) = 1 ………… 4( a)
And
A.¯𝑨 = 0 …………… 4 ( b)
Thus DeMorgan’s first theorem is proved algebraically
Now substituting (A+B) for A and (¯𝑨.¯𝑩) for ¯𝑨
, in the above Boolean expressions (a) and (b),
Thus, DeMorgan’s second theorem is proved algebraically.
Application of Boolean Algebra
EXAPMPLE
There are three switches namely S1,S2 & S3 which control two lamps L1 & L2 . When the switches are all ON , both the lamps L1 & L2 both are glow , when S1 = S2 = ON , and S3 = OFF ,Lamp L2 glows and L1 is OFF, when S1 = S3 = OFF and S2 = ON , Lamp L1 Glows and L2 is OFF and for the rest of the
switches combination ,both the Lamps are OFF .We Wrote a truth table to,
obtain the minimized Boolean expression for both the Lamps.
Now from Boolean algebra we make truth table i.e
NOW what is SOP and POS ?
SOP & POS
PRODUCT TERM
The AND (.)function is Refered to as Product .
Example – A.B.C
SUM TERM
An OR Function (+) is Generally used to refer a sum.
Example – A+B+C
SUM OF PRODUCT ( SOP )
The Logical SUM of two or more logical PRODUCT terms , is called a sum of products expression ; it is basically an OR operation of AND operated Variables Such as
Y = AB+BC+AC
PRODUCT OF SUM ( POS )
The Logical PRODUCT of two or more logical SUM terms , is called a product of sum expression ; it is basically an AND operation of OR operated Variables Such as
Y = ( A+B )(B+C)(C+A)
NOW WHAT IS KARNAUGH MAP or K-NAM ?
KARNAUGH MAP
The simplification of the switching functions using Boolean Laws and Theorem become complex with the increase in the number of variables & terms . The k-map technique provides systematic method for simplifying and manipulating switching expression.
K-MAP for two ,three & four variables are shown in figures
A solution of K map using Four variables
K-map for 4 variables
F(P,Q,R,S)=∑(0,2,5,7,8,10,13,15)

From red group we get product term—QS
From green group we get product term—Q’S’
Summing these product terms we get - Final expression (QS+Q’S’)
*i.e the basics only. Latter we discuss every topic in depth.
...................................................................................................................................................................
...................................................................................................................................................................



















