{"id":"https://openalex.org/W3087122865","doi":"https://doi.org/10.1109/asp-dac52403.2022.9712548","title":"Delay Optimization of Combinational Logic by AND-OR Path Restructuring","display_name":"Delay Optimization of Combinational Logic by AND-OR Path Restructuring","publication_year":2022,"publication_date":"2022-01-17","ids":{"openalex":"https://openalex.org/W3087122865","doi":"https://doi.org/10.1109/asp-dac52403.2022.9712548","mag":"3087122865"},"language":"en","primary_location":{"id":"doi:10.1109/asp-dac52403.2022.9712548","is_oa":false,"landing_page_url":"https://doi.org/10.1109/asp-dac52403.2022.9712548","pdf_url":null,"source":{"id":"https://openalex.org/S4363608500","display_name":"2022 27th Asia and South Pacific Design Automation Conference (ASP-DAC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 27th Asia and South Pacific Design Automation Conference (ASP-DAC)","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/A5018201885","display_name":"Ulrich Brenner","orcid":null},"institutions":[{"id":"https://openalex.org/I2799411422","display_name":"Center for Discrete Mathematics and Theoretical Computer Science","ror":"https://ror.org/00k551w06","country_code":"US","type":"facility","lineage":["https://openalex.org/I102322142","https://openalex.org/I118347220","https://openalex.org/I1283103587","https://openalex.org/I1311060795","https://openalex.org/I20089843","https://openalex.org/I2799411422","https://openalex.org/I4210107353"]},{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE","US"],"is_corresponding":true,"raw_author_name":"Ulrich Brenner","raw_affiliation_strings":["Research Institute for Discrete Mathematics, University of Bonn,Germany","Research Institute for Discrete Mathematics, University of Bonn, Germany"],"affiliations":[{"raw_affiliation_string":"Research Institute for Discrete Mathematics, University of Bonn,Germany","institution_ids":["https://openalex.org/I2799411422"]},{"raw_affiliation_string":"Research Institute for Discrete Mathematics, University of Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070515465","display_name":"Anna Silvanus","orcid":null},"institutions":[{"id":"https://openalex.org/I2799411422","display_name":"Center for Discrete Mathematics and Theoretical Computer Science","ror":"https://ror.org/00k551w06","country_code":"US","type":"facility","lineage":["https://openalex.org/I102322142","https://openalex.org/I118347220","https://openalex.org/I1283103587","https://openalex.org/I1311060795","https://openalex.org/I20089843","https://openalex.org/I2799411422","https://openalex.org/I4210107353"]},{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE","US"],"is_corresponding":false,"raw_author_name":"Anna Silvanus","raw_affiliation_strings":["Research Institute for Discrete Mathematics University of Bonn,Germany","Research Institute for Discrete Mathematics University of Bonn, Germany"],"affiliations":[{"raw_affiliation_string":"Research Institute for Discrete Mathematics University of Bonn,Germany","institution_ids":["https://openalex.org/I2799411422"]},{"raw_affiliation_string":"Research Institute for Discrete Mathematics University of Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018201885"],"corresponding_institution_ids":["https://openalex.org/I135140700","https://openalex.org/I2799411422"],"apc_list":null,"apc_paid":null,"fwci":0.3222,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.32317013,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"19","issue":null,"first_page":"403","last_page":"409"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998000264167786,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998000264167786,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9994000196456909,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9991000294685364,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/netlist","display_name":"Netlist","score":0.7326247096061707},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.660318911075592},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5717619061470032},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5508020520210266},{"id":"https://openalex.org/keywords/restructuring","display_name":"Restructuring","score":0.5383798480033875},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5341756343841553},{"id":"https://openalex.org/keywords/logic-optimization","display_name":"Logic optimization","score":0.5032865405082703},{"id":"https://openalex.org/keywords/logic-synthesis","display_name":"Logic synthesis","score":0.48993104696273804},{"id":"https://openalex.org/keywords/combinational-logic","display_name":"Combinational logic","score":0.47180619835853577},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.45404329895973206},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4532833695411682},{"id":"https://openalex.org/keywords/sequential-logic","display_name":"Sequential logic","score":0.4299650192260742},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.3467525839805603},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2258041799068451}],"concepts":[{"id":"https://openalex.org/C177650935","wikidata":"https://www.wikidata.org/wiki/Q1760303","display_name":"Netlist","level":2,"score":0.7326247096061707},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.660318911075592},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5717619061470032},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5508020520210266},{"id":"https://openalex.org/C45237549","wikidata":"https://www.wikidata.org/wiki/Q1376796","display_name":"Restructuring","level":2,"score":0.5383798480033875},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5341756343841553},{"id":"https://openalex.org/C28449271","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Logic optimization","level":4,"score":0.5032865405082703},{"id":"https://openalex.org/C157922185","wikidata":"https://www.wikidata.org/wiki/Q173198","display_name":"Logic synthesis","level":3,"score":0.48993104696273804},{"id":"https://openalex.org/C81409106","wikidata":"https://www.wikidata.org/wiki/Q76505","display_name":"Combinational logic","level":3,"score":0.47180619835853577},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.45404329895973206},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4532833695411682},{"id":"https://openalex.org/C187075797","wikidata":"https://www.wikidata.org/wiki/Q173245","display_name":"Sequential logic","level":3,"score":0.4299650192260742},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.3467525839805603},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2258041799068451},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/asp-dac52403.2022.9712548","is_oa":false,"landing_page_url":"https://doi.org/10.1109/asp-dac52403.2022.9712548","pdf_url":null,"source":{"id":"https://openalex.org/S4363608500","display_name":"2022 27th Asia and South Pacific Design Automation Conference (ASP-DAC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 27th Asia and South Pacific Design Automation Conference (ASP-DAC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.44999998807907104,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1509016759","https://openalex.org/W1963965124","https://openalex.org/W1997582549","https://openalex.org/W1999116995","https://openalex.org/W2025635553","https://openalex.org/W2042714660","https://openalex.org/W2044850379","https://openalex.org/W2060108852","https://openalex.org/W2108633588","https://openalex.org/W2116873559","https://openalex.org/W2136750133","https://openalex.org/W2150577980","https://openalex.org/W2151822553","https://openalex.org/W2157778673","https://openalex.org/W2163199256","https://openalex.org/W2165643425","https://openalex.org/W2167757808","https://openalex.org/W2168543008","https://openalex.org/W2295333953","https://openalex.org/W2775802728","https://openalex.org/W2808107703","https://openalex.org/W3125659432","https://openalex.org/W3144114163","https://openalex.org/W3144155499","https://openalex.org/W3145367831","https://openalex.org/W3151499553","https://openalex.org/W4235507382","https://openalex.org/W4237147851","https://openalex.org/W4287554425","https://openalex.org/W6682359188","https://openalex.org/W6683722355","https://openalex.org/W6684581792","https://openalex.org/W6787590222"],"related_works":["https://openalex.org/W2386022279","https://openalex.org/W2157874690","https://openalex.org/W2499931839","https://openalex.org/W2110968362","https://openalex.org/W4390345338","https://openalex.org/W4238178324","https://openalex.org/W2113700423","https://openalex.org/W1939541994","https://openalex.org/W818963952","https://openalex.org/W2146663621"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,42,60,67,150],"timing":[3],"optimization":[4,128],"framework":[5,40,145],"that":[6,45],"replaces":[7],"critical":[8],"paths":[9,52,135],"by":[10],"logically":[11],"equivalent":[12],"realizations":[13],"with":[14,53],"less":[15],"delay.":[16],"Our":[17,103],"tool":[18,165],"allows":[19,129],"to":[20,77,92,125,131],"revise":[21],"early":[22],"decisions":[23],"on":[24,90,166],"the":[25,29,71,84,97,101,107,161],"logical":[26],"structure":[27,85],"of":[28,38,70,86,100,136,163],"netlist":[30],"in":[31,139,153],"late":[32,151],"physical":[33,156],"design.":[34],"The":[35,123,144],"core":[36],"routine":[37],"our":[39,140,164],"is":[41,59,66,146],"new":[43],"algorithm":[44,64,104],"constructs":[46],"delay-optimized":[47],"circuits":[48],"for":[49],"alternating":[50],"AND-OR":[51,126],"prescribed":[54],"input":[55],"arrival":[56],"times.":[57],"It":[58],"sophisticated":[61],"dynamic":[62],"programming":[63],"which":[65],"common":[68],"generalization":[69],"previously":[72],"best":[73,108],"approaches.":[74,122],"In":[75],"contrast":[76],"all":[78,120],"earlier":[79],"methods,":[80],"we":[81],"avoid":[82],"fixing":[83],"sub-solutions":[87],"before":[88],"deciding":[89],"how":[91],"combine":[93],"them,":[94],"significantly":[95],"expanding":[96],"search":[98],"space":[99],"algorithm.":[102],"provably":[105],"fulfills":[106],"known":[109],"approximation":[110],"guarantees,":[111],"almost":[112],"always":[113],"computes":[114],"delay-optimum":[115],"solutions,":[116],"and":[117],"empirically":[118],"outperforms":[119],"previous":[121],"reduction":[124],"path":[127],"us":[130],"optimize":[132],"general":[133],"combinatorial":[134],"arbitrary":[137],"length":[138],"logic":[141],"restructuring":[142],"framework.":[143],"applied":[147],"successfully":[148],"as":[149],"step":[152],"an":[154],"industrial":[155,167],"design":[157],"flow.":[158],"Experiments":[159],"demonstrate":[160],"effectiveness":[162],"7nm":[168],"instances.":[169]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}