Is there any algorithm to convert any given boolean expression into minimised "product of sum" format.
Well if it is, then could you please post information about the algorithm and source code in c if available.
Page 1 of 1
Algorithm for conversion to POS
#2
Posted 18 August 2005 - 03:08 AM
There is 'brute force' method for converting any boolean expression to "product of sum" or " sum of product" format. But i need minimized form of any of these two format.
Thanks
Thanks
#3
Posted 18 August 2005 - 09:37 AM
It is not good forum etiquette to ask more questions without acknowledgeing that people have answered your previous question. I don't mean to single you out ootsoo, there are many here that do the same thing. It's not polite
#4
Posted 20 August 2005 - 10:42 AM
Hi,
like in many other cases, google is your friend when searching for information like this....
http://www.asic-worl...l/boolean2.html
It's not a complete Algorithm in C, it's a description of an algorithm performing the thing you want. Should be no problem for write a code around this.
Egon
like in many other cases, google is your friend when searching for information like this....
http://www.asic-worl...l/boolean2.html
It's not a complete Algorithm in C, it's a description of an algorithm performing the thing you want. Should be no problem for write a code around this.
Egon
- ← WSH - non modal dialog box
- Programming (C++, Delphi, VB/VBS, CMD/batch, etc.)
- assigning commandline variables →
Share this topic:
Page 1 of 1



Help
Back to top








