Loading...
Please wait, while we are loading the content...
Similar Documents
Combinatorial objects and combinational circuit synthesis.
| Content Provider | CiteSeerX |
|---|---|
| Author | Tarau, Paul |
| Abstract | The paper revisits exact combinational circuit synthesis with logic programming tools. Our focus is finding a minimal cost circuit that matches a specification- a notoriously hard nondeterministic search problem. After an exhaustive expressiveness comparison of various minimal libraries, two asymmetrical operations, Logical Implication “⇒ ” and Strict Boolean Inequality “< ” turn out to consistently outperform their more popular symmetrical couterparts NAND and NOR, while having comparably small transistor count implementations. The code of the synthetizer and various libraries is available at |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Hard Nondeterministic Search Problem Various Minimal Library Asymmetrical Operation Small Transistor Count Implementation Popular Symmetrical Couterparts Nand Exact Combinational Circuit Synthesis Exhaustive Expressiveness Comparison Strict Boolean Inequality Various Library Minimal Cost Circuit Combinational Circuit Synthesis Logic Programming Tool Combinatorial Object Logical Implication |
| Content Type | Text |