The quinemccluskey-minimization's discuss from 0110g

0110g / quinemccluskey-minimization Goto Github PK

View Code? Open in Web Editor NEW

Minimization of boolean expressions is one of the fundamental aspects of Digital Design. This task was revolutionized by the QuineMccluskey technique. This repo contains C++ code used to minimize boolean functions through this technique. The implementation has been designed only for non Don't care type expressions.

C++ 100.00%

quinemccluskey-minimization's Issues

Subscript out of range

when debugged with VisualStudio an assertion failure on "subscript out of range" in

QuineMccluskey-Minimization/QuineMcCluskey.cpp

Line 87 in ff513c3

trackRecord[i] = true;

I've changed the main because I couldn't be bothered to use the command-line.

	int main() {
		const int numberOfBits = 4;
		std::vector<int> minTerms;
		minTerms.push_back(0b0000);
		minTerms.push_back(0b0010);
		minTerms.push_back(0b0011);
		minTerms.push_back(0b0100);
		minTerms.push_back(0b0101);
		minTerms.push_back(0b0110);
		minTerms.push_back(0b0111);
		minTerms.push_back(0b1000);
		minTerms.push_back(0b1001);
		minTerms.push_back(0b1010);
		minTerms.push_back(0b1011);
		minTerms.push_back(0b1100);
		minTerms.push_back(0b1101);

		numberOfMinTerms = minTerms.size();

		sort(minTerms.begin(), minTerms.end());		// Sorting neccessary for -	
						// ImplicantTable() to work
	[rest unchanged]

Question: this this bug also occur on your setup?

Recommend Projects