- Compare file minimizer full#
- Compare file minimizer code#
Compare file minimizer full#
Do this process type times as if we have n-var k-map and this k-map is full, we need to do comparison n times in order to consider 1 var as -1 in each circle and at last solve this k-map with a full k-map. Consider all these semi-matched values as dashed values. If there are two Binary values matched in type - 1 digits, save this value and consider the different condition = -1. In this step, ones and don't cares are compared by their equivalent binary values one by one: don't care position will be saved as: 0101. Then it's saved in a vector, so if we have a 4-var k-map, its ones' positions are 0,1,3,4 and 11 and its don't care position is 5, this leads to: Then it's converted to its binary equivalent, i.e., its binary representation according to the k-map type. In this step, k-map's type is entered by the user (ones' and don't care's positions). Filtering the comparison result to eliminate unessential terms, take essential ones and provide all possible solutions. Comparing ones' and don't care's positions to get all possible minimums. Setting k-map by getting its information from user (type ones' and don't care's positions) and saving ones' and don't care's positions with its Binary values. A special class is used to implement each: Enter don't-care positions (-1 for stopping). Enter ones' positions (-1 for stopping). To use this program, you need to follow the next steps: 
The reader should have the basics of Boolean algebra and k-map usage in order to get the most benefit from this article.
Compare file minimizer code#
This code provides a C++ program that implements a Karnaugh map (k-map) minimizer with an algorithm that can get a solution for all k-map's types, i.e., for k-maps with any number of variables, but it has been implemented in this program for 26 variables only as much as the number of letters in the English alphabet.
0 kommentar(er)
