{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T06:10:30Z","timestamp":1698127830264},"reference-count":8,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":5558,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp;amp; Computers in Japan"],"published-print":{"date-parts":[[1992,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The design problem of two\u2010level MOS networks with a minimum number of cells is reduced to the covering problem of graphs with a minimum number of cliques.<\/jats:p><jats:p>When every node of the graph corresponds to a minterm, an algorithm which generates an MOS network with a minimum number of cells is presented. The time complexity of this algorithm is <jats:italic>O(M)<\/jats:italic><jats:sup>2<\/jats:sup>, where <jats:italic>M<\/jats:italic> is the number of minterms.<\/jats:p><jats:p>When every node of the graph corresponds to a prime implicant, a procedure which generates near optimum solutions by selecting prime implicants with special properties is presented. About 2 percent of designed networks for four\u2010variable functions are not minimal ones.<\/jats:p>","DOI":"10.1002\/scj.4690230102","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T21:18:51Z","timestamp":1183843131000},"page":"15-24","source":"Crossref","is-referenced-by-count":0,"title":["Graph representation of logic functions to design two\u2010level MOS networks"],"prefix":"10.1002","volume":"23","author":[{"given":"Yasuaki","family":"Nishitani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kensuke","family":"Shimizu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiko","family":"Nagumo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223081"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223331"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1972.223425"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224084"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1978.1674970"},{"key":"e_1_2_1_7_2","volume-title":"Logic Design and Switching Theory","author":"Muroga S.","year":"1979"},{"key":"e_1_2_1_8_2","volume-title":"How to Design and Use PLA","author":"Sasao T.","year":"1985"},{"key":"e_1_2_1_9_2","volume-title":"Logic Minimization Algorithm for VLSI Synthesis","author":"Brayton R. K.","year":"1985"}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690230102","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690230102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T01:39:01Z","timestamp":1698111541000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690230102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["10.1002\/scj.4690230102"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690230102","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}