{"id":"https://openalex.org/W3144903090","doi":"https://doi.org/10.1109/iccad.2010.5654210","title":"Bi-decomposition of large Boolean functions using blocking edge graphs","display_name":"Bi-decomposition of large Boolean functions using blocking edge graphs","publication_year":2010,"publication_date":"2010-11-01","ids":{"openalex":"https://openalex.org/W3144903090","doi":"https://doi.org/10.1109/iccad.2010.5654210","mag":"3144903090"},"language":"en","primary_location":{"id":"doi:10.1109/iccad.2010.5654210","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2010.5654210","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5059471428","display_name":"Mihir Choudhury","orcid":null},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mihir Choudhury","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Rice University, Houston, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Rice University, Houston, USA","institution_ids":["https://openalex.org/I74775410"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021693439","display_name":"Kartik Mohanram","orcid":null},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kartik Mohanram","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Rice University, Houston, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Rice University, Houston, USA","institution_ids":["https://openalex.org/I74775410"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74775410"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"586","last_page":"591"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9997000098228455,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9997000098228455,"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/T11522","display_name":"VLSI and FPGA Design Techniques","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/T10142","display_name":"Formal Methods in Verification","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/boolean-function","display_name":"Boolean function","score":0.6838536262512207},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5981379747390747},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5726181864738464},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5424751043319702},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.5267100930213928},{"id":"https://openalex.org/keywords/logic-synthesis","display_name":"Logic synthesis","score":0.46342670917510986},{"id":"https://openalex.org/keywords/and-inverter-graph","display_name":"And-inverter graph","score":0.44867655634880066},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.41315802931785583},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4020669758319855},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4009314775466919},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.3497750163078308},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29173246026039124},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14465820789337158}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6838536262512207},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5981379747390747},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5726181864738464},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5424751043319702},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.5267100930213928},{"id":"https://openalex.org/C157922185","wikidata":"https://www.wikidata.org/wiki/Q173198","display_name":"Logic synthesis","level":3,"score":0.46342670917510986},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.44867655634880066},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.41315802931785583},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4020669758319855},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4009314775466919},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.3497750163078308},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29173246026039124},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14465820789337158},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccad.2010.5654210","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2010.5654210","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W196895893","https://openalex.org/W1511688816","https://openalex.org/W1578592046","https://openalex.org/W1995135231","https://openalex.org/W2113137767","https://openalex.org/W2129183345","https://openalex.org/W2540953176","https://openalex.org/W4233996121","https://openalex.org/W6607924066","https://openalex.org/W6630623413","https://openalex.org/W6658119185"],"related_works":["https://openalex.org/W2150974517","https://openalex.org/W2063425181","https://openalex.org/W2060171268","https://openalex.org/W2728195892","https://openalex.org/W3144510369","https://openalex.org/W2516690985","https://openalex.org/W1976822807","https://openalex.org/W2062972911","https://openalex.org/W3029381898","https://openalex.org/W2744202010"],"abstract_inverted_index":{"Bi-decomposition":[0],"techniques":[1,34,48],"have":[2],"been":[3],"known":[4],"to":[5,113,134],"significantly":[6],"reduce":[7],"area,":[8],"delay,":[9],"and":[10,22,116,164,169,181],"power":[11],"during":[12],"logic":[13,45,152],"synthesis":[14],"since":[15],"they":[16],"can":[17],"explore":[18],"multi-level":[19],"and,":[20],"or,":[21],"xor":[23],"decompositions":[24],"in":[25,36,59],"a":[26,38,71,110,123],"scalable":[27,73],"technology-independent":[28],"manner.":[29],"The":[30],"complexity":[31],"of":[32,83,100,139,151,156,175],"bi-decomposition":[33,82,147],"is":[35,104],"achieving":[37],"good":[39],"variable":[40,55,79,118],"partition":[41],"for":[42,54,75,81,120],"the":[43,92,98,105,149,172],"given":[44],"function.":[46],"State-of-the-art":[47],"use":[49],"heuristics":[50],"and/or":[51,62],"brute-force":[52],"enumeration":[53],"partitioning,":[56],"which":[57],"results":[58,61,174],"sub-optimal":[60],"poor":[63],"scalability":[64],"with":[65,137],"function":[66],"complexity.":[67],"This":[68],"paper":[69],"describes":[70],"fast,":[72],"algorithm":[74,107],"obtaining":[76],"provably":[77],"optimum":[78],"partitions":[80,119],"Boolean":[84,135],"functions":[85,136],"by":[86,160],"constructing":[87],"an":[88,182],"undirected":[89],"graph":[90,95],"called":[91],"blocking":[93],"edge":[94],"(BEG).":[96],"To":[97],"best":[99,173],"our":[101,131],"knowledge,":[102],"this":[103],"first":[106],"that":[108,143],"demonstrates":[109],"systematic":[111],"approach":[112],"derive":[114],"disjoint":[115],"overlapping":[117],"bi-decomposition.":[121],"Since":[122],"BEG":[124],"has":[125],"only":[126],"one":[127],"vertex":[128],"per":[129],"input,":[130],"technique":[132],"scales":[133],"hundreds":[138],"inputs.":[140],"Results":[141],"indicate":[142],"on":[144],"average,":[145],"BEG-based":[146],"reduces":[148],"number":[150],"levels":[153],"(mapped":[154],"delay)":[155],"16":[157],"benchmark":[158],"circuits":[159],"60%,":[161],"34%,":[162],"45%,":[163],"30%":[165],"(20%,":[166],"19%,":[167],"16%":[168],"20%)":[170],"over":[171],"state-of-the-art":[176],"tools":[177],"FBDD,":[178],"SIS,":[179],"ABC,":[180],"industry-standard":[183],"synthesizer,":[184],"respectively.":[185]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}