SAT-Based Generation of Optimum Circuits with Polymorphic Behavior Support
| Autor: | Vaclav Simek, Jan Schmidt, Ivo Halecek, Petr Fiser |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Computer science
0102 computer and information sciences 02 engineering and technology General Medicine 01 natural sciences Satisfiability 020202 computer hardware & architecture Logic synthesis 010201 computation theory & mathematics Hardware and Architecture 0202 electrical engineering electronic engineering information engineering Electrical and Electronic Engineering Arithmetic Boolean function Electronic circuit |
| Zdroj: | Journal of Circuits, Systems and Computers. 28:1940010 |
| ISSN: | 1793-6454 0218-1266 |
| DOI: | 10.1142/s0218126619400103 |
| Popis: | This paper presents a method for generating optimum multi-level implementations of Boolean functions based on Satisfiability (SAT) and Pseudo-Boolean Optimization (PBO) problems solving. The method is able to generate one or enumerate all optimum implementations, while the allowed target gate types and gates costs can be arbitrarily specified. Polymorphic circuits represent a newly emerging computation paradigm, where one hardware structure is capable of performing two or more different intended functions, depending on instantaneous conditions in the target operating environment. In this paper we propose the first method ever, generating provably size-optimal polymorphic circuits. Scalability and feasibility of the method are documented by providing experimental results for all NPN-equivalence classes of four-input functions implemented in AND–Inverter and AND–XOR–Inverter logics without polymorphic behavior support being used and for all pairs of NPN–equivalence classes of three-input functions for polymorphic circuits. Finally, several smaller benchmark circuits were synthesized optimally, both in standard and polymorphic logics. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|