{"id":"https://openalex.org/W1971609342","doi":"https://doi.org/10.1145/1723112.1723179","title":"A heuristic algorithm for LUT-based FPGA technology mapping using the lower bound for DAG covering problem (abstract only)","display_name":"A heuristic algorithm for LUT-based FPGA technology mapping using the lower bound for DAG covering problem (abstract only)","publication_year":2010,"publication_date":"2010-02-21","ids":{"openalex":"https://openalex.org/W1971609342","doi":"https://doi.org/10.1145/1723112.1723179","mag":"1971609342"},"language":"en","primary_location":{"id":"doi:10.1145/1723112.1723179","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1723112.1723179","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th annual ACM/SIGDA international symposium on Field programmable gate arrays","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103558074","display_name":"Taiga Takata","orcid":null},"institutions":[{"id":"https://openalex.org/I135598925","display_name":"Kyushu University","ror":"https://ror.org/00p4k0j84","country_code":"JP","type":"education","lineage":["https://openalex.org/I135598925"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Taiga Takata","raw_affiliation_strings":["Kyushu University, Fukuoka, Japan"],"affiliations":[{"raw_affiliation_string":"Kyushu University, Fukuoka, Japan","institution_ids":["https://openalex.org/I135598925"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083620892","display_name":"Yusuke Matsunaga","orcid":"https://orcid.org/0000-0002-8563-5835"},"institutions":[{"id":"https://openalex.org/I135598925","display_name":"Kyushu University","ror":"https://ror.org/00p4k0j84","country_code":"JP","type":"education","lineage":["https://openalex.org/I135598925"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yusuke Matsunaga","raw_affiliation_strings":["Kyushu University, Fukuoka, Japan"],"affiliations":[{"raw_affiliation_string":"Kyushu University, Fukuoka, Japan","institution_ids":["https://openalex.org/I135598925"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103558074"],"corresponding_institution_ids":["https://openalex.org/I135598925"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05723758,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"289","last_page":"289"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T14117","display_name":"Integrated Circuits and Semiconductor Failure Analysis","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T14117","display_name":"Integrated Circuits and Semiconductor Failure Analysis","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6724810600280762},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6564443111419678},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5720682740211487},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5598738789558411},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5559252500534058},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5352509617805481},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4744594991207123},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46765726804733276},{"id":"https://openalex.org/keywords/lookup-table","display_name":"Lookup table","score":0.45724180340766907},{"id":"https://openalex.org/keywords/field-programmable-gate-array","display_name":"Field-programmable gate array","score":0.4426576793193817},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.43261319398880005},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.4200168251991272},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.41685113310813904},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.41361871361732483},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.32222288846969604},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2719312310218811},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24552199244499207},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08887389302253723}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6724810600280762},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6564443111419678},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5720682740211487},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5598738789558411},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5559252500534058},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5352509617805481},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4744594991207123},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46765726804733276},{"id":"https://openalex.org/C134835016","wikidata":"https://www.wikidata.org/wiki/Q690265","display_name":"Lookup table","level":2,"score":0.45724180340766907},{"id":"https://openalex.org/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.4426576793193817},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.43261319398880005},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.4200168251991272},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.41685113310813904},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.41361871361732483},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.32222288846969604},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2719312310218811},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24552199244499207},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08887389302253723},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1723112.1723179","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1723112.1723179","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th annual ACM/SIGDA international symposium on Field programmable gate arrays","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3161514703","https://openalex.org/W3035974271","https://openalex.org/W2625547693","https://openalex.org/W1994440468","https://openalex.org/W2098682899","https://openalex.org/W3141113327","https://openalex.org/W2182648737","https://openalex.org/W2590727506","https://openalex.org/W4206915070","https://openalex.org/W2051329268"],"abstract_inverted_index":{"Technology":[0],"mapping":[1,112,143],"for":[2,60,98,177,229],"LUT-based":[3],"FPGAs":[4],"can":[5],"be":[6,30,77],"formulated":[7],"as":[8],"DAG":[9,99,105],"covering":[10,100],"problem":[11,101],"that":[12,158,173,188,225],"is":[13,27,49,59,123,152,167,185,221],"to":[14,29,38,53,93,144],"cover":[15],"given":[16],"Boolean":[17],"network":[18],"with":[19,114],"a":[20,50,57,90,104,107,198],"set":[21],"of":[22,69,132,141,197],"subgraphs":[23],"called":[24],"cones,":[25],"which":[26,48],"known":[28],"NP-hard.":[31],"So":[32],"far,":[33],"no":[34],"efficient":[35],"algorithm":[36,113],"exists":[37],"solve":[39],"it":[40,80],"exactly.":[41],"Existing":[42],"technology":[43,142],"mappers":[44],"employ":[45],"cost":[46,71,74,116,127,203],"flow":[47,75,117,128,204],"heuristic":[51],"metric":[52],"indicate":[54],"how":[55],"good":[56],"cone":[58],"total":[61,70],"cost,":[62],"i.e.":[63],"area":[64,166],"or":[65],"power.":[66],"The":[67,154],"estimation":[68],"based":[72,118,200],"on":[73,119,201,233],"might":[76],"inaccurate":[78],"because":[79],"does":[81],"not":[82],"consider":[83],"multiple":[84,133],"fanouts":[85,134],"adequately.":[86],"This":[87],"paper":[88],"proposes":[89],"novel":[91,111],"method":[92,161,191,214],"compute":[94],"the":[95,120,130,159,189,195,209,212],"lower":[96,121],"bound":[97,122],"by":[102,147,175,227],"transforming":[103],"into":[106],"tree":[108],"graph.":[109],"A":[110],"weighted":[115],"also":[124,186],"presented.":[125],"Weighted":[126],"considers":[129],"effect":[131],"accurately.":[135],"Cone":[136,206],"Resubstitution:":[137],"an":[138],"existing":[139],"post-processing":[140],"reduce":[145],"area/power":[146],"removing":[148],"unnecessary":[149],"node":[150],"duplications":[151],"employed.":[153],"experimental":[155],"results":[156],"show":[157],"proposed":[160,190,213],"generates":[162,215],"networks":[163,217],"whose":[164,218],"average":[165],"7%,":[168,169],"10%":[170,222],"smaller":[171,223],"than":[172,194,224],"generated":[174,226],"DAOmap":[176],"K":[178,230],"=":[179,231],"4,":[180],"5,":[181],"6":[182],"respectively.":[183],"It":[184],"shown":[187],"works":[192],"better":[193],"combination":[196],"mapper":[199],"traditional":[202],"and":[205],"Resubstitution.":[207],"On":[208],"other":[210],"hand,":[211],"LUT":[216],"dynamic":[219],"power":[220],"Emap":[228],"4":[232],"average.":[234]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}