乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T17:27:25Z","timestamp":1732037245157},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"S3","license":[{"start":{"date-parts":[[2018,1,31]],"date-time":"2018-01-31T00:00:00Z","timestamp":1517356800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["619 61572109","11371003"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10586-018-1787-x","type":"journal-article","created":{"date-parts":[[2018,1,31]],"date-time":"2018-01-31T05:19:31Z","timestamp":1517375971000},"page":"7491-7506","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An efficient NPN Boolean matching algorithm based on structural signature and Shannon expansion"],"prefix":"10.1007","volume":"22","author":[{"given":"Juling","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Guowu","family":"Yang","sequence":"additional","affiliation":[]},{"given":"William N. N.","family":"Hung","sequence":"additional","affiliation":[]},{"given":"Yan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jinzhao","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,31]]},"reference":[{"issue":"6","key":"1787_CR1","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1109\/TCAD.2009.2016547","volume":"28","author":"G Agosta","year":"2009","unstructured":"Agosta, G., Bruschi, F., Pelosi, G., Sciuto, D.: A transform-parametric approach to Boolean matching [J]. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 28(6), 805\u2013817 (2009)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"1787_CR2","unstructured":"Wei, Z., Chai, D., Newton, A.R., Kuehimann, A.: Fast Boolean matching with don\u2019t cares [C]. In: International Symposium on Quality Electronic Design, pp. 347\u2013351. IEEE (2006)"},{"key":"1787_CR3","doi-asserted-by":"crossref","unstructured":"Abdollahi, A.: Signature based Boolean matching in the presence of don\u2019t cares [C]. Design Automation Conference, pp. 642\u2013647. IEEE (2008)","DOI":"10.1145\/1391469.1391635"},{"key":"1787_CR4","doi-asserted-by":"crossref","unstructured":"Lai C F, Jiang J H R, Wang K H. BooM: a decision procedure for Boolean matching with abstraction and dynamic learning[C]. In: Design Automation Conference, pp. 499\u2013504. IEEE (2010)D","DOI":"10.1145\/1837274.1837398"},{"key":"1787_CR5","unstructured":"Damiani, M., Selchenko, A.Y.: Boolean technology mapping based on logic decomposition [C]. In: Proceedings of the 16th Symposium on Integrated Circuits and Systems Design, IEEE Computer Society (2003)"},{"issue":"6","key":"1787_CR6","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1109\/TCAD.2008.923256","volume":"27","author":"A Abdollahi","year":"2008","unstructured":"Abdollahi, A., Pedram, M.: Symmetry detection and Boolean matching utilizing a signature-based canonical form of Boolean functions [J]. IEEE Trans. Comput. Aided De. Integr. Circuits Syst. 27(6), 1128\u20131137 (2008)","journal-title":"IEEE Trans. Comput. Aided De. Integr. Circuits Syst."},{"key":"1787_CR7","doi-asserted-by":"crossref","unstructured":"Wang, K.H.: Exploiting k-distance signature for Boolean matching and G-symmetry detection [C]. In: Design Automation Conference, ACM\/IEEE, pp. 516\u2013521 (2006)","DOI":"10.1145\/1146909.1147045"},{"key":"1787_CR8","unstructured":"Zhang, J.S., Chrzanowska-Jeske, M., Mishchenko, A., et al.: Generalized symmetries in Boolean functions: fast computation and application to Boolean matching [C]. In: IWLS, pp. 424\u2013430 (2004)"},{"key":"1787_CR9","doi-asserted-by":"publisher","first-page":"27777","DOI":"10.1109\/ACCESS.2017.2778338","volume":"5","author":"J Zhang","year":"2017","unstructured":"Zhang, J., Yang, G., Hung, W.N.N., et al.: A canonical-based NPN Boolean matching algorithm utilizing Boolean difference and cofactor signature [J]. IEEE Access 5, 27777\u201327785 (2017)","journal-title":"IEEE Access"},{"key":"1787_CR10","doi-asserted-by":"crossref","unstructured":"Chai, D., Kuehlmann, A.: Building a better Boolean matcher and symmetry detector [C]. In: Design, Automation and Test in Europe, IEEE, pp. 1\u20136 (2006)","DOI":"10.1109\/DATE.2006.243959"},{"key":"1787_CR11","unstructured":"Debnath, D., Sasao, T.: Efficient computation of canonical form for Boolean matching in large libraries [C]. In: Asia and South Pacific Design Automation Conference, pp. 591\u2013596. IEEE (2004)"},{"key":"1787_CR12","unstructured":"Ciric, J., Sechen C.: Efficient canonical form for boolean matching of complex functions in large libraries [C]. In: International Conference on Computer-Aided Design, pp. 610\u2013617. IEEE (2001)"},{"key":"1787_CR13","doi-asserted-by":"crossref","unstructured":"Huang, Z., Wang, L., Nasikovskiy, Y., Mishchenko, A.: Fast Boolean matching based on NPN classification [C]. In: International Conference on Field-Programmable Technology, pp. 310\u2013313. IEEE (2013)","DOI":"10.1109\/FPT.2013.6718374"},{"key":"1787_CR14","doi-asserted-by":"crossref","unstructured":"Petkovska, A., Soeken, M., Micheli, G.D., Ienne, P., Mishchenko, A.: Fast hierarchical NPN classification [C]. In: International Conference on Field Programmable Logic and Applications, pp. 1\u20134. IEEE (2016)","DOI":"10.1109\/FPL.2016.7577306"},{"key":"1787_CR15","doi-asserted-by":"crossref","unstructured":"Abdollahi, A., Pedram, M.: A new canonical form for fast boolean matching in logic synthesis and verification [C]. In: Design Automation Conference, pp. 379\u2013384. ACM (2005)","DOI":"10.1109\/DAC.2005.193838"},{"key":"1787_CR16","doi-asserted-by":"crossref","unstructured":"Agosta, G., Bruschi, F., Pelosi, G., Sciuto, D.: A unified approach to canonical form-based boolean matching [J], pp. 841\u2013846 (2007)","DOI":"10.1109\/DAC.2007.375281"},{"issue":"3","key":"1787_CR17","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1080\/10655140290011069","volume":"14","author":"CH Chang","year":"2007","unstructured":"Chang, C.H., Falkowski, B.J.: Boolean matching filters based on row and column weights of reed-muller polarity coefficient matrix [J]. VLSI Des. 14(3), 259\u2013271 (2007)","journal-title":"VLSI Des."},{"issue":"10","key":"1787_CR18","doi-asserted-by":"publisher","first-page":"1775","DOI":"10.1587\/transfun.E93.A.1775","volume":"93\u2013A","author":"C Zhang","year":"2010","unstructured":"Zhang, C., Hu, Y., Wang, L., et al.: Accelerating Boolean matching using bloom filter [J]. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93\u2013A(10), 1775\u20131781 (2010)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"6","key":"1787_CR19","first-page":"275","volume":"40","author":"J Bao","year":"2014","unstructured":"Bao, J., Wang, L.: Boolean matching method based on function classification and bloom filter [J]. Comput. Eng. 40(6), 275\u2013280 (2014)","journal-title":"Comput. Eng."},{"issue":"12","key":"1787_CR20","doi-asserted-by":"publisher","first-page":"2894","DOI":"10.1109\/TCAD.2006.882484","volume":"25","author":"Mishchenko Chatterjee","year":"2006","unstructured":"Chatterjee, Mishchenko, Wang, : Reducing structural bias in technology mapping [J]. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25(12), 2894\u20132903 (2006)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"4","key":"1787_CR21","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1109\/LES.2013.2280582","volume":"5","author":"C Yu","year":"2013","unstructured":"Yu, C., Wang, L., Zhang, C., Hu, Y., He, L.: Fast filter-based Boolean matchers [J]. IEEE Embed. Syst. Lett. 5(4), 65\u201368 (2013)","journal-title":"IEEE Embed. Syst. Lett."},{"key":"1787_CR22","unstructured":"Hu, Y., Shih, V., Majumdar, R., He, L.: Exploiting symmetry in SAT-based Boolean matching for heterogeneous FPGA technology mapping [C]. In: IEEE\/ACM International Conference on Computer-Aided Design, pp. 350\u2013353. IEEE (2007)"},{"key":"1787_CR23","doi-asserted-by":"crossref","unstructured":"Matsunaga, Y.: Accelerating SAT-based Boolean matching for heterogeneous FPGAs using one-hot encoding and CEGAR technique [C]. In: Design Automation Conference, pp. 255\u2013260. IEEE (2015)","DOI":"10.1109\/ASPDAC.2015.7059014"},{"issue":"9","key":"1787_CR24","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1109\/43.945303","volume":"20","author":"J Cong","year":"2001","unstructured":"Cong, J., Hwang, Y.Y.: Boolean matching for LUT-based logic blocks with applications to architecture evaluation and technology mapping [J]. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 20(9), 1077\u20131090 (2001)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"1787_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-40970-2_14","volume-title":"Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT [M]","author":"M Soeken","year":"2016","unstructured":"Soeken, M., Mishchenko, A., Petkovska, A., et al.: Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT [M]. Springer, Belin (2016)"},{"key":"1787_CR26","doi-asserted-by":"crossref","unstructured":"Katebi, H., Igor, L.: Large-scale Boolean matching [J]. Advanced Techniques in Logic Synthesis Optimizations & Applications, pp. 771\u2013776 (2010)","DOI":"10.1007\/978-1-4419-7518-8_13"},{"key":"1787_CR27","doi-asserted-by":"crossref","unstructured":"Katebi, H., Sakallah, K.A., Markov, I.L.: Generalized Boolean symmetries through nested partition refinement [C]. In: IEEE\/ACM International Conference on Computer-Aided Design, pp. 763\u2013770. IEEE (2013)","DOI":"10.1109\/ICCAD.2013.6691200"},{"key":"1787_CR28","doi-asserted-by":"crossref","unstructured":"Lai, C.F., Jiang, J.H.R., Wang, K.H.: Boolean matching of function vectors with strengthened learning [C]. In: Proceedings of the International Conference on Computer-Aided Design, pp. 596\u2013601. IEEE Press (2010)","DOI":"10.1109\/ICCAD.2010.5654215"},{"issue":"6","key":"1787_CR29","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1109\/TCAD.2005.855951","volume":"25","author":"JS Zhang","year":"2006","unstructured":"Zhang, J.S., Chrzanowska-Jeske, M., Mishchenko, A., Burch, J.R.: Linear cofactor relationships in Boolean functions [J]. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25(6), 1011\u20131023 (2006)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-018-1787-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-018-1787-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-018-1787-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T17:47:07Z","timestamp":1572889627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-018-1787-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,31]]},"references-count":29,"journal-issue":{"issue":"S3","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["1787"],"URL":"https:\/\/doi.org\/10.1007\/s10586-018-1787-x","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,31]]},"assertion":[{"value":"16 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}