Boolean Algebra was given by George Boole. It is a set of rules used to simplify a given logical expression without changing its functionality. It is mainly used when several variables present are less. The algebraic expression used in Boolean Algebra is known as Boolean Expression and it is used to describe Boolean Function. The Boolean expression generally consists of value 0 or 1, binary variables, and logical operation.
Truth Table Formation
The truth table is a table that comprises all the possible outcomes of a Boolean function used in Boolean algebra. It is used to establish a relation between various variable that contributes to the Boolean function. 1 in the Truth table represents true value and 0 represents false value. Truth Table provides us with an easy method to test whether a given argument is valid or not for legitimate input.
Total no. of combinations = 2n
where, n = no. of variables.
Truth Table for 2 Variables
Total no. of combinations = 22 = 4
A | B | A V B | A Ʌ B | ~A | ~B |
|---|
0 | 0 | 0 | 0 | 1 | 1 |
0 | 1 | 1 | 0 | 1 | 0 |
1 | 0 | 1 | 0 | 0 | 1 |
1 | 1 | 1 | 1 | 0 | 0 |
Methods to Solve Boolean Function
1. Karnaugh-map or K-map
karnaugh-map is used to minimize the number of logic gates that are required in a digital circuit. The cells are arranged in a way so that simplification of a given expression is simply a matter of properly grouping the cells.
SUM OF PRODUCT (SOP)
SOP as the name itself suggests sum of products. It is the sum of all the products where the output is 1. It is denoted by Σ which tells about the minterms 'm'. When two or more terms are multiplied via AND gate and their respective resultants are added with the help of OR gate is defined as Sum Of Products.
In case of SOP, consider the following:
A = 1
A' = 0
Let us understand it with an example.
| A | B | C | Y |
|---|
m0 | 0 | 0 | 0 | 1 |
m1 | 0 | 0 | 1 | 0 |
m2 | 0 | 1 | 0 | 1 |
m3 | 0 | 1 | 1 | 1 |
m4 | 1 | 0 | 0 | 0 |
m5 | 1 | 0 | 1 | 0 |
m6 | 1 | 1 | 0 | 1 |
m7 | 1 | 1 | 1 | 1 |
In SOP, we consider only those expression where value of Y is 1 (high).
SOP = Σ (m0, m2, m3, m6, m7)
= A'B'C' + A'BC' + A'BC + ABC' + ABC
= A'B'C' + BC'(A + A') + BC (A + A')
= A'B'C' + BC' + BC
= A'B'C' + B(C' + C)
= A'B'C' + B
PRODUCT OF SUM (POS)
POS stands for product of sum and it is used when the output is 0. It is denoted by Π which tells about the maxterms 'M'.
It consists of two or more OR gates that are ANDed together.
In case of POS, consider the following:
A = 0
A' = 1
Let us understand it with an example.
| A | B | C | Y |
|---|
M0 | 0 | 0 | 0 | 0 |
M1 | 0 | 0 | 1 | 1 |
M2 | 0 | 1 | 0 | 1 |
M3 | 0 | 1 | 1 | 0 |
M4 | 1 | 0 | 0 | 0 |
M5 | 1 | 0 | 1 | 1 |
M6 | 1 | 1 | 0 | 1 |
M7 | 1 | 1 | 1 | 0 |
POS = Π (M0, M3, M4, M7)
= (A + B + C) . (A + B' + C') . (A + B' + C') . (A' + B' + C')
Example of Karnaugh-map
F( A, B, C) = Σm ( 0, 1, 2, 4, 7)
| A | B | C | F |
|---|
m0 | 0 | 0 | 0 | 1 |
m1 | 0 | 0 | 1 | 1 |
m2 | 0 | 1 | 0 | 1 |
m3 | 0 | 1 | 1 | 0 |
m4 | 1 | 0 | 0 | 1 |
m5 | 1 | 0 | 1 | 0 |
m6 | 1 | 1 | 0 | 0 |
m7 | 1 | 1 | 1 | 1 |
F( A, B, C) = ABC + A'B' + B'C' + A'C'
k-map2. NAND GATES
NAND gate is Negation of the AND gate. It gives the values opposite to the AND gate. It gives the value 0 only when all the inputs are 1. Below is the Truth Table for AND and NAND gate.
A | B | A∧B | ~A∧B |
|---|
0 | 0 | 0 | 1 |
0 | 1 | 0 | 1 |
1 | 0 | 0 | 1 |
1 | 1 | 1 | 0 |
Let us understand solving Boolean functions with the help of NAND gate
F (A, B, C) = ABC + A'B' + B'C' + A'C'
Similar Reads
Number of Boolean functions
In the below article, we are going to find the number of Boolean Functions possible from the given sets of binary number. Statement-1: Suppose two sets are set 'A' = {1, 2, 3, 4, ........, n} where each number will be either '0' or '1' and hence the total number of boolean variable possible will be
2 min read
Even Function
Even function is defined as a function that follows the relation f(-x) equals f(x), where x is any real number. Even functions have the same range for positive and negative domain variables. Due to this, the graph of even functions is always symmetric about the Y-axis in cartesian coordinates. In th
6 min read
ES6 Functions
The ES6 function is the same as a normal function, but ES6 has some differences. A function is a set of instruction that takes some inputs, do some specific task and produce output. A function is a set of codes that can be reused in the program at any time. Syntax: function func-name() { // body } f
6 min read
Python Boolean
Python Boolean type is one of the built-in data types provided by Python, which represents one of the two values i.e. True or False. Generally, it is used to represent the truth values of the expressions. Python Boolean TypeBoolean value can be of two types only i.e. either True or False. The output
7 min read
Minimization of Boolean Functions
As discussed in the "Representation of Boolean Functions" every boolean function can be expressed as a sum of minterms or a product of maxterms. Since the number of literals in such an expression is usually high, and the complexity of the digital logic gates that implement a Boolean function is dire
3 min read
Representation of Boolean Functions
Boolean functions are expressions involving Boolean variables and operators, such as AND, OR, and NOT. These functions are fundamental in digital logic design, computer science, and engineering. Table of Content What are Boolean Functions?Definition of Boolean FunctionsRepresentation of Boolean Func
10 min read
ES6 Boolean
The Boolean of ES6 is nothing different than the other Boolean objects. It also represents two values True or False. There are two properties and three methods that build this object in ES6 JavaScript. Properties of Boolean Object: JavaScript constructor: In ES6 JavaScript, the constructor property
3 min read
Bijective Function
Bijective Function is a special type of function that represents the relationship between two sets in such a way that all elements in the domain have an image in the codomain and each element in the codomain has a pre-image in the domain. Bijective Function is also called one-to-one correspondence d
10 min read
Dart - Boolean
Dart language provides a pre-defined data type called boolean which can store two possible values, either true or false. To declare a boolean variable in Dart programming language, the keyword bool is used. Most commonly, boolean is used in decision-making statements. The syntax for declaring a bool
2 min read
Even and Odd Functions
Functions can be categorized into Even and odd functions based on their symmetry along the axes. Even Functions: An even function remains unchanged when its input is negated( same output for x and -x), reflecting symmetry about the y-axis.Odd Functions: An odd function transforms into its negative w
8 min read