完整後設資料紀錄
DC 欄位語言
dc.contributor.authorHWANG, TTen_US
dc.contributor.authorOWENS, RMen_US
dc.contributor.authorIRWIN, MJen_US
dc.contributor.authorWANG, KHen_US
dc.date.accessioned2014-12-08T15:03:45Z-
dc.date.available2014-12-08T15:03:45Z-
dc.date.issued1994-10-01en_US
dc.identifier.issn0278-0070en_US
dc.identifier.urihttp://dx.doi.org/10.1109/43.317471en_US
dc.identifier.urihttp://hdl.handle.net/11536/2294-
dc.description.abstractIn this paper, we consider the problem of configuring Field Programmable Gate Arrays (FPGA's) so that some given function is computed by the device. Obtaining the information necessary to configure a FPGA entails both logic synthesis and logic embedding. Due to the very constrained nature of the embedding process, this problem differs from traditional multilevel logic synthesis in that the structure (or lack thereof) of the synthesized logic is much more important. Furthermore, a metric-like literal count is much less important. We present a communication complexity-based decomposition technique that appears to be more suitable for FPGA synthesis than other multilevel logic synthesis methods. The key is that our logic optimization technique based on reducing communication complexity is good enough to allow a simple technology mapping to work well for FPGA devices.en_US
dc.language.isoen_USen_US
dc.titleLOGIC SYNTHESIS FOR FIELD-PROGRAMMABLE GATE ARRAYSen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/43.317471en_US
dc.identifier.journalIEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMSen_US
dc.citation.volume13en_US
dc.citation.issue10en_US
dc.citation.spage1280en_US
dc.citation.epage1287en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:A1994PG04500009-
dc.citation.woscount13-
顯示於類別:期刊論文


文件中的檔案:

  1. A1994PG04500009.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。