MSFN Forum: Algorithm for conversion to POS - MSFN Forum

Jump to content



Page 1 of 1
  • You cannot start a new topic
  • You cannot reply to this topic

Algorithm for conversion to POS Rate Topic: -----

#1 User is offline   ootsoo 

  • Shinkansen
  • Pip
  • Group: Members
  • Posts: 92
  • Joined: 12-May 05

Posted 18 August 2005 - 03:00 AM

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.


#2 User is offline   ootsoo 

  • Shinkansen
  • Pip
  • Group: Members
  • Posts: 92
  • Joined: 12-May 05

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

#3 User is offline   dman 

  • Friend of MSFN
  • PipPipPipPipPip
  • Group: Members
  • Posts: 717
  • Joined: 01-February 05

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 :no:

#4 User is offline   egrath 

  • Member
  • PipPip
  • Group: Members
  • Posts: 146
  • Joined: 24-May 05

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

Share this topic:


Page 1 of 1
  • You cannot start a new topic
  • You cannot reply to this topic

1 User(s) are reading this topic
0 members, 1 guests, 0 anonymous users



All trademarks mentioned on this page are the property of their respective owners
Copyright © 2001 - 2011 msfn.org
Privacy Policy