ootsoo Posted August 18, 2005 Share Posted August 18, 2005 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. Link to comment Share on other sites More sharing options...
ootsoo Posted August 18, 2005 Author Share Posted August 18, 2005 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 Link to comment Share on other sites More sharing options...
dman Posted August 18, 2005 Share Posted August 18, 2005 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 Link to comment Share on other sites More sharing options...
egrath Posted August 20, 2005 Share Posted August 20, 2005 Hi,like in many other cases, google is your friend when searching for information like this....http://www.asic-world.com/digital/boolean2.htmlIt'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 Link to comment Share on other sites More sharing options...
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now