Variable Entrant Map (VEM) in Digital Logic
Last Updated : 10 Apr, 2025
K-map is the best manual technique to solve Boolean equations but it becomes difficult to manage when number of variables exceed 5 or 6. So, a technique called Variable Entrant Map (VEM) is used to increase the effective size of k-map. It allows a smaller map to handle large number of variables. This is done by writing output in terms of input.
Minimization Procedure for VEM
Now, let's see how to find SOP expression if a VEM is given.
- Write all the variables (original and complimented forms are treated as two different variables) in the map as 0, leave 0's, minterms and don't cares as it is and obtain the SOP expression.
- Select one variable and make all occurrences of that variable as 1, write minterms (1's) as don't cares, leave 0's and don't cares as it is. Now, obtain the SOP expression.
- Multiply the obtained SOP expression with the concerned variable.
- Repeat step 2 for all the variables in the k-map.
- SOP of VEM is obtained by taking OR of all the obtained SOP expressions.
Let's apply the above procedure on a sample VEM (X is used to represent don't care):
Step 1:
Write all the variables as 0 (D and D' are considered as two different variables), leave minterms, 0's and don't cares as it is and obtain the SOP expression. D and D' are considered distinct variables because VEM treats complemented and non-complemented forms as independent variables to help simplify the Boolean expression.
SOP obtained: A'C
Step 2:
(a) Replace all occurrences of D with 1, all occurrences of D' with 0 and all 1's with don't care. Leave 0's and don't cares as it is.
(b) Multiply the obtained SOP with the concerned variable.
SOP obtained: AC'D
Step 3:
Repeat step 2 for D' (the complement of D).
(a) Replace all occurrences of D' with 1, all occurrences of D with 0 and all 1's with don't care. Leave 0's and don't cares as it is.
(b) Multiply the obtained SOP with the concerned variable.
SOP obtained: CD'
Step 4:
SOP of VEM is obtained by taking logical OR of all the obtained SOP expressions. Therefore, the SOP expression for the given VEM is:
A'C + AC'D + CD'
Solved Example of Variable Entrant Map (VEM)
A 3-variable function can be defined as a function of 2-variables if the output is written in terms of third variable. Consider a function
F(A,B,C) = (0,1,2,5)
If we define F in terms of 'C', then this function can be written as:
And the VEM for this is:
Advantages of using VEM
- A VEM can be used to plot more than 'n' variables using an 'n' variable K-map.
- It is commonly used to solve problems involving multiplexers.
- It is applied in digital circuit testing and fault analysis.
- VEM is useful in designing multiplexers, decoders, and Programmable Logic Arrays (PLAs).
Similar Reads
Introduction of Logic Gates In Boolean Algebra, there are three basic operations, +,\:.\:,\:^\prime which are analogous to disjunction, conjunction, and negation in propositional logic . Each of these operations has a corresponding logic gate. Apart from these, there are a few other logic gates as well. It was invented by Geor
9 min read
Properties of Boolean Algebra The Boolean Algebra uses sets of rules for analyzing digital gates and circuits. In this article, we will be going through the Properties or Laws of the Boolean algebra. So first we will start our article by defining what are the properties of Boolean Algebra, and then we will go through what are Bo
7 min read
Minimization of Boolean Functions Boolean functions are used to represent logical expressions in terms of sum of minterms or product of maxterms. Number of these literals (minterms or maxterms) increases as the complexity of the digital circuit increases. This can lead to large and inefficient circuits. By minimizing Boolean functio
4 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 ContentWhat are Boolean Functions?Definition of Boolean FunctionsRepresentation of Boolean Functi
10 min read
Canonical and Standard Form Canonical Form - In Boolean algebra, the Boolean function can be expressed as Canonical Disjunctive Normal Form known as minterm and some are expressed as Canonical Conjunctive Normal Form known as maxterm. In Minterm, we look for the functions where the output results in "1" while in Maxterm we loo
6 min read
Functional Completeness in Digital Logic Functional Completeness is a crucial concept in digital logic design. A set of logical operators is functionally complete if it can be used to express any Boolean function. This means that any logical operation, regardless of complexity, can be constructed using only operators from a functionally co
6 min read
Introduction of K-Map (Karnaugh Map) In many digital circuits and practical problems, we need to find expressions with minimum variables. We can minimize Boolean expressions of 3, 4 variables very easily using K-map without using any Boolean algebra theorems. It is a tool which is used in digital logic to simplify boolean expression. I
5 min read
Various Implicants in K-Map An implicant can be defined as a product/minterm term in Sum of Products (SOP) or sum/maxterm term in Product of Sums (POS) of a Boolean function. For example, consider a Boolean function, F = AB + ABC + BC. Implicants are AB, ABC, and BC. There are various implicant in K-Map listed below :Prime Imp
5 min read
PDNF and PCNF in Discrete Mathematics PDNF (Principal Disjunctive Normal Form)It stands for Principal Disjunctive Normal Form. It refers to the Sum of Products, i.e., SOP. For eg. : If P, Q, and R are the variables then (P. Q'. R) + (P' . Q . R) + (P . Q . R') is an example of an expression in PDNF. Here '+' i.e. sum is the main operato
4 min read
Variable Entrant Map (VEM) in Digital Logic K-map is the best manual technique to solve Boolean equations but it becomes difficult to manage when number of variables exceed 5 or 6. So, a technique called Variable Entrant Map (VEM) is used to increase the effective size of k-map. It allows a smaller map to handle large number of variables. Thi
3 min read