{"id":"https://openalex.org/W2141984024","doi":"https://doi.org/10.1145/1228784.1228886","title":"Area minimization algorithm for parallel prefix adders under bitwise delay constraints","display_name":"Area minimization algorithm for parallel prefix adders under bitwise delay constraints","publication_year":2007,"publication_date":"2007-03-11","ids":{"openalex":"https://openalex.org/W2141984024","doi":"https://doi.org/10.1145/1228784.1228886","mag":"2141984024"},"language":"en","primary_location":{"id":"doi:10.1145/1228784.1228886","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1228784.1228886","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th ACM Great Lakes symposium on VLSI","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/A5019864036","display_name":"Taeko Matsunaga","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Taeko Matsunaga","raw_affiliation_strings":["FLEETS, Fukuoka, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"FLEETS, Fukuoka, Japan","institution_ids":[]}]},{"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"],"raw_orcid":null,"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":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6369,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.7326193,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"435","last_page":"440"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9977999925613403,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9977999925613403,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9945999979972839,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/prefix","display_name":"Prefix","score":0.8054551482200623},{"id":"https://openalex.org/keywords/adder","display_name":"Adder","score":0.6181768774986267},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5809235572814941},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5626430511474609},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5186569094657898},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5034927725791931},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48280346393585205},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45987576246261597},{"id":"https://openalex.org/keywords/graph-reduction","display_name":"Graph reduction","score":0.41991323232650757},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34532493352890015},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3366091251373291},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.29563745856285095},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2795524001121521},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.06478866934776306}],"concepts":[{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.8054551482200623},{"id":"https://openalex.org/C164620267","wikidata":"https://www.wikidata.org/wiki/Q376953","display_name":"Adder","level":3,"score":0.6181768774986267},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5809235572814941},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5626430511474609},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5186569094657898},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5034927725791931},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48280346393585205},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45987576246261597},{"id":"https://openalex.org/C97042676","wikidata":"https://www.wikidata.org/wiki/Q5597097","display_name":"Graph reduction","level":3,"score":0.41991323232650757},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34532493352890015},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3366091251373291},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29563745856285095},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2795524001121521},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.06478866934776306},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1228784.1228886","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1228784.1228886","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th ACM Great Lakes symposium on VLSI","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322554","display_name":"Javna Agencija za Raziskovalno Dejavnost RS","ror":"https://ror.org/059bp8k51"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1486898914","https://openalex.org/W1551597857","https://openalex.org/W1587217691","https://openalex.org/W1963965124","https://openalex.org/W1979306010","https://openalex.org/W2131647018","https://openalex.org/W2163199256","https://openalex.org/W2168543008","https://openalex.org/W4235632527"],"related_works":["https://openalex.org/W4390550886","https://openalex.org/W3217463396","https://openalex.org/W2790557758","https://openalex.org/W2516396101","https://openalex.org/W3204929712","https://openalex.org/W4295102875","https://openalex.org/W2300671402","https://openalex.org/W2015457513","https://openalex.org/W1993041309","https://openalex.org/W4312888585"],"abstract_inverted_index":{"This":[0,15],"paper":[1],"addresses":[2],"parallel":[3,29],"prefix":[4,22,30,64,73,79,123],"adder":[5],"synthesis":[6,20],"which":[7,24],"targets":[8],"area":[9,46,96,114,137],"minimization":[10,47],"under":[11],"given":[12],"timing":[13],"constraints.":[14],"problem":[16],"is":[17,37,42,53,95],"treated":[18],"as":[19],"of":[21,28,59,63,72,110,122],"graphs":[23,65],"represent":[25],"global":[26],"structures":[27],"adders,":[31],"and":[32,75,106,136],"a":[33,56,151],"two-folded":[34],"robust":[35],"heuristic":[36],"proposed.":[38],"The":[39,92],"first":[40],"process":[41,94],"dynamic":[43,90],"programming":[44],"based":[45],"(DPAM),":[48],"where":[49],"the":[50,60,82,108,120],"search":[51],"space":[52,84],"limited":[54,83],"to":[55,132,150],"specific":[57],"subset":[58],"whole":[61],"set":[62],"by":[66,89,128,145],"imposing":[67],"some":[68,155],"restrictions":[69,103],"on":[70,104],"structure":[71],"graphs,":[74],"an":[76,133],"exact":[77],"minimum":[78],"graph":[80,124],"for":[81,112],"can":[85,125,141],"be":[86,126,143],"found":[87],"efficiently":[88],"programming.":[91],"second":[93],"reduction":[97],"with":[98],"re-structuring":[99],"(ARRS),which":[100],"removes":[101],"imposed":[102],"structure,":[105],"restructures":[107],"result":[109],"DPAM":[111],"further":[113],"reduction.":[115],"Experimental":[116],"results":[117],"show":[118],"that":[119],"size":[121],"reduced":[127,144],"about":[129],"10%":[130],"compared":[131,149],"existing":[134],"approach,":[135],"at":[138],"gate":[139],"level":[140],"also":[142],"more":[146],"than":[147],"30%":[148],"commercial":[152],"tool":[153],"in":[154],"case.":[156]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}