{"id":"https://openalex.org/W3141394097","doi":"https://doi.org/10.1109/date.2009.5090894","title":"On decomposing Boolean functions via extended cofactoring","display_name":"On decomposing Boolean functions via extended cofactoring","publication_year":2009,"publication_date":"2009-04-01","ids":{"openalex":"https://openalex.org/W3141394097","doi":"https://doi.org/10.1109/date.2009.5090894","mag":"3141394097"},"language":"en","primary_location":{"id":"doi:10.1109/date.2009.5090894","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2009.5090894","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 Design, Automation &amp; Test in Europe Conference &amp; Exhibition","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/A5032558381","display_name":"Anna Bernasconi","orcid":"https://orcid.org/0000-0003-0263-5221"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"A. Bernasconi","raw_affiliation_strings":["Department of Computer Science, University of Pisa, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076933640","display_name":"Valentina Ciriani","orcid":"https://orcid.org/0000-0002-0469-4201"},"institutions":[{"id":"https://openalex.org/I189158943","display_name":"University of Milan","ror":"https://ror.org/00wjc7c48","country_code":"IT","type":"education","lineage":["https://openalex.org/I189158943"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"V. Ciriani","raw_affiliation_strings":["Department of Information Technologies, University of Milano, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Technologies, University of Milano, Italy","institution_ids":["https://openalex.org/I189158943"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047355764","display_name":"Gabriella Trucco","orcid":"https://orcid.org/0000-0002-5904-0969"},"institutions":[{"id":"https://openalex.org/I189158943","display_name":"University of Milan","ror":"https://ror.org/00wjc7c48","country_code":"IT","type":"education","lineage":["https://openalex.org/I189158943"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"G. Trucco","raw_affiliation_strings":["Department of Information Technologies, University of Milano, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Technologies, University of Milano, Italy","institution_ids":["https://openalex.org/I189158943"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084281460","display_name":"Tiziano Villa","orcid":"https://orcid.org/0000-0002-9671-8804"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"T. Villa","raw_affiliation_strings":["Department of Computer Science, University of Pisa, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1464","last_page":"1469"},"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9987999796867371,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9980000257492065,"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/boolean-function","display_name":"Boolean function","score":0.7056828141212463},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.6878567337989807},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.6049772500991821},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5795758366584778},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.5632053017616272},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5429546236991882},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.4766410291194916},{"id":"https://openalex.org/keywords/logic-synthesis","display_name":"Logic synthesis","score":0.4724942743778229},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.4618939161300659},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.4169037640094757},{"id":"https://openalex.org/keywords/hamming-weight","display_name":"Hamming weight","score":0.4126071333885193},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40555059909820557},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38433319330215454},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.32541441917419434},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.24733728170394897},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.15140873193740845}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.7056828141212463},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.6878567337989807},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6049772500991821},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5795758366584778},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.5632053017616272},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5429546236991882},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.4766410291194916},{"id":"https://openalex.org/C157922185","wikidata":"https://www.wikidata.org/wiki/Q173198","display_name":"Logic synthesis","level":3,"score":0.4724942743778229},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.4618939161300659},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.4169037640094757},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.4126071333885193},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40555059909820557},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38433319330215454},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.32541441917419434},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24733728170394897},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.15140873193740845},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/date.2009.5090894","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2009.5090894","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 Design, Automation &amp; Test in Europe Conference &amp; Exhibition","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":13,"referenced_works":["https://openalex.org/W1518100416","https://openalex.org/W2015589329","https://openalex.org/W2080267935","https://openalex.org/W2096365323","https://openalex.org/W2105761964","https://openalex.org/W2106280822","https://openalex.org/W2116924811","https://openalex.org/W2135652786","https://openalex.org/W2147774239","https://openalex.org/W2165643425","https://openalex.org/W4248793972","https://openalex.org/W4253519003","https://openalex.org/W6834417848"],"related_works":["https://openalex.org/W2008960744","https://openalex.org/W2105471374","https://openalex.org/W2963549154","https://openalex.org/W2158117886","https://openalex.org/W1987803429","https://openalex.org/W1582340598","https://openalex.org/W1519122282","https://openalex.org/W1530654122","https://openalex.org/W2182731056","https://openalex.org/W2176368139"],"abstract_inverted_index":{"We":[0,96],"investigate":[1],"restructuring":[2],"techniques":[3],"based":[4,69],"on":[5,70,83],"decomposition/factorization,":[6],"with":[7,32,38,125],"the":[8,15,75,79,93,109],"objective":[9],"to":[10,40,88,127],"move":[11],"critical":[12,42],"signals":[13],"toward":[14],"output":[16],"while":[17],"minimizing":[18],"area.":[19],"A":[20],"specific":[21,41],"application":[22],"is":[23],"synthesis":[24],"for":[25,52],"minimum":[26,33],"switching":[27,50],"activity":[28,51],"(or":[29],"high":[30],"performance),":[31],"area":[34,124],"penalty,":[35],"where":[36],"decompositions":[37],"respect":[39,126],"variables":[43],"are":[44,68,105],"needed":[45],"(the":[46],"ones":[47],"of":[48,61,78,92,102,108],"highest":[49],"example).":[53],"In":[54],"this":[55],"paper":[56],"we":[57],"describe":[58],"new":[59,99],"types":[60],"factorization":[62],"that":[63,73,104],"extend":[64],"Shannon":[65,128],"cofactoring":[66],"and":[67,82],"projection":[71],"functions":[72],"change":[74],"Hamming":[76],"distance":[77],"original":[80],"minterms":[81],"appropriate":[84],"don't":[85],"care":[86],"sets,":[87],"favor":[89],"logic":[90],"minimization":[91],"component":[94],"blocks.":[95],"define":[97],"two":[98],"general":[100],"forms":[101],"decomposition":[103],"special":[106],"cases":[107],"pattern":[110],"F":[111],"=":[112],"G(H(X),Y).":[113],"The":[114],"related":[115],"implementations,":[116],"called":[117],"P-Circuits,":[118],"show":[119],"experimentally":[120],"promising":[121],"results":[122],"in":[123],"cofactoring.":[129]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}
