Variable Entrant Map (VEM) in Digital Logic

Last Updated : 21 Jul, 2026

Variable Entrant Map (VEM) is an extension of the Karnaugh Map (K-Map) used to simplify boolean expressions with a large number of variables. Instead of increasing the size of the K-Map, one or more variables are represented inside the cells, allowing larger boolean functions to be minimized efficiently.

  • Produces simpler and more efficient logic circuits.
  • Useful for minimizing large combinational logic functions.
c_ab

Minimization Procedure for VEM

  1. Replace all variable entries with 0, while treating the original and complemented forms as separate variables. Keep the minterms, 0's, and don't care conditions unchanged, then obtain the SOP expression.
  2. Select one variable and replace all its occurrences with 1. Replace its complement with 0, treat all existing 1's as don't cares, and obtain the SOP expression.
  3. Multiply the obtained SOP expression by the selected variable.
  4. Repeat Step 2 and Step 3 for every remaining variable in the VEM.
  5. Combine all the obtained product terms using the OR operation to get the final SOP expression.

Let's apply the above procedure on a sample VEM (X is used to represent don't care):

Step 1:

Replace all variable entries with 0, treating D and D′ as separate variables. Keep the minterms, 0's, and don't care conditions unchanged, then obtain the SOP expression.

SOP obtained: A'C

Step 2:

(a) Replace all occurrences of D with 1 and D′ with 0. Convert all existing 1's to don't care (X), while keeping 0's and existing don't care conditions unchanged.

(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 and D with 0. Convert all existing 1's to don't care (X), while leaving all 0's and existing don't care conditions unchanged.

(b) Multiply the obtained SOP with the concerned variable.

SOP obtained: CD'

Step 4:

Combine all the obtained SOP expressions using the logical OR operation. Therefore, the final SOP expression for the given VEM is:

A'C + AC'D + CD'

Solved Example of Variable Entrant Map (VEM)

Consider the following 3-variable Boolean function:

F(A, B, C) = (0, 1, 2, 5)

VEM_example1-1-240x300

Expressing F in terms of C, we obtain:

VEM_example2-2-300x263

The corresponding Variable Entrant Map (VEM) is shown below:

VEM_kmap1-1-300x300


Advantages

  • Handles More Variables: A VEM can represent more than n variables using an n-variable K-Map.
  • Simplifies Complex Functions: It reduces the complexity of minimizing Boolean expressions with many variables.
  • Useful in Multiplexer Design: VEM is commonly used for designing and simplifying multiplexer-based circuits.
  • Supports Digital Circuit Design: It is useful in the design of decoders, Programmable Logic Arrays (PLAs), and other combinational circuits.
Comment

Explore