Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The traditional approaches for mu ltilevel logic optimization involve representing Boolean functions in Sum-of-Product forms that are minimized and then factorized in multilevel expressions.  have investigated an alternative approach called graphic synthesis that is based on a set of Reduced and Ordered BDDs, namely a multi-ROBDD for representing Boolean functions. This approach allows the optimization of very high complexity circuits that cannot be synthesized by classical algorithms without applying drastical restrictions.  propose an algorithm for generating a multilevel expression from a BDD and a procedure that optimizes a multi-ROBDD by exploiting Don’t Cares and by searching an input variable ordering for minimizing the final cost of a Boolean network in terms of number of literals.  present results over a range of very high complexity circuits (up to 5.000 gates).
['Luc Burgun', 'N. Dictus', 'Alain Greiner', 'E. Prado Lopes', 'C. Sarwary']
I am writing a research paper on a idea Multilevel logic optimization of very high complexity circuits
[{"from": "human", "value": "I am writing a research paper on a idea Multilevel logic optimization of very high complexity circuits"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The traditional approaches for mu ltilevel logic optimization involve representing Boolean functions in Sum-of-Product forms that are minimized and then factorized in multilevel expressions.  have investigated an alternative approach called graphic synthesis that is based on a set of Reduced and Ordered BDDs, namely a multi-ROBDD for representing Boolean functions. This approach allows the optimization of very high complexity circuits that cannot be synthesized by classical algorithms without applying drastical restrictions.  propose an algorithm for generating a multilevel expression from a BDD and a procedure that optimizes a multi-ROBDD by exploiting Don\u2019t Cares and by searching an input variable ordering for minimizing the final cost of a Boolean network in terms of number of literals.  present results over a range of very high complexity circuits (up to 5.000 gates)."}]