[url removed, login to view] an algorithm to implement factoring of SOP forms (see notes in attachment). The algorithm should include literal minimization.
2. Write a simple routine to parse simple Boolean expressions and generate a
database for input to the tools you have been developing. The syntax is:
( ) parenthesis
For example, your program should parse expressions such as:
Z = A*C' + A*(E + F')*(G + H)*D*F + (A*J)*G
Your program should parse multiple expressions.
[url removed, login to view] all your algorithms together
[e.g. logic minimization (you don't have to do this algorithm, I can send you later), factoring, etc.] with the parser, and add any
features you feel are needed (e.g. high effort - run Q-M, medium effort -
run espresso, allow multi-level - run factoring, constrain max number of
levels, constrain fanin/fanout, etc.). In other words, you design the
optimization tool package allowing the flexibility you would expect as a
user. One thing you want to consider is what you expect to see as the output
(e.g. gate list/count, fanin/fanout, gate signal name assignment, etc.). In
other words, a person should be able to look at the output and draw the
Finally, if you want to include features such as conversion to XOR that's OK.
2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request.
3) Exclusive and complete copyrights to all work purchased. (No GPL, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site).