Karnaugh map

Karnaugh Map
Download
My Next Work
Boolean Algebra
Screenshots
Documentation
FAQ
Map Examples
Karnaugh Map Tutorial
Links
GuestBook

We will teach your employees about social engineering and computer security. Security solution for your company.

Boolean algebra - minimalization

About history

This program is a software to minimalize logic function by karnaugh map and uses boolean algebra. This software can minimalize, draw, write and convert logic function. We support some PLCs and program can convert logic function to XPRO and HYPEL programs

Minimalization by Karnaugh map

Firstly what you need is to define a numbers of inputs (and outputs) and draw maps, one map for one output. Look at the pictures:

Karnaugh map examples.
A) This map is for 3 inputs
B) This map is for 4 inputs
C) This map is for 5 inputs
For each next input you have to double the map. Maps with 5 and more input variables have a special minimalization (read further).

First easy example

This is our first example: We have a 3 inputs variables and function f=abc+abC (true,true,true and true,true,false). If we want realize this function you can use only one function: f=ab, because the "c" input is not important for our function.

Karnaugh map for 3 variables The trues(1 in bool logic) are on places crossed by the certain fields (a,b,c,...), false(0 in bool logic) is on the others. The 1 on top is on place crossed by 'a','b','c' fields, the 1 below is only 'a' and 'b'.






License

Karnaugh map minimalization software is freeware.