Full metadata record
DC FieldValueLanguage
dc.contributor.authorJiang, JHen_US
dc.contributor.authorJou, JYen_US
dc.contributor.authorHuang, JDen_US
dc.contributor.authorWei, JSen_US
dc.date.accessioned2014-12-08T15:27:39Z-
dc.date.available2014-12-08T15:27:39Z-
dc.date.issued1996en_US
dc.identifier.isbn0-7803-3662-3en_US
dc.identifier.urihttp://hdl.handle.net/11536/19922-
dc.description.abstractField Programmable Gate Arrays (FPGA's) are important devices for rapid system prototyping. Roth-Karp decomposition is one of the most popular decomposition techniques for Look-Up Table (LUT)-based FPGA technology mapping. In this paper, we propose a novel algorithm based on Binary Decision Diagrams (BDD's) for selecting good lambda set variables in Roth-Karp decomposition to minimize the number of consumed configurable logic blocks (CLB's) in FPGA's. The experimental results on a set of benchmarks show that our algorithm can produce much better results than those of the previous approach [1].en_US
dc.language.isoen_USen_US
dc.titleBDD based lambda set selection in Roth-Karp decomposition for LUT architectureen_US
dc.typeProceedings Paperen_US
dc.identifier.journalPROCEEDINGS OF THE ASP-DAC '97 - ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE 1997en_US
dc.citation.spage259en_US
dc.citation.epage264en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department電子工程學系及電子研究所zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentDepartment of Electronics Engineering and Institute of Electronicsen_US
dc.identifier.wosnumberWOS:A1996BJ06S00041-
Appears in Collections:Conferences Paper