{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T06:41:12Z","timestamp":1698043272906},"reference-count":13,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":6653,"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":[[1989,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>It is desired to reduce the area of mask PLA to save the silicon area and improve the switching speed. In the usual methods for folding, the columns and\/or rows are folded with cuts. On the contrary, recently, a new folding technique has been proposed by the authors. In that technique, a variable line and its negation are folded into one line by inserting an inverter. This paper formulates that folding by using the regular ternary logic function and then clarifies its properties. An algorithm is described which generates the maximum folding. Some experimental results indicate that this algorithm is effective. It is easy to implement the algorithm on computers.<\/jats:p>","DOI":"10.1002\/scj.4690200401","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T17:37:28Z","timestamp":1183829848000},"page":"1-10","source":"Crossref","is-referenced-by-count":0,"title":["Maximum PLA folding using inverters"],"prefix":"10.1002","volume":"20","author":[{"given":"Yukihiro","family":"Iguchi","sequence":"first","affiliation":[]},{"given":"Masao","family":"Mukaidono","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676738"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1147\/rd.185.0443"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-2821-6"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676349"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675427"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.1982.1269996"},{"key":"e_1_2_1_8_2","doi-asserted-by":"crossref","unstructured":"J. R.EganandC. L.Liu.Optimal bipartite folding of PLA. Proc. 19th Design Automation Conf. pp.141\u2013146(June1982).","DOI":"10.1109\/DAC.1982.1585493"},{"key":"e_1_2_1_9_2","doi-asserted-by":"crossref","unstructured":"G. D.Hachtel.Techniques for programmable logic array folding. Proc. 19th Design Automation Conf. pp.147\u2013155(June1982).","DOI":"10.1109\/DAC.1982.1585494"},{"key":"e_1_2_1_10_2","doi-asserted-by":"crossref","unstructured":"G. D.MicheliandA. L.Sangiovanni\u2010Vincentelli.PLEASURE: A computer program for simple\/multiple constrained\/unconstrained folding of programmable logic array. Proc. 20th Design Automation Conf. pp.530\u2013537(June1983).","DOI":"10.1109\/DAC.1983.1585704"},{"key":"e_1_2_1_11_2","doi-asserted-by":"crossref","unstructured":"Y. S.Kuo C.ChenandT. C.Hu.A heuristic algorithm for PLA block folding. Proc. 22nd Design Automation Conf. pp.744\u2013747(June1985).","DOI":"10.1109\/DAC.1985.1586027"},{"issue":"12","key":"e_1_2_1_12_2","first-page":"1155","article-title":"One\u2010cut row folding for FPLA (in Japanese)","volume":"27","author":"Iguchi Y.","year":"1986","journal-title":"Journal of Information Processing"},{"issue":"8","key":"e_1_2_1_13_2","first-page":"829","article-title":"PLA folding using inverters","volume":"27","author":"Iguchi Y.","year":"1986","journal-title":"Journal of Information Processing"},{"key":"e_1_2_1_14_2","volume-title":"Optimal PLA folding using inverters. Proc.","author":"Iguchi Y.","year":"1986"}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690200401","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690200401","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T13:17:08Z","timestamp":1697980628000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690200401"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["10.1002\/scj.4690200401"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690200401","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}