Logic design principles with emphasis on testable semicustom circuits
Logic design principles with emphasis on testable semicustom circuits
A note on the formula size of the "mod k" functions
Information Processing Letters
On the depth complexity of the counting functions
Information Processing Letters
Computer arithmetic algorithms
Computer arithmetic algorithms
Shallow circuits and concise formulae for multiple addition and multiplication
Computational Complexity
Evolutionary Computation: The Fossil Record
Evolutionary Computation: The Fossil Record
ACM SIGACT News
A note on designing logical circuits using SAT
ICES'03 Proceedings of the 5th international conference on Evolvable systems: from biology to hardware
Synthesizing shortest linear straight-line programs over GF(2) using SAT
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Finding efficient circuits for ensemble computation
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Optimization principles for arithmetic functions in hardware-software co-design
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
In this paper we report preliminary results of experiments with finding efficient circuits (over binary bases) using SAT-solvers. We present upper bounds for functions with constant number of inputs as well as general upper bounds that were found automatically. We focus mainly on MOD-functions. Besides theoretical interest, these functions are also interesting from a practical point of view as they are the core of the residue number system. In particular, we present a circuit of size 3n + c over the full binary basis computing ${\rm MOD}_3^n$.