{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:25:01Z","timestamp":1726406701222},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540570912"},{"type":"electronic","value":"9783540479024"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57091-8_30","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:02:17Z","timestamp":1330257737000},"page":"61-70","source":"Crossref","is-referenced-by-count":0,"title":["Patching method for lookup-table type FPGA's"],"prefix":"10.1007","author":[{"given":"Masahiro","family":"Fujita","sequence":"first","affiliation":[]},{"given":"Yuji","family":"Kukimoto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"issue":"8","key":"7_CR1","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R. E. Bryant","year":"1986","unstructured":"R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677\u2013691, August 1986.","journal-title":"IEEE Transactions on Computers"},{"issue":"8","key":"7_CR2","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1109\/TC.1977.1674912","volume":"C-26","author":"E. Cerny","year":"1977","unstructured":"E. Cerny and M. A. Marin. An approach to unified methodology of combinational switching circuits. IEEE Transactions on Computers, C-26(8):745\u2013756, August 1977.","journal-title":"IEEE Transactions on Computers"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"R. Francis, J. Rose, and Z. Vranesic. Chortle-crf: Fast technology mapping for lookup table-based FPGAs. In Proceedings of 28th ACM\/IEEE Design Automation Conference, pages 227\u2013233, June 1991.","DOI":"10.1145\/127601.127670"},{"key":"7_CR4","unstructured":"M. Fujita, T. Kakuda, and Y. Matsunaga. Redesign and automatic error correction of combinational circuits. In Proceedings of the IFIP TC10\/WG10.5 Workshop on Logic and Architecture Synthesis, pages 253\u2013262. North Holland, May 1990."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"M. Fujita, Y. Tamiya, Y. Kukimoto, and K.-C. Chen. Application of Boolean unification to combinational logic synthesis. In Proceedings of IEEE International Conference on Computer-Aided Design, pages 510\u2013513, November 1991.","DOI":"10.1109\/ICCAD.1991.185318"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Y. Kukimoto and M. Fujita. Rectification method for lookup-table type FPGA's. In Proceedings of IEEE\/ACM International Conference on Computer-Aided Design, pages 54\u201361, November 1992.","DOI":"10.1109\/ICCAD.1992.279397"},{"key":"7_CR7","unstructured":"Y. Kukimoto and M. Fujita. Reduction of critical path delay by optimizing Boolean relations. In Proceedings of ACM International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems: Tau92, March 1992."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"R. Murgai, N. Shenoy, R. K. Brayton, and A. Sangiovanni-Vincentelli. Improved logic synthesis algorithms for table look up architectures. In Proceedings of IEEE International Conference on Computer-Aided Design, pages 564\u2013567, November 1991.","DOI":"10.1109\/ICCAD.1991.185333"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"H. Savoj and R. K. Brayton. Observability relations and observability don't cares. In Proceedings of IEEE International Conference on Computer-Aided Design, pages 518\u2013521, November 1991.","DOI":"10.1109\/ICCAD.1991.185320"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"E. M. Sentovich, K. J. Singh, C. Moon, H. Savoj, R. K. Brayton, and A. Sangiovanni-Vincentelli. Sequential circuit design using synthesis and optimization. In Proceedings of IEEE International Conference on Computer Design, pages 328\u2013333, October 1992.","DOI":"10.1109\/ICCD.1992.276282"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Y. Watanabe and R. K. Brayton. Heuristic minimization of multiple-valued relations. In Proceedings of IEEE International Conference on Computer-Aided Design, November 1991.","DOI":"10.1109\/ICCAD.1991.185210"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Y. Watanabe and R. K. Brayton. Incremental synthesis for engineering changes. In Proceedings of IEEE International Conference on Computer Design, pages 40\u201343, October 1991.","DOI":"10.1109\/ICCD.1991.139840"}],"container-title":["Lecture Notes in Computer Science","Field-Programmable Gate Arrays: Architecture and Tools for Rapid Prototyping"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57091-8_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:07:58Z","timestamp":1605647278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57091-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540570912","9783540479024"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-57091-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}