{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T21:10:01Z","timestamp":1737234601643,"version":"3.33.0"},"reference-count":7,"publisher":"Wiley","issue":"12","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":4097,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp; Computers in Japan"],"published-print":{"date-parts":[[1996,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Recently, due to remarkable technological developments and because their logic can be modified flexibly and easily, Field Programmable Gate Arrays (FPGAs) have increasingly been applied to hardware prototyping and the design of restructurable computer architectures. For this reason, it is highly necessary to establish logic design techniques for FPGAs.<\/jats:p><jats:p>This paper describes methods for optimizing the circuits mapped in look\u2010up table\u2010type FPGAs. These methods apply the concept of permissible functions from the transduction method, which is a logic circuit optimization technique based on design improvement, and attempt to reduce the degree of redundancy. The following two methods were investigated: 1) reducing the number of blocks by using a logic block to replace another; and 2) together with replacing logic blocks, modifying the internal logic that implements a logic block as long as the outputs are not affected. Although the latter generally is more flexible, the former requires less processing time and sometimes produces better results. The effectiveness of these methods is demonstrated by showing that the degree of redundancy was reduced by about 9 percent when the methods were applied to circuits mapped in look\u2010up table\u2010type FPGAs. The methods proposed in this paper can also be applied to designs using standard cells and gate arrays.<\/jats:p>","DOI":"10.1002\/scj.4690271208","type":"journal-article","created":{"date-parts":[[2007,7,8]],"date-time":"2007-07-08T10:22:51Z","timestamp":1183890171000},"page":"92-101","source":"Crossref","is-referenced-by-count":0,"title":["Optimization methods for look\u2010up table\u2010type FPGAs based on permissible functions"],"prefix":"10.1002","volume":"27","author":[{"given":"Shigeru","family":"Yamashita","sequence":"first","affiliation":[]},{"given":"Yahiko","family":"Kambayashi","sequence":"additional","affiliation":[]},{"given":"Sabura","family":"Muroga","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"R.Brayton E.Detjens S.Krishna T.Ma P.McGeer L.Pei N.Phillips R.Rudell R.Seagal A.Wang R.YungandA.Sangiovanni\u2010Vincentelli.Multiple\u2010Level Logic Optimization System.Proc. IEEE Int. Conf. on Computer Aided Design pp.356\u2013359(Nov.1986)."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/12.35836"},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","unstructured":"S.Minato N.IshiuraandS.Yajima.Shared Binary Decision Diagram with Attributed Edges for Efficient Boolean Function Manipulation.Proc. 27th Design Automation Conf. pp.52\u201357(June1990).","DOI":"10.1145\/123186.123225"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","unstructured":"R.Murgai Y.Nishizaki N.Schcnoy R.BraytonandA.Sangiovanni\u2010Vincentelli.Logic Synthesis for Programmable Gate Arrays.Proc. 27th Design Automation Conf. pp.620\u2013625(June1990).","DOI":"10.1145\/123186.123421"},{"key":"e_1_2_1_6_2","unstructured":"R. J.Francis J.RoseandZ.Vranesic.Technology Mapping for Delay Optimization of Lookup Table\u2010Base FPGAs. International Workshop on Logic Synthesis (1991)."},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"P. S.SawarandD. E.Thomas.Area and Delay Mapping for Table\u2010Look\u2010Up Based on FPGAs.Proc. 29th Design Automation Conf. pp.368\u2013373(June1992).","DOI":"10.1109\/DAC.1992.227776"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3572-0"}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690271208","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690271208","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T20:29:02Z","timestamp":1737232142000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690271208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":7,"journal-issue":{"issue":"12","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["10.1002\/scj.4690271208"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690271208","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"type":"print","value":"0882-1666"},{"type":"electronic","value":"1520-684X"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}