{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T04:37:48Z","timestamp":1710391068372},"reference-count":45,"publisher":"World Scientific Pub Co Pte Lt","issue":"supp01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J CIRCUIT SYST COMP"],"published-print":{"date-parts":[[2019,12,1]]},"abstract":"<jats:p> 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\u2013Inverter and AND\u2013XOR\u2013Inverter logics without polymorphic behavior support being used and for all pairs of NPN\u2013equivalence classes of three-input functions for polymorphic circuits. Finally, several smaller benchmark circuits were synthesized optimally, both in standard and polymorphic logics. <\/jats:p>","DOI":"10.1142\/s0218126619400103","type":"journal-article","created":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T02:07:17Z","timestamp":1556244437000},"page":"1940010","source":"Crossref","is-referenced-by-count":2,"title":["SAT-Based Generation of Optimum Circuits with Polymorphic Behavior Support"],"prefix":"10.1142","volume":"28","author":[{"given":"Petr","family":"Fi\u0161er","sequence":"first","affiliation":[{"name":"Faculty of Information Technology, Czech Technical University in Prague, 160 00 Praha 6, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivo","family":"H\u00e1le\u010dek","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology, Czech Technical University in Prague, 160 00 Praha 6, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Schmidt","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology, Czech Technical University in Prague, 160 00 Praha 6, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00e1clav","family":"\u0160imek","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology, Brno University of Technology, 612 66 Brno, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2019,12,12]]},"reference":[{"key":"S0218126619400103BIB001","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147048"},{"key":"S0218126619400103BIB002","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1963.263656"},{"key":"S0218126619400103BIB003","volume-title":"Logic Design and Switching Theory","author":"Muroga S.","year":"1979"},{"key":"S0218126619400103BIB004","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675229"},{"key":"S0218126619400103BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.microrel.2017.12.031"},{"key":"S0218126619400103BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00341-9"},{"key":"S0218126619400103BIB007","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1775"},{"key":"S0218126619400103BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.06.011"},{"key":"S0218126619400103BIB009","series-title":"Frontiers in Artificial Intelligence and Applications","first-page":"825","volume-title":"Handbook of Satisfiability","volume":"185","author":"Barrett C.","year":"2009"},{"key":"S0218126619400103BIB010","doi-asserted-by":"publisher","DOI":"10.1109\/DTIS.2018.8368585"},{"key":"S0218126619400103BIB011","doi-asserted-by":"publisher","DOI":"10.1109\/DSD.2017.74"},{"key":"S0218126619400103BIB012","doi-asserted-by":"publisher","DOI":"10.1038\/nature13570"},{"key":"S0218126619400103BIB015","first-page":"1","volume-title":"Proc. 20th IASTED Int. Conf. Applied Informatics","author":"Stoica A.","year":"2002"},{"key":"S0218126619400103BIB018","first-page":"607","volume":"17","author":"Gajda Z.","year":"2011","journal-title":"J. Mult.- Valued Logic Soft Comput."},{"key":"S0218126619400103BIB020","doi-asserted-by":"publisher","DOI":"10.4236\/jcc.2016.415015"},{"key":"S0218126619400103BIB021","doi-asserted-by":"publisher","DOI":"10.1109\/UKSim.2015.82"},{"key":"S0218126619400103BIB022","doi-asserted-by":"publisher","DOI":"10.1145\/321229.321232"},{"key":"S0218126619400103BIB023","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.1961.1"},{"key":"S0218126619400103BIB024","doi-asserted-by":"publisher","DOI":"10.1147\/rd.62.0227"},{"key":"S0218126619400103BIB025","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1968.227399"},{"key":"S0218126619400103BIB026","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1969.222593"},{"key":"S0218126619400103BIB029","volume-title":"Proc. Int. Workshop Logic & Synthesis (IWLS)","author":"Drechsler R.","year":"1998"},{"key":"S0218126619400103BIB030","doi-asserted-by":"publisher","DOI":"10.1287\/opre.19.4.1090"},{"key":"S0218126619400103BIB031","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1972.5009010"},{"key":"S0218126619400103BIB032","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1976.1674714"},{"key":"S0218126619400103BIB033","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02777-2_5"},{"key":"S0218126619400103BIB034","doi-asserted-by":"publisher","DOI":"10.1109\/DDECS.2017.7934583"},{"key":"S0218126619400103BIB035","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2018.8342027"},{"key":"S0218126619400103BIB036","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2017.2664059"},{"key":"S0218126619400103BIB037","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"S0218126619400103BIB038","first-page":"1","volume":"2","author":"Een N.","year":"2006","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"S0218126619400103BIB039","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1978.1675141"},{"key":"S0218126619400103BIB040","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008647823331"},{"key":"S0218126619400103BIB041","volume-title":"Logic Synthesis and Verification Algorithms","author":"Hachtel G. D.","year":"1996"},{"key":"S0218126619400103BIB042","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2004.1382541"},{"key":"S0218126619400103BIB043","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46419-0_28"},{"key":"S0218126619400103BIB044","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2002.804386"},{"key":"S0218126619400103BIB045","doi-asserted-by":"publisher","DOI":"10.1109\/DTIS.2018.8368583"},{"key":"S0218126619400103BIB046","unstructured":"M. R. Garey and  D. S. Johnson ,  Computers and Intractability: A Guide to the Theory of NP-Completeness,  W. H. Freeman & Co.  (New York,  1990), p.  338."},{"key":"S0218126619400103BIB047","volume-title":"Proc. Fifth Int. Symp. Theory and Applications of Satisfiability Testing (SAT)","author":"Aloul F.","year":"2002"},{"key":"S0218126619400103BIB048","first-page":"103","volume":"2","author":"Manquinho V. M.","year":"2006","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"S0218126619400103BIB049","first-page":"165","volume":"2","author":"Sheini H. M.","year":"2006","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"S0218126619400103BIB050","first-page":"191","volume":"2","author":"Bailleux O.","year":"2006","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"S0218126619400103BIB052","doi-asserted-by":"publisher","DOI":"10.1109\/54.867894"},{"key":"S0218126619400103BIB054","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2460377"}],"container-title":["Journal of Circuits, Systems and Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218126619400103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,13]],"date-time":"2019-12-13T07:16:43Z","timestamp":1576221403000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218126619400103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,1]]},"references-count":45,"journal-issue":{"issue":"supp01","published-print":{"date-parts":[[2019,12,1]]}},"alternative-id":["10.1142\/S0218126619400103"],"URL":"https:\/\/doi.org\/10.1142\/s0218126619400103","relation":{},"ISSN":["0218-1266","1793-6454"],"issn-type":[{"value":"0218-1266","type":"print"},{"value":"1793-6454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,1]]}}}