{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:18:46Z","timestamp":1772893126388,"version":"3.50.1"},"reference-count":28,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2023,9,1]]},"DOI":"10.1587\/transfun.2022eap1103","type":"journal-article","created":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T22:13:44Z","timestamp":1677795224000},"page":"1241-1250","source":"Crossref","is-referenced-by-count":1,"title":["Theory and Application of Topology-Based Exact Synthesis for Majority-Inverter Graphs"],"prefix":"10.1587","volume":"E106.A","author":[{"given":"Xianliang","family":"GE","sequence":"first","affiliation":[{"name":"Graduate School of Information, Production and Systems, Waseda University"}]},{"given":"Shinji","family":"KIMURA","sequence":"additional","affiliation":[{"name":"Graduate School of Information, Production and Systems, Waseda University"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] L. Amar\u00fa, P.E. Gaillardon, and G. De Micheli, \u201cMajority-inverter graph: A new paradigm for logic optimization,\u201d IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol.35, no.5, pp.806-819, 2016. 10.1109\/tcad.2015.2488484","DOI":"10.1109\/TCAD.2015.2488484"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] P. Pan and C.C. Lin, \u201cA new retiming-based technology mapping algorithm for LUT-based FPGAs,\u201d Proc. 1998 ACM\/SIGDA Sixth International Symposium on Field Programmable Gate Arrays, pp.35-42, 1998. 10.1145\/275107.275118","DOI":"10.1145\/275107.275118"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] G. Liu and Z. Zhang, \u201cPIMap: A flexible framework for improving LUT-based technology mapping via parallelized iterative optimization,\u201d ACM Transactions on Reconfigurable Technology and Systems (TRETS), vol.11, no.4, pp.1-23, 2019. 10.1145\/3268344","DOI":"10.1145\/3268344"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] Y. Hamadi, S. Jabbour, and L. Sais, \u201cManySAT: A parallel SAT solver,\u201d Journal on Satisfiability, Boolean Modeling and Computation, vol.6, no.4, pp.245-262, 2010. 10.3233\/sat190070","DOI":"10.3233\/SAT190070"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] G. Katsirelos, A. Sabharwal, H. Samulowitz, and L. Simon, \u201cResolution and parallelizability: Barriers to the efficient parallelization of SAT solvers,\u201d Twenty-Seventh AAAI Conference on Artificial Intelligence, vol.27, no.1, pp.481-488, 2013. 10.1609\/aaai.v27i1.8660","DOI":"10.1609\/aaai.v27i1.8660"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] W. Haaswijk, M. Soeken, A. Mishchenko, and G. De Micheli, \u201cSAT-based exact synthesis: Encodings, topology families, and parallelism,\u201d IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol.39, no.4, pp.871-884, 2019. 10.1109\/tcad.2019.2897703","DOI":"10.1109\/TCAD.2019.2897703"},{"key":"7","unstructured":"[7] E. Testa, M. Soeken, O. Zografos, L. Amaru, P. Raghavan, R. Lauwereins, P.E. Gaillardon, and G. De Micheli, \u201cInversion optimization in majority-inverter graphs,\u201d 2016 IEEE\/ACM International Symposium on Nanoscale Architectures (NANOARCH), pp.15-20, IEEE, 2016. 10.1145\/2950067.2950072"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] E. Testa, O. Zografos, M. Soeken, A. Vaysset, M. Manfrini, R. Lauwereins, and G. De Micheli, \u201cInverter propagation and fan-out constraints for beyond-CMOS majority-based technologies,\u201d 2017 IEEE Computer Society Annual Symposium on VLSI (ISVLSI), pp.164-169, IEEE, 2017. 10.1109\/isvlsi.2017.37","DOI":"10.1109\/ISVLSI.2017.37"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] C.C. Chung, Y.C. Chen, C.Y. Wang, and C.C. Wu, \u201cMajority logic circuits optimisation by node merging,\u201d 2017 22nd Asia and South Pacific Design Automation Conference (ASP-DAC), pp.714-719, IEEE, 2017. 10.1109\/aspdac.2017.7858408","DOI":"10.1109\/ASPDAC.2017.7858408"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] M. Soeken, L.G. Amar\u00f9, P.E. Gaillardon, and G. De Micheli, \u201cOptimizing majority-inverter graphs with functional hashing,\u201d 2016 Design, Automation & Test in Europe Conference & Exhibition (DATE), pp.1030-1035, IEEE, 2016. 10.3850\/9783981537079_0281","DOI":"10.3850\/9783981537079_0281"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] M. Soeken, L.G. Amaru, P.E. Gaillardon, and G. De Micheli, \u201cExact synthesis of majority-inverter graphs and its applications,\u201d IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol.36, no.11, pp.1842-1855, 2017. 10.1109\/tcad.2017.2664059","DOI":"10.1109\/TCAD.2017.2664059"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] L. de Moura and N. Bj\u00f8rner, \u201cZ3: An efficient SMT solver,\u201d International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp.337-340, Springer, 2008. 10.1007\/978-3-540-78800-3_24","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] L. Benini and G. De Micheli, \u201cA survey of Boolean matching techniques for library binding,\u201d ACM Transactions on Design Automation of Electronic Systems (TODAES), vol.2, no.3, pp.193-226, 1997. 10.1145\/264995.264996","DOI":"10.1145\/264995.264996"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] W. Haaswijk, E. Testa, M. Soeken, and G. De Micheli, \u201cClassifying functions with exact synthesis,\u201d 2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL), pp.272-277, IEEE, 2017. 10.1109\/ismvl.2017.44","DOI":"10.1109\/ISMVL.2017.44"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] W. Haaswijk, E. Collins, B. Seguin, M. Soeken, F. Kaplan, S. S\u00fcsstrunk, and G. De Micheli, \u201cDeep learning for logic optimization algorithms,\u201d 2018 IEEE International Symposium on Circuits and Systems (ISCAS), pp.1-4, IEEE, 2018. 10.1109\/iscas.2018.8351885","DOI":"10.1109\/ISCAS.2018.8351885"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] X. Timoneda and L. Cavigelli, \u201cReinforcement learning for scalable logic optimization with graph neural networks,\u201d arXiv preprint arXiv:2105.01755, 2021. 10.48550\/arXiv.2105.01755","DOI":"10.1109\/DAC18074.2021.9586206"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] H. Riener, E. Testa, W. Haaswijk, A. Mishchenko, L. Amar\u00f9, G. De Micheli, and M. Soeken, \u201cScalable generic logic synthesis: One approach to rule them all,\u201d Proc. 56th Annual Design Automation Conference 2019, pp.1-6, 2019. 10.1145\/3316781.3317905","DOI":"10.1145\/3316781.3317905"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] H. Riener, A. Mishchenko, and M. Soeken, \u201cExact DAG-aware rewriting,\u201d 2020 Design, Automation & Test in Europe Conference & Exhibition (DATE), pp.732-737, IEEE, 2020. 10.23919\/date48585.2020.9116379","DOI":"10.23919\/DATE48585.2020.9116379"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] W. Haaswijk, M. Soeken, A. Mishchenko, and G. De Micheli, \u201cSAT based exact synthesis using DAG topology families,\u201d 2018 55Th ACM\/ESDA\/IEEE Design Automation Conference (Dac), pp.1-6, IEEE, 2018. 10.1109\/dac.2018.8465888","DOI":"10.1109\/DAC.2018.8465888"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] A. Mishchenko, S. Cho, S. Chatterjee, and R. Brayton, \u201cCombinational and sequential mapping with priority cuts,\u201d 2007 IEEE\/ACM International Conference on Computer-Aided Design, pp.354-361, IEEE, 2007. 10.1109\/iccad.2007.4397290","DOI":"10.1109\/ICCAD.2007.4397290"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] R. Brayton and A. Mishchenko, \u201cABC: An academic industrial-strength verification tool,\u201d International Conference on Computer Aided Verification, pp.24-40, Springer, 2010. 10.1007\/978-3-642-14295-6_5","DOI":"10.1007\/978-3-642-14295-6_5"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] A. Mishchenko, S. Chatterjee, and R. Brayton, \u201cDAG-aware AIG rewriting: A fresh look at combinational logic synthesis,\u201d 2006 43rd ACM\/IEEE Design Automation Conference, pp.532-535, IEEE, 2006. 10.1145\/1146909.1147048","DOI":"10.1145\/1146909.1147048"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] H. Riener, W. Haaswijk, A. Mishchenko, G. De Micheli, and M. Soeken, \u201cOn-the-fly and DAG-aware: Rewriting boolean networks with exact synthesis,\u201d 2019 Design, Automation & Test in Europe Conference & Exhibition (DATE), pp.1649-1654, IEEE, 2019. 10.23919\/date.2019.8715185","DOI":"10.23919\/DATE.2019.8715185"},{"key":"24","unstructured":"[24] L. Amar\u00fa, P.E. Gaillardon, and G. De Micheli, \u201cThe EPFL combinational benchmark suite,\u201d Proc. 24th International Workshop on Logic & Synthesis (IWLS), 2015."},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] S. Kajihara, K. Kinoshita, I. Pomeranz, and S. Reddy, \u201cCombinationally irredundant ISCAS-89 benchmark circuits,\u201d 1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96, vol.4, pp.632-634, 1996. 10.1109\/iscas.1996.542103","DOI":"10.1109\/ISCAS.1996.542103"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] A. Petkovska, M. Soeken, G. De Micheli, P. Ienne, and A. Mishchenko, \u201cFast hierarchical NPN classification,\u201d 2016 26th International Conference on Field Programmable Logic and Applications (FPL), pp.1-4, IEEE, 2016. 10.1109\/fpl.2016.7577306","DOI":"10.1109\/FPL.2016.7577306"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] W. Haaswijk, M. Soeken, L. Amar\u00fa, P.E. Gaillardon, and G. De Micheli, \u201cA novel basis for logic rewriting,\u201d 2017 22nd Asia and South Pacific Design Automation Conference (ASP-DAC), pp.151-156, IEEE, 2017. 10.1109\/aspdac.2017.7858312","DOI":"10.1109\/ASPDAC.2017.7858312"},{"key":"28","doi-asserted-by":"crossref","unstructured":"[28] Z. Chu, M. Soeken, Y. Xia, L. Wang, and G. De Micheli, \u201cStructural rewriting in XOR-majority graphs,\u201d Proc. 24th Asia and South Pacific Design Automation Conference, pp.663-668, 2019. 10.1145\/3287624.3287671","DOI":"10.1145\/3287624.3287671"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E106.A\/9\/E106.A_2022EAP1103\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T16:57:44Z","timestamp":1729011464000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E106.A\/9\/E106.A_2022EAP1103\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,1]]},"references-count":28,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2022eap1103","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,1]]},"article-number":"2022EAP1103"}}